EXTENDED FINITE AUTOMATA AND WORD PROBLEMS

DOI10.1142/S0218196705002360zbMath1098.68067OpenAlexW2094818329MaRDI QIDQ5316306

Jon Michael Corson

Publication date: 12 September 2005

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196705002360

zbMATH Keywords

context-free language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (10)

Groups whose word problems are accepted by abelian \(G\)-automata ⋮ On the Degree of Extension of Some Models Defining Non-Regular Languages ⋮ Homing vector automata ⋮ On the group memory complexity of extended finite automata over groups ⋮ Context-sensitive languages and G-automata ⋮ ON GROUPS AND COUNTER AUTOMATA ⋮ New Results on Vector and Homing Vector Automata ⋮ Formal Languages and Groups as Memory ⋮ Language classes associated with automata over matrix groups ⋮ Automata with Counters that Recognize Word Problems of Free Products

Cites Work

• Groups, the theory of ends, and context-free languages
• Extended finite automata over groups
• Unnamed Item
• Unnamed Item

This page was built for publication: EXTENDED FINITE AUTOMATA AND WORD PROBLEMS