On axioms for commutative regular equations without addition.

DOI10.1016/S0304-3975(01)00339-5zbMath1061.68089OpenAlexW2090659994WikidataQ114655903 ScholiaQ114655903MaRDI QIDQ1853544

Siniša Crvenković, Igor Dolinka

Publication date: 21 January 2003

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(01)00339-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Equational classes, universal algebra in model theory (03C05)

Cites Work

• A note on equations for commutative regular languages
• Representation theorems on regular languages
• On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based
• On equations for union-free regular languages
• The complexity of equivalence problems for commutative grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On axioms for commutative regular equations without addition.