Pages that link to "Item:Q5696970"
From MaRDI portal
The following pages link to IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES (Q5696970):
Displayed 10 items.
- Compacted binary trees admit a stretched exponential (Q2005184) (← links)
- Enumerating regular expressions and their languages (Q2074215) (← links)
- Exact enumeration of acyclic deterministic automata (Q2489949) (← links)
- STATE COMPLEXITY OF TWO COMBINED OPERATIONS: CATENATION-UNION AND CATENATION-INTERSECTION (Q3224949) (← links)
- State Complexity of Boundary of Prefix-Free Regular Languages (Q3455750) (← links)
- ON THE STATE COMPLEXITY OF COMBINED OPERATIONS AND THEIR ESTIMATION (Q3503086) (← links)
- EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA (Q3526533) (← links)
- STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851) (← links)
- State Complexity of <i>k</i>-Union and <i>k</i>-Intersection for Prefix-Free Regular Languages (Q5261608) (← links)
- MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS (Q5704381) (← links)