On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata (Q3503642): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On the Tape Complexity of Deterministic Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some subclasses of context-free languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic \(NC^1\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetizing Classes Around NC 1 and L / rank
 
Normal rank
Property / cites work
 
Property / cites work: Height-Deterministic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronization of Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5493740 / rank
 
Normal rank

Latest revision as of 10:24, 28 June 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
scientific article

    Statements

    Identifiers