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...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:Acta Informatica, Vol. 51, No. 5 (2014), p. 327-337
1. Verfasser: Meduna, Alexander
Weitere beteiligte Personen: Zemek, Petr
Format: elektronischer Aufsatz
Sprache:English
ISSN:1432-0525
Umfang:Online-Ressource
DOI:10.1007/s00236-014-0199-5
Schlagworte:
QR-Code: QR-Code anzeigen