1981•Journal of Computer and System SciencesOpen access

The complexity of restricted regular expressions and the synthesis problem for finite automata

Ernst L. Leiss

Open full text 15 citations

Abstract

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

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 15 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: Nondeterministic finite automaton, Deterministic finite automaton, Quantum finite automata, Automaton, DFA minimization, Computer science, Finite-state machine, Regular expression

Back to paper search Browse research topics Original source

The complexity of restricted regular expressions and the synthesis problem for finite automata — Research Paper | ScholarLens