On solving star equations

DOI10.1016/0304-3975(85)90147-1zbMath0607.68056OpenAlexW2071797317MaRDI QIDQ1085619

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)90147-1

zbMATH Keywords

language equation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Language equations over a one-letter alphabet with union, concatenation and star: A complete solution, Unrestricted complementation in language equations over a one-letter alphabet, Implicit language equations: existence and uniqueness of solutions

Cites Work

• On classes of tractable unrestricted regular expressions
• On generalized language equations
• Unrestricted complementation in language equations over a one-letter alphabet
• A regularity test for pushdown machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item