AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK (Q2996850): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Cyclic renormalization and automorphism groups of rooted trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of GL(n, Z) by Finite State Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and square complexes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lamplighter group as a group generated by a 2-state automaton, and its spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Ihara zeta function of infinite graphs, the KNS spectral measure and integrable maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spectra of lamplighter groups and Cayley machines. / rank
 
Normal rank
Property / cites work
 
Property / cites work: MONOIDS ACTING ON TREES: ELLIPTIC AND WREATH PRODUCTS AND THE HOLONOMY THEOREM FOR ARBITRARY MONOIDS WITH APPLICATIONS TO INFINITE GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a free group of transformations defined by an automaton. / rank
 
Normal rank

Latest revision as of 00:00, 4 July 2024

scientific article
Language Label Description Also known as
English
AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references