Pages that link to "Item:Q1099644"
From MaRDI portal
The following pages link to Finite automata and unary languages (Q1099644):
Displaying 50 items.
- The monadic quantifier alternation hierarchy over grids and graphs (Q2506497) (← links)
- A special case of a unary regular language containment (Q2509040) (← links)
- Towards more efficient methods for solving regular-expression heavy string constraints (Q2680985) (← links)
- Distributed graph problems through an automata-theoretic lens (Q2689441) (← links)
- From finite automata to regular expressions and back -- a summary on descriptional complexity (Q2800411) (← links)
- Reversible Ordered Restarting Automata (Q2822491) (← links)
- Contextual Array Grammars with Matrix and Regular Control (Q2829974) (← links)
- Operations on Weakly Recognizing Morphisms (Q2829976) (← links)
- Descriptional Complexity of Bounded Regular Languages (Q2829978) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- In memoriam Chandra Kintala (Q2909177) (← links)
- On the Determinization Blowup for Finite Automata Recognizing Equal-Length Languages (Q2944880) (← links)
- Complexity of Promise Problems on Classical and Quantum Automata (Q2944886) (← links)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics (Q2946734) (← links)
- From Two-Way to One-Way Finite Automata—Three Regular Expression-Based Methods (Q2947420) (← links)
- Translation from classical two-way automata to pebble two-way automata (Q2998731) (← links)
- UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (Q3021944) (← links)
- Ambiguity of Unary Symmetric Difference NFAs (Q3105754) (← links)
- Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata (Q3149086) (← links)
- Descriptional Complexity of Input-Driven Pushdown Automata (Q3166952) (← links)
- Investigations on Automata and Languages over a Unary Alphabet (Q3192250) (← links)
- Unary Languages Recognized by Two-Way One-Counter Automata (Q3192259) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES (Q3395134) (← links)
- Deterministic blow-ups of minimal NFA's (Q3421910) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q3451094) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- The Frobenius Problem and Its Generalizations (Q3533000) (← links)
- DETERMINISTIC BLOW-UPS OF MINIMAL NONDETERMINISTIC FINITE AUTOMATA OVER A FIXED ALPHABET (Q3538853) (← links)
- Finite Automata, Palindromes, Powers, and Patterns (Q3540097) (← links)
- Hyper-minimizing minimized deterministic finite state automata (Q3549289) (← links)
- Efficient Construction of Semilinear Representations of Languages Accepted by Unary NFA (Q3584969) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Deterministic Pushdown Automata and Unary Languages (Q3602818) (← links)
- Descriptional and Computational Complexity of Finite Automata (Q3618565) (← links)
- Converting Self-verifying Automata into Deterministic Automata (Q3618603) (← links)
- Size Complexity of Two-Way Finite Automata (Q3637213) (← links)
- Magic Numbers and Ternary Alphabet (Q3637234) (← links)
- (Q4418597) (← links)
- (Q4503152) (← links)
- On the Size of Two-Way Reasonable Automata for the Liveness Problem (Q4640037) (← links)
- Normal forms for unary probabilistic automata (Q4649454) (← links)
- Two-way automata and length-preserving homomorphisms (Q4879206) (← links)
- (Q4989409) (← links)
- Resynchronizing Classes of Word Relations (Q5002809) (← links)
- A Superpolynomial Lower Bound for the Size of Non-Deterministic Complement of an Unambiguous Automaton (Q5002825) (← links)
- The State Complexity of Lexicographically Smallest Words and Computing Successors (Q5041251) (← links)
- (Q5094125) (← links)
- On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651) (← links)
- Non-Self-Embedding Grammars and Descriptional Complexity (Q5164870) (← links)
