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...
|Published in:||Acta Informatica, Vol. 51, No. 5 (2014), p. 327-337|
|Other Involved Persons:|
|QR Code:||Show QR Code|