Most complex non-returning regular languages (Q5205037)
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; zbMATH DE number 7141918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Most complex non-returning regular languages |
scientific article; zbMATH DE number 7141918 |
Statements
Most Complex Non-Returning Regular Languages (English)
0 references
10 December 2019
0 references
atom
0 references
Boolean operation
0 references
concatenation
0 references
different alphabets
0 references
most complex
0 references
reversal
0 references
regular language
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.9179254770278932
0 references
0.898425817489624
0 references
0.8103546500205994
0 references
0.8005963563919067
0 references
