1986•Theoretical Computer ScienceOpen access
From regular expressions to deterministic automata
Gérard Berry, Ravi Sethi
Open full text 264 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Gérard Berry, Ravi Sethi
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 264 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Nondeterministic finite automaton, Regular expression, Complement (music), Expression (computer science), Deterministic finite automaton, Mathematics, Concatenation (mathematics), Intersection (aeronautics)