Finite turns and the regular closure of linear context-free languages (Q2384399): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2007.05.021 / 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.dam.2007.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037800309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4317585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Closure of Deterministic Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivation-bounded languages / 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: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel parsing on a one-way linear array of finite-state machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Space Complexity Of Turn Bounded Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628109 / 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.DAM.2007.05.021 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:42, 18 December 2024

scientific article
Language Label Description Also known as
English
Finite turns and the regular closure of linear context-free languages
scientific article

    Statements

    Finite turns and the regular closure of linear context-free languages (English)
    0 references
    0 references
    0 references
    21 September 2007
    0 references
    finite turn pushdown automata
    0 references
    computational capacity
    0 references
    time-efficient recognizers
    0 references
    closures of languages
    0 references
    context-free languages
    0 references

    Identifiers