Language equations over a one-letter alphabet with union, concatenation and star: A complete solution

DOI10.1016/0304-3975(94)90177-5zbMath0861.68052OpenAlexW2014950397MaRDI QIDQ1331941

Ernst L. Leiss

Publication date: 11 May 1997

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

Full work available at URL: https://doi.org/10.1016/0304-3975(94)90177-5

zbMATH Keywords

regular languagelanguage equationscontext-free grammer

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Unrestricted complementation in language equations over a one-letter alphabet ⋮ A new algorithm for regularizing one-letter context-free grammars. ⋮ Implicit language equations: existence and uniqueness of solutions

Cites Work

• On equations for regular languages, finite automata, and sequential networks
• Generalized language equations with multiple solutions
• On solving star equations
• On generalized language equations
• Two Families of Languages Related to ALGOL
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Language equations over a one-letter alphabet with union, concatenation and star: A complete solution