A Characterization of Those Automata That Structurally Generate Finite Groups

DOI10.1007/978-3-642-54423-1_16zbMath1407.68319arXiv1310.7137OpenAlexW2963673766MaRDI QIDQ5405038

Matthieu Picantin, Ines Klimann

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

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

zbMATH Keywords

automaton groupsMealy automatafiniteness problem

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (1)

A New Hierarchy for Automaton Semigroups

This page was built for publication: A Characterization of Those Automata That Structurally Generate Finite Groups