Nondeterministic state complexity of nested word automata (Q2271435): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding Nesting Structure to Words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding nesting structure to words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Languages of Nested Words: Fixed Points, Automata, and Synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection and union of regular languages and state complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the transition complexity of NFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound technique for the size of nondeterministic finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Nondeterministic State and Transition Complexity Assuming P ≠ NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337605 / 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: State complexity of some operations on binary regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimization, Learning, and Conformance Testing of Boolean Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptional Complexity of Nondeterministic Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681320 / rank
 
Normal rank

Latest revision as of 21:25, 1 July 2024

scientific article
Language Label Description Also known as
English
Nondeterministic state complexity of nested word automata
scientific article

    Statements

    Nondeterministic state complexity of nested word automata (English)
    0 references
    0 references
    0 references
    7 August 2009
    0 references
    0 references
    state complexity
    0 references
    nondeterminism
    0 references
    finite automata on nested words
    0 references
    language operations
    0 references
    0 references