2001•Unpublished venueOpen access

State Complexity of Regular Languages

Sheng Yü

Abstract

State complexity is a descriptional complexity measure for regular languages based on the deterministic finite automaton model. We investigate and review the problems related to the state complexity of regular languages, as well as finite languages, and their operations. In particular, we compare various state complexity results for general regular languages to those for finite languages.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 196 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: State (computer science), Computer science, Programming language