Pages that link to "Item:Q1099644"
From MaRDI portal
The following pages link to Finite automata and unary languages (Q1099644):
Displaying 28 items.
- NONDETERMINISTIC STATE COMPLEXITY OF PROPORTIONAL REMOVALS (Q5173288) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
- LIMITED AUTOMATA AND REGULAR LANGUAGES (Q5173292) (← links)
- Chrobak Normal Form Revisited, with Applications (Q5200060) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- Geometrical Regular Languages and Linear Diophantine Equations (Q5200085) (← links)
- Remarks on Separating Words (Q5200088) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- Branching Measures and Nearly Acyclic NFAs (Q5205046) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)
- Nondeterministic Tree Width of Regular Languages (Q5500678) (← links)
- Complement on Free and Ideal Languages (Q5500692) (← links)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
- NON-UNIQUENESS AND RADIUS OF CYCLIC UNARY NFAs (Q5704371) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Forgetting Automata and Unary Languages (Q5757251) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Limited automata and unary languages (Q5920129) (← links)
- Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures (Q5958302) (← links)
- Iterated uniform finite-state transducers on unary languages (Q6165558) (← links)
- Recognizing Lexicographically Smallest Words and Computing Successors in Regular Languages (Q6169895) (← links)
- The nondeterministic state complexity of the site-directed deletion language operation (Q6175008) (← links)
- Solving String Theories Involving Regular Membership Predicates Using SAT (Q6487302) (← links)
- On universality of regular realizability problems (Q6660012) (← links)