Semigroup automata with rational initial and terminal sets

DOI10.1016/j.tcs.2009.11.007zbMath1187.68299arXiv0708.0947OpenAlexW1986779802MaRDI QIDQ2268859

Elaine Render, Mark Kambites

Publication date: 9 March 2010

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

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

zbMATH Keywords

semigroupsrational subsets\(G\)-automataextended automatavalence automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

On Boolean closed full trios and rational Kripke frames ⋮ Unnamed Item ⋮ On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids ⋮ New Results on Vector and Homing Vector Automata ⋮ Language classes associated with automata over matrix groups ⋮ Automata with Counters that Recognize Word Problems of Free Products

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On groups whose word problem is solved by a counter automaton.
• On the rational subset problem for groups.
• Rational subsets of polycyclic monoids and valence automata
• Easy multiplications. I: The realm of Kleene's theorem
• Transductions des langages de Chomsky
• Sequential grammars and automata with valences
• Word problems recognisable by deterministic blind monoid automata
• Polycyclic and Bicyclic Valence Automata
• Formal Languages and Groups as Memory
• VALENCE GRAMMARS WITH TARGET SETS