On tape-bounded complexity classes and multihead finite automata (Q1215271): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-tape and multi-head pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On non-determinacy in simple computing devices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two-way multihead automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Head Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on multihead automata and context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way multihead writing finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-reversal multihead finite automata languages / rank
 
Normal rank

Latest revision as of 16:18, 12 June 2024

scientific article
Language Label Description Also known as
English
On tape-bounded complexity classes and multihead finite automata
scientific article

    Statements