Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:describes |
characterization of star-free regular languages
|
| gptkbp:field |
automata theory
formal language theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Schützenberger theorem
|
| gptkbp:namedAfter |
gptkb:Marcel-Paul_Schützenberger
|
| gptkbp:relatedTo |
regular language
syntactic monoid aperiodic monoid first-order logic over words star-free language |
| gptkbp:state |
A regular language is star-free if and only if its syntactic monoid is aperiodic
|
| gptkbp:yearProposed |
1965
|
| gptkbp:bfsParent |
gptkb:Marcel-Paul_Schützenberger
|
| gptkbp:bfsLayer |
7
|