Time- and tape-bounded Turing acceptors and AFLs (Q2542726): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studies in abstract families of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to a Unified Theory of Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Results on Tape-Bounded Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Definable 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: Q5636862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generator of context-sensitive languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5328169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Theory of Enumerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape-bounded Turing acceptors and principal AFLs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variations on pushdown machines (Detailed Abstract) / rank
 
Normal rank

Revision as of 02:28, 12 June 2024

scientific article
Language Label Description Also known as
English
Time- and tape-bounded Turing acceptors and AFLs
scientific article

    Statements

    Identifiers