๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Decidability Equivalence between the Star Problem and the Finite Power Problem in Trace Monoids

โœ Scribed by D. Kirsten<ORF RID="A1">

Publisher
Springer
Year
2001
Tongue
English
Weight
240 KB
Volume
34
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Two techniques in the area of the star p
Two techniques in the area of the star problem in trace monoids
โœ Daniel Kirsten; Jerzy Marcinkowski ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 565 KB

This paper deals with decision problems related to the star problem in trace monoids which means to determine whether the iteration of a recognizable trace language is recognizable. Due to a theorem by Richomme (in: I.