Language classes associated with automata over matrix groups

DOI10.1051/ita/2018017zbMath1429.68105arXiv1609.00396OpenAlexW2963259539MaRDI QIDQ5223619

A. C. Cem Say, Flavio D'Alessandro

Publication date: 18 July 2019

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.00396

zbMATH Keywords

time complexitygroup automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Turing machine time hierarchy
• On groups whose word problem is solved by a counter automaton.
• Finite automata with multiplication
• Remarks on blind and partially blind one-way multicounter machines
• Automaticity. III: Polynomial automaticity and context-free languages
• Semigroup automata with rational initial and terminal sets
• FINITE AUTOMATA OVER FREE GROUPS
• ON GROUPS AND COUNTER AUTOMATA
• Formal Languages and Groups as Memory
• Subgroups of Direct Products of Free Groups
• EXTENDED FINITE AUTOMATA AND WORD PROBLEMS
• Silent Transitions in Automata with Storage

This page was built for publication: Language classes associated with automata over matrix groups