Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (Q443735)
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: Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages |
scientific article; zbMATH DE number 6065028
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages |
scientific article; zbMATH DE number 6065028 |
Statements
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages (English)
0 references
13 August 2012
0 references
bifix-free
0 references
factor-free
0 references
finite automaton
0 references
monoid
0 references
prefix-free
0 references
regular language
0 references
reversal
0 references
semigroup
0 references
suffix-free
0 references
syntactic complexity
0 references
0.98769003
0 references
0.9555476
0 references
0.92744774
0 references
0.9274476
0 references
0.92555594
0 references
0.9215543
0 references
0.9215543
0 references
0.90719104
0 references
