2004•Theoretical Computer ScienceOpen access

State complexity of some operations on binary regular languages

Galina Jirásková

Open full text 130 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 130 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: Concatenation (mathematics), Nondeterministic finite automaton, Finite-state machine, Regular language, Deterministic finite automaton, Nondeterministic algorithm, Binary number, Automaton

Back to paper search Browse research topics Original source

State complexity of some operations on binary regular languages — Research Paper | ScholarLens