Pages that link to "Item:Q1854501"
From MaRDI portal
The following pages link to Communication complexity method for measuring nondeterminism in finite automata (Q1854501):
Displaying 39 items.
- Unambiguous finite automata over a unary alphabet (Q418147) (← links)
- Descriptional complexity of unambiguous input-driven pushdown automata (Q484313) (← links)
- Ambiguity and communication (Q537915) (← links)
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
- Context-dependent nondeterminism for pushdown automata (Q880177) (← links)
- Operational state complexity of unary NFAs with finite nondeterminism (Q896686) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- State complexity of some operations on binary regular languages (Q1763716) (← links)
- Two-dimensional models (Q2074211) (← links)
- Width measures of alternating finite automata (Q2096586) (← links)
- Deciding path size of nondeterministic (and input-driven) pushdown automata (Q2098178) (← links)
- Structural properties of NFAs and growth rates of nondeterminism measures (Q2113384) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- Nondeterministic state complexity of nested word automata (Q2271435) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Communication complexity tools on recognizable picture languages (Q2330109) (← links)
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs (Q2361671) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- Operations on Unambiguous Finite Automata (Q2817392) (← links)
- In memoriam Chandra Kintala (Q2909177) (← links)
- Classes of two-dimensional languages and recognizability conditions (Q2998728) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata (Q3526417) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377) (← links)
- Left is Better Than Right for Reducing Nondeterminism of NFAs (Q6114834) (← links)
- Converting finite width AFAs to nondeterministic and universal finite automata (Q6131195) (← links)
- On Usefulness of Information: Framework and NFA Case (Q6163619) (← links)
- Probabilism versus Alternation for Automata (Q6163621) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)