Controlled finite automata

This paper discusses finite automata regulated by control languages over their states and transition rules. It proves that under both regulations, regular-controlled finite automata and context-free-controlled finite automata characterize the family of regular languages and the family of context-fre...

Full description

Bibliographic Details
Published in:Acta Informatica, Vol. 51, No. 5 (2014), p. 327-337
Main Author: Meduna, Alexander
Other Involved Persons: Zemek, Petr
Format: electronic Article
Language:English
ISSN:1432-0525
Physical Description:Online-Ressource
DOI:10.1007/s00236-014-0199-5
Subjects:
QR Code: Show QR Code