Most complex non-returning regular languages (Q2400992)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Most complex non-returning regular languages |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Most complex non-returning regular languages |
scientific article |
Statements
Most complex non-returning regular languages (English)
0 references
31 August 2017
0 references
atom
0 references
Boolean operation
0 references
concatenation
0 references
different alphabets
0 references
non-returning
0 references
reversal
0 references
star
0 references
state complexity
0 references
syntactic semigroup
0 references
transition semigroup
0 references
unrestricted complexity
0 references
0.9939779043197632
0 references
0.9186707735061646
0 references
0.899689793586731
0 references
0.8181478977203369
0 references
0.801495373249054
0 references
