One way finite visit automata (Q1242687): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q758320
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Sheila A. Greibach / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phrase structure languages, finite machines, and channel capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain formal properties of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way sequential transductions and stack automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Relations Defined by Generalized Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reduction of tape reversals for off-line one-tape Turing machines / 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 AFL generators for finitely encoded AFA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principal AFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: AFL with the semilinear property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation-bounded languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chains of full AFL's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on context-free grammar forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Infinite Hierarchy of Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntactic operators on full semiAFLs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tape-reversal bounded Turing machine computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Automaton Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolutely parallel grammars and two-way finite-state transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-crossing transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4122826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-turn checking automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equal matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Left-derivation bounded languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Representations of Certain Classes of Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly erasable AFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Controlled pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Control sets on linear grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric hierarchy of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the membership problem for some extensions of context-free languagest† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way A-transducers and AFL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stack Machines and Classes of Nonnested Macro Languages / rank
 
Normal rank

Latest revision as of 22:34, 12 June 2024

scientific article
Language Label Description Also known as
English
One way finite visit automata
scientific article

    Statements

    One way finite visit automata (English)
    0 references
    1978
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references