On classes of tractable unrestricted regular expressions

DOI10.1016/0304-3975(85)90021-0zbMath0571.68072OpenAlexW1974524045MaRDI QIDQ1061498

Ernst L. Leiss

Publication date: 1985

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90021-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

Generalized language equations with multiple solutions ⋮ On solving star equations ⋮ State-complexity of finite-state devices, state compressibility and incompressibility ⋮ On the role of complementation in implicit language equations and relations

Cites Work

• On equations for regular languages, finite automata, and sequential networks
• The complexity of restricted regular expressions and the synthesis problem for finite automata
• On generalized language equations
• Succinct representation of regular languages by Boolean automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On classes of tractable unrestricted regular expressions