Implementing Computations in Automaton (Semi)groups (Q2914713): Difference between revisions

From MaRDI portal
Merged Item from Q4649513
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The smallest Mealy automaton of intermediate growth. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups acting on trees: From local to global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automaton semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata and square complexes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: CAYLEY AUTOMATON SEMIGROUPS / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata generating free products of groups of order 2. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity. / 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: The conjugacy problem in automaton groups is not solvable. / rank
 
Normal rank

Latest revision as of 22:38, 5 July 2024

scientific article; zbMATH DE number 6109800
  • ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS
Language Label Description Also known as
English
Implementing Computations in Automaton (Semi)groups
scientific article; zbMATH DE number 6109800
  • ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS

Statements

Implementing Computations in Automaton (Semi)groups (English)
0 references
ON THE FINITENESS PROBLEM FOR AUTOMATON (SEMI)GROUPS (English)
0 references
0 references
0 references
0 references
0 references
0 references
20 September 2012
0 references
22 November 2012
0 references
automaton (semi)groups
0 references
growth
0 references
order
0 references
finiteness
0 references
minimization
0 references
Mealy automata
0 references
automata groups
0 references
automata semigroups
0 references
finiteness problem
0 references
helix graphs
0 references
dual automata
0 references

Identifiers

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