Most complex deterministic union-free regular languages (Q777986)
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 7216359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Most complex deterministic union-free regular languages |
scientific article; zbMATH DE number 7216359 |
Statements
Most complex deterministic union-free regular languages (English)
0 references
30 June 2020
0 references
Boolean operation
0 references
different alphabets
0 references
one-cycle-free-path automaton
0 references
regular language
0 references
reversal
0 references
state complexity
0 references
syntactic semigroup
0 references
transition semigroup
0 references
union-free language
0 references
0.901906967163086
0 references
0.90120530128479
0 references
0.8743332624435425
0 references
0.8461593389511108
0 references
0.8278787732124329
0 references
