Open AccessState Complexity of Regular Languages
Author(s) -
Sheng Yu
Publication year - 2001
Publication title -
j. autom. lang. comb.
Language(s) - English
DOI - 10.25596/jalc-2001-221
State complexity is a descriptive complexity measure for regular languages. We investigate the problems related to the state complexity of regular languages and their operations. In particular, we compare the state complexity results on regular languages with those on nite languages.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom