Context-sensitive languages and G-automata

DOI10.1142/S0218196717500102zbMath1368.20032OpenAlexW2594005734MaRDI QIDQ2986660

Rachel Bishop-Ross, James Lance Ross, Jon Michael Corson

Publication date: 16 May 2017

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

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

zbMATH Keywords

word problemgrammarpullbackcontext-sensitive language\(G\)-automatonrecursive language\(G\)-automaton without \(\varepsilon\)-transitions

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A course in formal languages, automata and groups
• Formal Languages and Groups as Memory
• A NOTE ON CONTEXT-SENSITIVE LANGUAGES AND WORD PROBLEMS
• Automata with Counters that Recognize Word Problems of Free Products
• EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
• Extended finite automata over groups

This page was built for publication: Context-sensitive languages and G-automata