Generalized language equations with multiple solutions

DOI10.1016/0304-3975(86)90115-5MaRDI QIDQ1084871zbMATH OpenOpenAlexFDO

Authors 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

L-expressionsregular language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Maximal and minimal solutions to language equations
• Solutions of equations in languages
• Implicit language equations: existence and uniqueness of solutions
• Decision problems for language equations
• Generalized langford languages
• Language equations with complementation: decision problems
• scientific article; zbMATH DE number 1318043
• Language equations
• On language equations with invertible operations
• Language Equations with Complementation

Cites work

• Derivatives of Regular Expressions
• scientific article; zbMATH DE number 3307592 (Why is no real title available?)
• On classes of tractable unrestricted regular expressions
• On equations for regular languages, finite automata, and sequential networks
• On generalized language equations
• Unrestricted complementation in language equations over a one-letter alphabet

Cited in

(15)

• On solving star equations
• 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
• Nondeterministic regular expressions as solutions of equational systems.
• Language equations
• Solutions to the involution language equation
• scientific article; zbMATH DE number 3915631 (Why is no real title available?)
• On the role of complementation in implicit language equations and relations
• scientific article; zbMATH DE number 1318043 (Why is no real title available?)
• scientific article; zbMATH DE number 1932216 (Why is no real title available?)
• Developments in Language Theory
• Solutions of equations in languages
• Implicit language equations: existence and uniqueness of solutions
• Rewriting extended regular expressions
• Maximal and minimal solutions to language equations

This page was built for publication: Generalized language equations with multiple solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1084871)