Extended finite automata over groups

DOI10.1016/S0166-218X(00)00200-6zbMath0971.68093WikidataQ127352146 ScholiaQ127352146MaRDI QIDQ5929312

Victor Mitrana, Ralf Stiebe

Publication date: 4 April 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Abelian groups; deterministic finite automata; finite automata over arbitrary groups

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Unnamed Item, Automata with Counters that Recognize Word Problems of Free Products, EXTENDED FINITE AUTOMATA AND WORD PROBLEMS, UNAMBIGUOUS CONSTRAINED AUTOMATA, On the group memory complexity of extended finite automata over groups, Characterization and complexity results on jumping finite automata, Word problems recognisable by deterministic blind monoid automata, Homing vector automata, Context-sensitive languages and G-automata, On the Expressive Power of Valences in Cooperating Distributed Grammar Systems, On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids, Polycyclic and Bicyclic Valence Automata, GENERALIZED COUNTERS AND REVERSAL COMPLEXITY, Formal Languages and Groups as Memory

Cites Work

• Finite automata with multiplication
• Remarks on blind and partially blind one-way multicounter machines
• Studies in abstract families of languages
• Unnamed Item
• Unnamed Item
• Unnamed Item