Upper bound on syntactic complexity of suffix-free languages (Q5500677)
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 6471665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bound on syntactic complexity of suffix-free languages |
scientific article; zbMATH DE number 6471665 |
Statements
Upper Bound on Syntactic Complexity of Suffix-Free Languages (English)
0 references
7 August 2015
0 references
regular language
0 references
suffix-free
0 references
syntactic complexity
0 references
transition semigroup
0 references
upper bound
0 references
0.976325750350952
0 references
0.8817400336265564
0 references
0.8816378116607666
0 references
0.8800415992736816
0 references
0.8794724941253662
0 references
