Pages that link to "Item:Q2731279"
From MaRDI portal
The following pages link to State complexity of regular languages (Q2731279):
Displaying 22 items.
- (Q4036600) (← links)
- The genus of regular languages (Q4599611) (← links)
- (Q5020533) (← links)
- A Study of a Simple Class of Modifiers: Product Modifiers (Q5041253) (← links)
- Cellular Automata: Descriptional Complexity and Decidability (Q5112166) (← links)
- (Q5130744) (← links)
- Nondeterministic State Complexity of Star-Free Languages (Q5200063) (← links)
- Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages (Q5200084) (← links)
- State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal (Q5200089) (← links)
- Sensing as a Complexity Measure (Q5205034) (← links)
- Operational Accepting State Complexity: The Unary and Finite Case (Q5205038) (← links)
- (Q5313785) (← links)
- (Q5313800) (← links)
- Implementation and Application of Automata (Q5463977) (← links)
- Upper Bound on Syntactic Complexity of Suffix-Free Languages (Q5500677) (← links)
- On Simulation Cost of Unary Limited Automata (Q5500689) (← links)
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995) (← links)
- Finite automata with undirected state graphs (Q5918649) (← links)
- Complexity of proper prefix-convex regular languages (Q5919576) (← links)
- Complexity of proper prefix-convex regular languages (Q5920052) (← links)
- State complexity of finite partial languages (Q6100188) (← links)
- Descriptional complexity of finite automata -- selected highlights (Q6614536) (← links)