Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.2022.10.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4307896660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tractability frontier for NFA minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Visibly Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite-valuedness problem for sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems on finite automata and the exponential time hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring nondeterminism in pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edit-Distance Between Visibly Pushdown Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambiguity, Nondeterminism and State Complexity of Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic state complexity of nested word automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown automata with bounded nondeterminism and bounded ambiguity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity method for measuring nondeterminism in finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of NFAs and growth rates of nondeterminism measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3890112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3817637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Input-Driven Pushdown Automata with Limited Nondeterminism / rank
 
Normal rank
Property / cites work
 
Property / cites work: State complexity of operations on input-driven pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: State Complexity of Finite Tree Width NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pumping and pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measures of nondeterminism for pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Second Course in Formal Languages and Automata Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of ambiguity of finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692941 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Deciding path size of nondeterministic (and input-driven) pushdown automata
scientific article

    Statements

    Deciding path size of nondeterministic (and input-driven) pushdown automata (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2022
    0 references
    measures of nondeterminism
    0 references
    path size
    0 references
    ambiguity
    0 references
    input-driven pushdown automaton
    0 references
    decidability
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers