Simplification Problems for Deterministic Pushdown Automata on Infinite Words (Q2800412): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1405.5596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decidability result for deterministic \(\omega\)-context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(L(A)=L(B)\)? decidability results from complete formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularity test for pushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity and Related Problems for Deterministic Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown processes: Games and model-checking / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2284766497 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
Simplification Problems for Deterministic Pushdown Automata on Infinite Words
scientific article

    Statements

    Simplification Problems for Deterministic Pushdown Automata on Infinite Words (English)
    0 references
    0 references
    15 April 2016
    0 references
    automata theory
    0 references
    pushdown automata
    0 references
    \(\omega\)-automata
    0 references
    parity index
    0 references

    Identifiers