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 6 items.
- Defining relations for non-permutational finite transformations (Q1279670) (← links)
- 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)
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS (Q3552217) (← links)