The figure at right illustrates a finite-state machine, which belongs to a well-known type of automaton. This automaton consists of statesâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2002

Highly Cited

2002

- Frank Neven
- SIGMOD Record
- 2002

" . . . . . . . ~":""":::: :: ~ ~'::":'::'~:'$" ~ ~ '": â€¢ â€¢ ::::: i:: ::::.: :i:: ::: :~:::: ~iâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman
- SIGACT News
- 2001

In the preface from the 1979 predecessor to thOR book, Hopcroft and U11man marveled at the fact that the subject of automata hadâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- Ahmed Bouajjani, Javier Esparza, Oded Maler
- CONCUR
- 1997

We apply the symbolic analysis principle to pushdown systems We represent possibly in nite sets of con gurations of such systemsâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Thomas A. Henzinger
- LICS
- 1996

A hybrid automaton is a formal model for a mixed discrete-continuous system. We classify hybrid automata acoording to whatâ€¦Â (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Moshe Y. Vardi
- Banff Higher Order Workshop
- 1995

The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for programâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- Rajeev Alur, David L. Dill
- Theor. Comput. Sci.
- 1994

Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&eâ€¦Â (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- Shmuel Safra
- FOCS
- 1988

Automata on infinite words were introduced by Biichi in order to give a decision procedure for SlS, the monadic second-orderâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- Moshe Y. Vardi, Pierre Wolper
- J. Comput. Syst. Sci.
- 1986

We present a new technique for obtaining decision procedures for modal logics of programs. The technique centers around a newâ€¦Â (More)

Is this relevant?

Highly Cited

1979

Highly Cited

1979

Where you can find the introduction to automata theory languages and computation easily? Is it in the book store? On-line bookâ€¦Â (More)

Is this relevant?

Highly Cited

1968

Highly Cited

1968

- James W. Thatcher, Jesse B. Wright
- Mathematical systems theory
- 1968

Many of the important concepts and results of conventional finite automata theory are developed for a generalization in whichâ€¦Â (More)

Is this relevant?