Polycyclic and Bicyclic Valence Automata

DOI10.1007/978-3-540-88282-4_42zbMath1156.68463OpenAlexW2171935386MaRDI QIDQ3540137

Mark Kambites, Elaine Render

Publication date: 20 November 2008

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-88282-4_42

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (2)

Groups whose word problems are accepted by abelian \(G\)-automata ⋮ Semigroup automata with rational initial and terminal sets

Cites Work

• On the rational subset problem for groups.
• Rational subsets of polycyclic monoids and valence automata
• Monadic Thue systems
• Remarks on blind and partially blind one-way multicounter machines
• Sequential grammars and automata with valences
• Formal Languages and Groups as Memory
• VALENCE GRAMMARS WITH TARGET SETS
• Extended finite automata over groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polycyclic and Bicyclic Valence Automata