Descriptional Complexity of Unambiguous Nested Word Automata (Q3004601)

From MaRDI portal
Revision as of 19:47, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Descriptional Complexity of Unambiguous Nested Word Automata
scientific article

    Statements

    Descriptional Complexity of Unambiguous Nested Word Automata (English)
    0 references
    0 references
    0 references
    3 June 2011
    0 references
    0 references
    0 references