Pages that link to "Item:Q3034835"
From MaRDI portal
The following pages link to Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation (Q3034835):
Displayed 36 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)
- Some results on the structure of unary unambiguous automata (Q544137) (← links)
- Two-way unary automata versus logarithmic space (Q549665) (← links)
- An approximation algorithm for state minimization in 2-MDFAs (Q855011) (← links)
- State complexity of unique rational operations (Q1019724) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- Transforming a single-valued transducer into a Mealy machine (Q1267709) (← links)
- The state complexities of some basic operations on regular languages (Q1318694) (← links)
- Communication complexity method for measuring nondeterminism in finite automata (Q1854501) (← links)
- Descriptional complexity of regular languages (Q2074214) (← 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)
- On the transformation of two-way deterministic finite automata to unambiguous finite automata (Q2232267) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- Ambiguity and structural ambiguity of symmetric difference NFAs (Q2453538) (← 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)
- GENERAL ALGORITHMS FOR TESTING THE AMBIGUITY OF FINITE AUTOMATA AND THE DOUBLE-TAPE AMBIGUITY OF FINITE-STATE TRANSDUCERS (Q3016223) (← links)
- Ambiguity of Unary Symmetric Difference NFAs (Q3105754) (← links)
- Concise representations of regular languages by degree and probabilistic finite automata (Q3142004) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Operations on Unambiguous Finite Automata (Q4683235) (← links)
- Characterizing regular languages with polynomial densities (Q5096862) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- Worst Case Branching and Other Measures of Nondeterminism (Q5268392) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Polynomially ambiguous unary weighted automata over fields (Q6038711) (← links)
- Markov chains and unambiguous automata (Q6098148) (← 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)
- Existential and universal width of alternating finite automata (Q6175087) (← links)