A characterization of exponential-time languages by alternating context- free grammars (Q1193905): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of alternation in automata theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Alternating One-Reversal Counters and Stacks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Pushdown and Stack Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation bounded auxiliary pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A grammatical characterization of alternating pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generative power of transformational grammars / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 14:26, 16 May 2024

scientific article
Language Label Description Also known as
English
A characterization of exponential-time languages by alternating context- free grammars
scientific article

    Statements

    A characterization of exponential-time languages by alternating context- free grammars (English)
    0 references
    0 references
    0 references
    0 references
    27 September 1992
    0 references
    0 references
    exponential-time languages
    0 references
    alternating pushdown automata
    0 references
    linear-erasing alternating context-free grammars
    0 references