In search of most complex regular languages (Q5401550)
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 6266660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | In search of most complex regular languages |
scientific article; zbMATH DE number 6266660 |
Statements
IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES (English)
0 references
10 March 2014
0 references
atom
0 references
complexity of operation
0 references
finite automaton
0 references
quotient complexity
0 references
regular language
0 references
state complexity
0 references
syntactic semigroup
0 references
witness
0 references
0.9015204906463624
0 references
0.8719947934150696
0 references
0.8685875535011292
0 references
0.8627892136573792
0 references
0.8365582823753357
0 references
