Pages that link to "Item:Q3021944"
From MaRDI portal
The following pages link to UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION (Q3021944):
Displaying 20 items.
- QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279) (← links)
- Operations on Permutation Automata (Q5041254) (← links)
- SIMULATIONS OF UNARY ONE-WAY MULTI-HEAD FINITE AUTOMATA (Q5173291) (← links)
- Decidability and Shortest Strings in Formal Languages (Q5200081) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- State Complexity of Operations on Two-Way Deterministic Finite Automata over a Unary Alphabet (Q5200094) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- Square on Deterministic, Alternating, and Boolean Finite Automata (Q5205045) (← links)
- On the Adjacency-Jacobsthal numbers (Q5231241) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- Operational State Complexity of Subtree-Free Regular Tree Languages (Q5298309) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
- Investigations on Automata and Languages Over a Unary Alphabet (Q5744124) (← links)
- Regular Expressions with Counting: Weak versus Strong Determinism (Q5895105) (← links)
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages (Q6070751) (← links)
- The Range of State Complexities of Languages Resulting from the Cascade Product — The Unary Case (Q6070753) (← links)
- Usefulness of information and decomposability of unary regular languages (Q6186306) (← links)
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages (Q6647746) (← links)
