Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages

@article{Brzozowski2012SyntacticCO,
  title={Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages},
  author={Janusz A. Brzozowski and Baiyu Li and Yuli Ye},
  journal={Theor. Comput. Sci.},
  year={2012},
  volume={449},
  pages={37-53}
}
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 study the syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages. We prove that n is a tight upper bound for prefix-free regular languages. We present properties of the… CONTINUE READING

Similar Papers

Loading similar papers…