State Complexity of Regular Languages: Finite versus Infinite

Cezar Câmpeanu, Kai Salomaa, Sheng Yu. State Complexity of Regular Languages: Finite versus Infinite. In Cristian Calude, Gheorghe Paun, editors, Finite Versus Infinite. Discrete mathematics and theoretical computer science, pages 53-73, Springer, 2000. [doi]

Abstract

Abstract is missing.