State Complexity of Nested Word Automata (Q3618567): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: VPAlib / rank
 
Normal rank
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.1007/978-3-642-00982-2_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1547232601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Marrying Words and Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order and Temporal Logics for Nested Words / rank
 
Normal rank
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: 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: Minimizing Variants of Visibly Pushdown Automata / 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: Transition complexity of language operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3505886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: General varieties of tree languages / 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: Q5422234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Lower Bounds for Nondeterministic State Complexity Is Hard / 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 state complexity of nested word automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465337 / 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: Operational state complexity of nested word automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681320 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:14, 1 July 2024

scientific article
Language Label Description Also known as
English
State Complexity of Nested Word Automata
scientific article

    Statements

    State Complexity of Nested Word Automata (English)
    0 references
    0 references
    2 April 2009
    0 references
    0 references
    0 references