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 groupsdeterministic finite automatafinite automata over arbitrary groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (18)

EXTENDED FINITE AUTOMATA AND WORD PROBLEMS ⋮ Groups whose word problems are accepted by abelian \(G\)-automata ⋮ Jump complexity of finite automata with translucent letters ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Recent advances on reachability problems for valence systems (invited talk) ⋮ Homing vector automata ⋮ Unnamed Item ⋮ On the group memory complexity of extended finite automata over groups ⋮ Context-sensitive languages and G-automata ⋮ Polycyclic and Bicyclic Valence Automata ⋮ On the Expressive Power of Valences in Cooperating Distributed Grammar Systems ⋮ On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids ⋮ GENERALIZED COUNTERS AND REVERSAL COMPLEXITY ⋮ Word problems recognisable by deterministic blind monoid automata ⋮ Formal Languages and Groups as Memory ⋮ UNAMBIGUOUS CONSTRAINED AUTOMATA ⋮ Automata with Counters that Recognize Word Problems of Free Products ⋮ Characterization and complexity results on jumping finite automata

Cites Work

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

This page was built for publication: Extended finite automata over groups