Complexity of proper prefix-convex regular languages (Q5920052)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6763313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of proper prefix-convex regular languages |
scientific article; zbMATH DE number 6763313 |
Statements
Complexity of proper prefix-convex regular languages (English)
0 references
22 August 2017
0 references
atom
0 references
most complex
0 references
prefix-convex
0 references
proper
0 references
quotient complexity
0 references
regular language
0 references
state complexity
0 references
syntactic semigroup
0 references
0.9962544441223145
0 references
0.9160169363021852
0 references
0.9055322408676147
0 references
0.861430823802948
0 references
0.8543421626091003
0 references
