The Generation of GL(n, Z) by Finite State Automata
From MaRDI portal
Publication:4354232
DOI10.1142/S0218196798000077zbMath0923.20023OpenAlexW1963724858MaRDI QIDQ4354232
No author found.
Publication date: 15 September 1997
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196798000077
general linear groupsfree groupsfinite state automatagroups of automorphisms of one-rooted regular trees
Formal languages and automata (68Q45) Generators, relations, and presentations of groups (20F05) Unimodular groups, congruence subgroups (group-theoretic aspects) (20H05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items
STABILIZERS OF TRANSITIVE ACTIONS ON LOCALLY FINITE GRAPHS, Unnamed Item, Virtual endomorphisms of nilpotent groups., Finite automata and numbers, On a free group of transformations defined by an automaton., Amalgamated free product in terms of automata constructions, Finite-state self-similar actions of nilpotent groups., Orbit automata as a new tool to attack the order problem in automaton groups, Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness, The conjugacy problem in automaton groups is not solvable., On a finite state representation of GL(n,Z), Scale-invariant groups., The concept of duality for automata over a changing alphabet and generation of a free group by such automata, Automata generating free products of groups of order 2., AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK, Rational embeddings of hyperbolic groups, Extensions of automorphisms of self-similar groups, Free subgroups in groups acting on rooted trees, The congruence subgroup problem for branch groups., REPRESENTATIONS OF FREE PRODUCTS BY INFINITE UNITRIANGULAR MATRICES OVER FINITE FIELDS, On a series of finite automata defining free transformation groups., Automata and square complexes., Finite automata of polynomial growth do not generate a free group., FREE SUBGROUPS OF THE GROUP OF INFINITE UNITRIANGULAR MATRICES, THE BINARY ADDING MACHINE AND SOLVABLE GROUPS, Faithful Group Actions on Rooted Trees Induced by Actions of Quotients, On the asynchronous rational group, A just-nonsolvable torsion-free group defined on the binary tree, Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity., On self-similarity of \(p\)-adic analytic pro-\(p\) groups of small dimension, Wreath operations in the group of automorphisms of the binary tree
Cites Work
