The concept of duality for automata over a changing alphabet and generation of a free group by such automata

DOI10.1016/j.tcs.2011.08.017zbMath1230.68139arXiv1607.07644MaRDI QIDQ653339

Adam Woryna

Publication date: 9 January 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

2-state automaton; automaton over a changing alphabet; Mealy-type automaton

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q70: Algebraic theory of languages and automata

20E05: Free nonabelian groups

Related Items

The Automaton Realization of Iterated Wreath Products of Cyclic Groups, The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata, On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups, The characterization by automata of certain profinite groups., On groups generated by bi-reversible automata: the two-state case over a changing alphabet, The classification of abelian groups generated by time-varying automata and by Mealy automata over the binary alphabet, Freeness of automaton groups vs boundary dynamics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automata generating free products of groups of order 2.
• Piecewise automatic groups.
• On a series of finite automata defining free transformation groups.
• Automaton semigroups
• The complexity of Grigorchuk groups with application to cryptography
• Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985)
• Free group of infinite unitriangular matrices
• The smallest Mealy automaton of intermediate growth.
• Automatically presented groups.
• Automata and square complexes.
• On a free group of transformations defined by an automaton.
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• The Generation of GL(n, Z) by Finite State Automata
• Representations of a free group of rank two by time-varying Mealy automata
• ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA