On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (Q2446063): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3806830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\omega\)-computations on Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Wadge Hierarchy of Petri Nets ω-Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(X\)-automata on \(\omega\)-words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4783319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel ranks and Wadge degrees of context free $\omega$-languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological Complexity of Context-Free ω-Languages: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on blind and partially blind one-way multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on concurrency and Petri nets. Advances in Petri nets. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fine hierarchies and m-reducibilities in theoretical computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wadge reducibility and infinite computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite behaviour of Petri nets / rank
 
Normal rank

Revision as of 09:36, 8 July 2024

scientific article
Language Label Description Also known as
English
On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets
scientific article

    Statements

    On the topological complexity of \(\omega\)-languages of non-deterministic Petri nets (English)
    0 references
    0 references
    0 references
    15 April 2014
    0 references
    formal languages
    0 references
    languages of infinite words
    0 references
    Petri nets
    0 references
    Büchi acceptance condition
    0 references
    Cantor space
    0 references
    topological complexity
    0 references
    Borel hierarchy
    0 references
    complete sets
    0 references

    Identifiers