Pages that link to "Item:Q703576"
From MaRDI portal
The following pages link to On deterministic finite automata and syntactic monoid size (Q703576):
Displaying 22 items.
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735) (← links)
- On the size of inverse semigroups given by generators (Q627176) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- Syntactic complexity of suffix-free languages (Q1706151) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Green's relations in deterministic finite automata (Q2311884) (← links)
- Syntactic complexity of bifix-free regular languages (Q2319913) (← links)
- Generalized Post embedding problems (Q2354596) (← links)
- State complexity of permutation on finite languages over a binary alphabet (Q2358683) (← links)
- Syntactic complexity of bifix-free languages (Q2399256) (← links)
- Green's relations in finite transformation semigroups (Q2399369) (← links)
- Complexity of suffix-free regular languages (Q2402364) (← links)
- Operations on Weakly Recognizing Morphisms (Q2829976) (← links)
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata (Q3194726) (← links)
- SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES (Q5173287) (← links)
- Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages (Q5200084) (← links)
- Most Complex Non-Returning Regular Languages (Q5205037) (← links)
- The complexity of weakly recognizing morphisms (Q5223827) (← 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)
- State complexity of deletion and bipolar deletion (Q5963404) (← links)
