Cayley automata
From MaRDI portal
Publication:685452
DOI10.1016/0304-3975(93)90231-HzbMath0781.68087OpenAlexW2914958828MaRDI QIDQ685452
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
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cyclic automata
- The complexity of Grigorchuk groups with application to cryptography
- Description of restricted automata by first-order formulae
- One-way stack automata
- FINITELY PRESENTED GROUP WHOSE WORD PROBLEM HAS THE SAME DEGREE AS THAT OF AN ARBITRARILY GIVEN THUE SYSTEM (AN APPLICATION OF METHODS OF BRITTON)
This page was built for publication: Cayley automata
