THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA

DOI10.1142/S0129054105003121zbMath1097.68058MaRDI QIDQ5462120

Yo-Sub Han, Derick Wood

Publication date: 1 August 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Expression automatastate elimination and prefix-freeness

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES ⋮ Deciding determinism of caterpillar expressions ⋮ Obtaining shorter regular expressions from finite-state automata ⋮ Insertion operations on deterministic reversal-bounded counter machines ⋮ Prefix-free regular languages and pattern matching ⋮ Generalizations of 1-deterministic regular languages ⋮ State complexity of basic operations on suffix-free regular languages

Cites Work

• Deterministic generalized automata
• Unnamed Item
• Unnamed Item

This page was built for publication: THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA