Pages that link to "Item:Q1151754"
From MaRDI portal
The following pages link to Succinct representation of regular languages by Boolean automata (Q1151754):
Displaying 16 items.
- Note on Reversal of Binary Regular Languages (Q5200093) (← links)
- Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals (Q5200096) (← links)
- Square on Deterministic, Alternating, and Boolean Finite Automata (Q5205045) (← links)
- The complexity of concatenation on deterministic and alternating finite automata (Q5223613) (← links)
- State-complexity of finite-state devices, state compressibility and incompressibility (Q5289271) (← links)
- STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION (Q5462121) (← links)
- Unambiguity in Automata Theory (Q5500675) (← links)
- NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955) (← links)
- DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377) (← links)
- The Ranges of Accepting State Complexities of Languages Resulting from Some Operations (Q5859667) (← links)
- Operations on Boolean and Alternating Finite Automata (Q6204121) (← links)
- Simplifying Alternating Automata for Emptiness Testing (Q6488157) (← links)
- An automata-theoretic approach to linear temporal logic (Q6560392) (← links)
- Performing regular operations with 1-limited automata (Q6580078) (← links)
- Minimisation in logical form (Q6612779) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)