Finite Automata and Their Decision Problems

E755394

"Finite Automata and Their Decision Problems" is a landmark 1959 paper by Dana Scott and Michael Rabin that founded the modern theory of finite automata and formalized key decision problems in automata theory and computation.

Try in SPARQL Jump to: Statements Referenced by

Statements (30)

Predicate Object
instanceOf landmark paper in computer science
scientific paper
author Dana Scott NERFINISHED
Michael Rabin NERFINISHED
coAuthorWith Dana Scott NERFINISHED
Michael Rabin NERFINISHED
contribution formalized key decision problems for finite automata
founded the modern theory of finite automata
introduced systematic study of automata-theoretic decision procedures
era early theoretical computer science
field automata theory
computability theory
theoretical computer science
impact influenced the development of formal language theory
influenced the theory of computation
provided foundations for later work on automata and logic
language English
publicationYear 1959
recognizedAs classic paper in automata theory
seminal work in decision problems for automata
title Finite Automata and Their Decision Problems NERFINISHED
topic decision problems
deterministic finite automata
emptiness problem
equivalence of automata
finite automata
membership problem
minimization of finite automata
nondeterministic finite automata
regular languages

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Dana Scott notableWork Finite Automata and Their Decision Problems
Michael Rabin notableWork Finite Automata and Their Decision Problems
subject surface form: Michael O. Rabin