scientific article
From MaRDI portal
Publication:4016418
zbMath0749.68030MaRDI QIDQ4016418
Publication date: 14 December 1992
Full work available at URL: https://eudml.org/doc/31849
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Alternating simple multihead finite automata
- Fooling a two-way nondeterministic multihead automaton with reversal number restriction
- On the power of alternation in automata theory
- Tradeoffs for language recognition on alternating machines
- One way multihead deterministic finite automata
- A time-space tradeoff for language recognition
- Alternation
- k + 1 Heads Are Better than k
- Bounded-reversal multihead finite automata languages
This page was built for publication:
