Quasi-rocking real-time pushdown automata (Q650904): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2011.08.029 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059417750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-realtime languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of double Greibach normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free graph languages of bounded degree are generated by apex graph grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Apex graph grammars and attribute grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary graph grammars with dynamic edge relabeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of eNCE families of graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient recognition algorithms for boundary and linear eNCE graph languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double Greibach operator grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node replacement graph languages squeezed with chains, trees, and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary NLC graph grammars—Basic definitions, normal forms, and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turn-bounded grammars and their relation to ultralinear languages / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2011.08.029 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:48, 9 December 2024

scientific article
Language Label Description Also known as
English
Quasi-rocking real-time pushdown automata
scientific article

    Statements

    Quasi-rocking real-time pushdown automata (English)
    0 references
    0 references
    7 December 2011
    0 references
    pushdown automata
    0 references
    quasi-rocking
    0 references
    real-time
    0 references
    normal forms
    0 references
    grammatical characterizations
    0 references
    language hierarchy
    0 references
    decision properties
    0 references

    Identifiers