Recommendations
- On Weakly Ambiguous Finite Transducers
- Finite transducers and rational transductions
- On fragments of words over a \(q\)-ary alphabet
- scientific article; zbMATH DE number 1670852
- Determinization of transducers over finite and infinite words.
- Christoffel words and weak Markoff theory
- Application of finite transducers to the specification of mappings and fractal sets
- Cayley automata
- FINITELY SUBSEQUENTIAL TRANSDUCERS
Cites work
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- Automata over a binary alphabet generating free groups of even rank.
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
- Free subgroups in groups acting on rooted trees
- Freeness of automaton groups vs boundary dynamics
- Groups and semigroups defined by colorings of synchronizing automata.
- scientific article; zbMATH DE number 1984019 (Why is no real title available?)
- scientific article; zbMATH DE number 1544074 (Why is no real title available?)
- scientific article; zbMATH DE number 2195483 (Why is no real title available?)
- On a free group of transformations defined by an automaton.
- On the complexity of the word problem for automaton semigroups and automaton groups
- Schreier graphs of the Basilica group.
- Self-similar groups acting essentially freely on the boundary of the binary rooted tree
- Totally nonfree actions and the infinite symmetric group
This page was built for publication: Fragile words and Cayley type transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124053)
