Pages that link to "Item:Q2461796"
From MaRDI portal
The following pages link to Magic numbers in the state hierarchy of finite automata (Q2461796):
Displayed 14 items.
- Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata (Q388216) (← links)
- On a structural property in the state complexity of projected regular languages (Q443744) (← links)
- Concatenation of regular languages and descriptional complexity (Q639851) (← links)
- Pairs of complementary unary languages with ``balanced'' nondeterministic automata (Q2429361) (← links)
- THE MAGIC NUMBER PROBLEM FOR SUBREGULAR LANGUAGE FAMILIES (Q2909186) (← links)
- MAGIC NUMBERS AND TERNARY ALPHABET (Q3086242) (← links)
- Concatenation of Regular Languages and Descriptional Complexity (Q3392955) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- THE RANGES OF STATE COMPLEXITIES FOR COMPLEMENT, STAR, AND REVERSAL OF REGULAR LANGUAGES (Q5168427) (← links)
- Chrobak Normal Form Revisited, with Applications (Q5200060) (← links)
- Remarks on Separating Words (Q5200088) (← links)
- State Complexity of Projected Languages (Q5200092) (← links)
- DETERMINISM VS. NONDETERMINISM FOR TWO-WAY AUTOMATA: Representing the Meaning of States by Logical Formulæ (Q5495414) (← links)