On groups generated by bi-reversible automata: the two-state case over a changing alphabet (Q2396829)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On groups generated by bi-reversible automata: the two-state case over a changing alphabet |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On groups generated by bi-reversible automata: the two-state case over a changing alphabet |
scientific article |
Statements
On groups generated by bi-reversible automata: the two-state case over a changing alphabet (English)
0 references
26 May 2017
0 references
changing alphabet
0 references
transducer
0 references
mealy automaton
0 references
automaton over a changing alphabet
0 references
group generated by automaton
0 references
automorphism group
0 references
free group
0 references
0 references
0 references
0 references
0 references
0.8602243065834045
0 references
0.7809523344039917
0 references
0.7756745219230652
0 references
0.774869978427887
0 references
0.7698549628257751
0 references
