THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA
From MaRDI portal
Publication:5462120
DOI10.1142/S0129054105003121zbMath1097.68058MaRDI QIDQ5462120
Publication date: 1 August 2005
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q45: Formal languages and automata
Related Items
INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES, Deciding determinism of caterpillar expressions, Obtaining shorter regular expressions from finite-state automata, Generalizations of 1-deterministic regular languages, State complexity of basic operations on suffix-free regular languages, Insertion operations on deterministic reversal-bounded counter machines, Prefix-free regular languages and pattern matching
Cites Work