Nondeterministic tree width of regular languages

DOI10.1007/978-3-319-19225-3_4MaRDI QIDQ5500678zbMATH OpenOpenAlexFDO

Authors Kai Salomaa, C. Câmpeanu

Publication date 7 August 2015

Published in Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-19225-3_4

zbMATH Keywords

regular languagesnondeterministic finite automatameasures of nondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Nondeterminism growth and state complexity
• State complexity of finite tree width NFAs
• State complexity and limited nondeterminism
• Comparisons between measures of nondeterminism on finite automata
• Worst Case Branching and Other Measures of Nondeterminism

Cites work

• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• A Second Course in Formal Languages and Automata Theory
• Communication complexity method for measuring nondeterminism in finite automata
• DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY
• Finding Lower Bounds for Nondeterministic State Complexity Is Hard
• Finite automata and unary languages
• Intersection and union of regular languages and state complexity
• Minimal NFA Problems are Hard
• Minimizing finite automata is computationally hard
• NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
• Non-deterministic finite cover automata
• On measuring nondeterminism in regular languages
• One-unambiguous regular languages
• Rational sets in commutative monoids
• Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
• Simplifying nondeterministic finite cover automata
• State complexity and limited nondeterminism
• State complexity of finite tree width NFAs
• THE STRUCTURE AND COMPLEXITY OF MINIMAL NFA’S OVER A UNARY ALPHABET
• The tractability frontier for NFA minimization
• Unary NFAs with limited nondeterminism

Cited in

(13)

• Regular Approximation of Weighted Linear Context-Free Tree Languages
• Branching measures and nearly acyclic NFAs
• Regular languages of thin trees
• Maximal existential and universal width
• Branching measures and nearly acyclic NFAs
• State complexity and limited nondeterminism
• On deterministic finite automata equipped with partial orders
• Comparisons between measures of nondeterminism on finite automata
• Width of non-deterministic automata
• Computing the width of non-deterministic automata
• THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES
• State complexity of finite tree width NFAs
• Computation width and deviation number

This page was built for publication: Nondeterministic tree width of regular languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500678)