Syntactic Complexities of Nine Subclasses of Regular Languages
The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular languages is the maximal syntactic complexity of languages in that class, taken as a function of the state complexity n of these languages. We...
Main Author: | |
---|---|
Language: | en |
Published: |
2012
|
Subjects: | |
Online Access: | http://hdl.handle.net/10012/6838 |