Extended finite automata over groups

DOI10.1016/S0166-218X(00)00200-6MaRDI QIDQ5929312zbMATH OpenWikidataFDO

Authors Victor Mitrana, Ralf Stiebe

Publication date 4 April 2001

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

Full work available at URL https://doi.org/10.1016/S0166-218X(00)00200-6

zbMATH Keywords

Abelian groupsdeterministic finite automatafinite automata over arbitrary groups

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1972789
• Finite automata over free groups
• EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
• On finite and Abelian groups generated by finite automata.
• scientific article; zbMATH DE number 5155118

Cites work

• Finite automata with multiplication
• scientific article; zbMATH DE number 3725728 (Why is no real title available?)
• scientific article; zbMATH DE number 706263 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Remarks on blind and partially blind one-way multicounter machines
• Studies in abstract families of languages

Cited in

(34)

• Representations of group automata
• Automata over finite T-quasigroups
• DM-automata and classes of context-free languages
• 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
• Recent advances on reachability problems for valence systems (invited talk)
• Finite automata over free groups
• 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
• HYBRID EXTENDED FINITE AUTOMATA
• Polycyclic and Bicyclic Valence Automata
• Languages recognized by finite supersoluble groups
• GENERALIZED COUNTERS AND REVERSAL COMPLEXITY
• Formal Languages and Groups as Memory
• scientific article; zbMATH DE number 1972789 (Why is no real title available?)
• Multipass automata and group word problems
• scientific article; zbMATH DE number 7444014 (Why is no real title available?)
• Language classes associated with automata over matrix groups
• Automata with counters that recognize word problems of free products
• EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
• Unambiguous constrained automata
• Hybrid Extended Finite Automata
• 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
• Remarks on Parikh-recognizable omega-languages
• The theory of reachability of trace-pushdown systems
• History-deterministic Parikh automata
• History-deterministic Parikh automata
• Reachability in trace-pushdown systems
• Non-uniform automata over groups

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5929312)