Undecidability in integer weighted finite automata

Fundamenta Informaticae

Volumn 38, Issue 1-2, 1999, Pages 189-200

  Halava, Vesa ^a   Harju, Tero ^b  

^a TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

^b UNIVERSITY OF TURKU   (Finland)

Author keywords

Unimodal; Universe problem; Weighted finite automata

Indexed keywords

EID: 0039721680     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-381215     Document Type: Article

References (7)

1. B. Baker and R. Book, Reversal-bounded multipushdown machines, J. Comput. System Sci. 8 (1974), 315-332.
2. S. A. Greibach, An infinite hierarchy of context-free languages, J. Assoc. Comput. Mach. 16 (1969), 91-106.
3. V. Halava, Finite Substitutions and Integer Weighted Finite Automata, Tech. Report 197, Turku Centre for Computer Science, August 1998.
4. V. Halava and T. Harju, Undecidability of the equivalence of finite substitutions on regular language, RAIRO Inform. Théor. Appl., to appear.
5. O. H. Ibarra, Restricted one-counter machines with undecidable universe problems, Math. Systems Theory 13 (1979), 181-186.
6. L. P. Lisovik, Nondeterministic systems and finite substitutions on regular language, Bulletin of the EATCS, no. 63, 1997, pp. 156-160.
7. V. Mitrana and R. Stiebe, The accepting power of finite automata over groups, New Trends in Formal Language (G. Pǎun and A. Salomaa, eds.), Lecture Notes in Comput. Sci., vol. 1218, Springer-Verlag, 1997, pp. 39-48.