A note on real-time one-way alternating multicounter machines
From MaRDI portal
Publication:809610
DOI10.1016/0304-3975(91)90378-FzbMATH Open0733.68050OpenAlexW2047810991MaRDI QIDQ809610FDOQ809610
Authors: Katsushi Inoue, Akira Ito, Itsuo Takanami
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90378-f
Recommendations
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cites Work
- Alternation
- On alternation
- Remarks on the complexity of nondeterministic counter languages
- Counter machines and counter languages
- Multi-stack-counter languages
- Tree-size bounded alternation
- Erasable context-free languages
- Alternating simple multihead finite automata
- Alternating multicounter machines with constant number of reversals
- On the power of alternation in automata theory
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: A note on real-time one-way alternating multicounter machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809610)