On equations for union-free regular languages

DOI10.1006/inco.2000.2889zbMath1005.08001OpenAlexW1973446781MaRDI QIDQ1854402

Igor Dolinka, Siniša Crvenković, Zoltán Ésik

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2889

zbMATH Keywords

varietyregular languagesKleene algebrasalgebras of binary relations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Applications of universal algebra in computer science (08A70)

Related Items (9)

Axiomatizing the equational theory of regular tree languages ⋮ COMPLEXITY IN UNION-FREE REGULAR LANGUAGES ⋮ The multiplicative fragment of the Yanov equational theory ⋮ Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages ⋮ Equational theories for automata ⋮ On axioms for commutative regular equations without addition. ⋮ Closure properties of subregular languages under operations ⋮ Union-complexities of Kleene plus operation ⋮ Operational union-complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equational properties of Kleene algebras of relations with conversion
• Complete systems of \(\mathcal B\)-rational identities
• On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
• Group axioms for iteration
• A completeness theorem for Kleene algebras and the algebra of regular events
• The equational logic of fixed points
• The variety of Kleene algebras with conversion is not finitely based
• Equational axioms for regular sets
• Two Complete Axiom Systems for the Algebra of Regular Events
• On Kleene algebras

This page was built for publication: On equations for union-free regular languages