The Boolean closure of linear context-free languages (Q929298): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: UNSOLVABILITY LEVELS OF OPERATION PROBLEMS FOR SUBCLASSES OF CONTEXT-FREE LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: On time computability of functions in one-way cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way bounded cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic context free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient recognizer for the Boolean closure of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and computational complexity of systolic trellis automata / 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: On strongly context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: An infinite hierarchy of intersections of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4412133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / 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: On real time one-way cellular array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree-languages: A new concept of acceptance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism and Boolean operations in pda's / rank
 
Normal rank

Latest revision as of 12:00, 28 June 2024

scientific article
Language Label Description Also known as
English
The Boolean closure of linear context-free languages
scientific article

    Statements

    The Boolean closure of linear context-free languages (English)
    0 references
    0 references
    0 references
    0 references
    17 June 2008
    0 references
    0 references
    Boolean operations
    0 references
    non-unary languages
    0 references
    0 references