Abstract
Decidability of the Star Problem, the problem whether the language IP* is recognizable for a recognizable language IP, remains open. We slightly generalize the problem and show that then its decidability status depends strongly on the assumptions considering the trace mo- noid and finiteness of IP. More precisely, we show that for finite set IP ⊂ {A,B}* × {C}*and recognizable IR it is decidable whether IP* ∩IR is recognizable, but the problem becomes undecidable if we consider re- cognizable (infinite) IP or finite IP ⊂ {A,B}* × {C,D}*. © Springer-Verlag Berlin Heidelberg 1999.
Cite
CITATION STYLE
Kirsten, D., & Marcinkowski, J. (1999). Two techniques in the area of the star problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1644 LNCS, pp. 483–492). Springer Verlag. https://doi.org/10.1007/3-540-48523-6_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
