1994•Theoretical Computer ScienceOpen access

The state complexities of some basic operations on regular languages

Sheng Yü, Qingyu Zhuang, Kai Salomaa

Open full text 352 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

Open-access reader

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 352 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.

Key concepts: Catenation, Deterministic finite automaton, Regular language, State (computer science), Nondeterministic finite automaton, Finite-state machine, Alphabet, DFA minimization

Back to paper search Browse research topics Original source

The state complexities of some basic operations on regular languages — Research Paper | ScholarLens