Cayley automata
From MaRDI portal
Publication:685452
DOI10.1016/0304-3975(93)90231-HzbMATH Open0781.68087OpenAlexW2914958828MaRDI QIDQ685452FDOQ685452
Authors: Max H. Garzon
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(93)90231-h
Recommendations
Formal languages and automata (68Q45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-way stack automata
- The complexity of Grigorchuk groups with application to cryptography
- FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
- Title not available (Why is that?)
- Cyclic automata
- Description of restricted automata by first-order formulae
- Title not available (Why is that?)
Cited In (15)
- CAYLEY AUTOMATON SEMIGROUPS
- Title not available (Why is that?)
- Title not available (Why is that?)
- Group-walking automata
- Cyclic automata
- Fragile words and Cayley type transducers
- Dynamic of cyclic automata over \(\mathbb Z^2\)
- Cayley automatic groups and numerical characteristics of Turing transducers
- Cayley graph automatic groups are not necessarily Cayley graph biautomatic
- Groups, graphs, languages, automata, games and second-order monadic logic
- Independent finite automata on Cayley graphs
- Title not available (Why is that?)
- TWO AUTOMATIC SPANNING TREES IN SMALL CANCELLATION GROUP PRESENTATIONS
- Self-automaton semigroups.
- Array grammars and automata on Cayley grids
This page was built for publication: Cayley automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685452)