Cyclic automata

DOI10.1016/0304-3975(87)90071-5zbMath0641.68116OpenAlexW2913506727MaRDI QIDQ1100919

Max H. Garzon

Publication date: 1987

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(87)90071-5

zbMATH Keywords

Cayley graphlogspacecyclic automatagraph languagesCayley automatapebble automataordinary Turing machinestrict hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Cayley automata

Cites Work

• Techniques for separating space complexity classes
• Relating refined space complexity classes
• Transformational methods and their application to complexity problems. Corrigenda
• On non-determinacy in simple computing devices
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cyclic automata