On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids

DOI10.1007/978-3-642-22012-8_17zbMath1333.68189arXiv1103.3361OpenAlexW2130633535MaRDI QIDQ3012922

Georg Zetzsche

Publication date: 7 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1103.3361

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Grammars and rewriting systems (68Q42)

Related Items (3)

On Boolean closed full trios and rational Kripke frames ⋮ Unnamed Item ⋮ On the group memory complexity of extended finite automata over groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rational subsets of polycyclic monoids and valence automata
• Remarks on blind and partially blind one-way multicounter machines
• Sequential grammars and automata with valences
• Group weighted finite transducers.
• Semigroup automata with rational initial and terminal sets
• Formal Languages and Groups as Memory
• A helpful result for proving inherent ambiguity
• Extended finite automata over groups

This page was built for publication: On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids