Pages that link to "Item:Q5463982"
From MaRDI portal
The following pages link to Implementation and Application of Automata (Q5463982):
Displaying 12 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- On deterministic finite automata and syntactic monoid size (Q703576) (← links)
- State transitions as morphisms for complete lattices (Q1586453) (← links)
- Syntactic complexity of suffix-free languages (Q1706151) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- Complexity Analysis: Transformation Monoids of Finite Automata (Q3451097) (← links)
- (Q5020521) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123) (← links)
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (Q5738995) (← links)
- Complexity of proper prefix-convex regular languages (Q5919576) (← links)
- Complexity of proper prefix-convex regular languages (Q5920052) (← links)