Complexity of left-ideal, suffix-closed and suffix-free regular languages (Q5738995)
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 6725135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of left-ideal, suffix-closed and suffix-free regular languages |
scientific article; zbMATH DE number 6725135 |
Statements
Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages (English)
0 references
1 June 2017
0 references
different alphabets
0 references
left ideal
0 references
most complex
0 references
quotient/state complexity
0 references
regular language
0 references
suffix-closed
0 references
suffix-convex
0 references
suffix-free
0 references
syntactic semigroup
0 references
transition semigroup
0 references
unrestricted complexity
0 references
0.9041756987571716
0 references
0.8951749205589294
0 references
0.8543421626091003
0 references
0.8540584444999695
0 references
0.8420738577842712
0 references
