Commutative one-counter languages are regular

DOI10.1016/0022-0000(84)90013-8zbMath0549.68074OpenAlexW2014294552MaRDI QIDQ800097

Grzegorz Rozenberg, Michel Latteux

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90013-8

zbMATH Keywords

regular languagescommutative languagescommutative closureone-counter languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

Rational languages and the Burnside problem ⋮ On total regulators generated by derivation relations ⋮ Well quasi-orders and regular languages ⋮ Jumping Finite Automata: Characterizations and Complexity ⋮ Regularity Conditions for Iterated Shuffle on Commutative Regular Languages ⋮ On (left) partial shuffle ⋮ Unnamed Item ⋮ On the Hurwitz product of formal power series and automata ⋮ Scattered deletion and commutativity ⋮ Characterization and complexity results on jumping finite automata

Cites Work

• Langages à un compteur
• On the usefulness of bifaithful rational cones
• Pumping Lemmas for Regular Sets
• Ordering by Divisibility in Abstract Algebras
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Commutative one-counter languages are regular