Pages that link to "Item:Q2820787"
From MaRDI portal
The following pages link to On Nonpermutational Transformation Semigroups with an Application to Syntactic Complexity (Q2820787):
Displaying 4 items.
- Syntactic complexity of bifix-free regular languages (Q2319913) (← links)
- Syntactic complexity of bifix-free languages (Q2399256) (← links)
- Improved lower bounds for the complexity of finite semigroups (Q2559565) (← links)
- Checking Whether an Automaton Is Monotonic Is NP-complete (Q2947429) (← links)
