Generalized language equations with multiple solutions

DOI10.1016/0304-3975(86)90115-5zbMath0606.68071OpenAlexW1970375533MaRDI QIDQ1084871

Ernst L. Leiss

Publication date: 1986

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

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

zbMATH Keywords

regular languageL-expressions

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, On the role of complementation in implicit language equations and relations, Implicit language equations: existence and uniqueness of solutions, Rewriting extended regular expressions

Cites Work

• Unnamed Item
• On equations for regular languages, finite automata, and sequential networks
• On classes of tractable unrestricted regular expressions
• On generalized language equations
• Unrestricted complementation in language equations over a one-letter alphabet
• Derivatives of Regular Expressions