# Deterministic pushdown automaton

## Papers overview

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

2014

2014

- CAV
- 2014

Nested words model data with both linear and hierarchical structure such as XML documents and program traces. A nested word is aâ€¦Â (More)

Is this relevant?

2007

2007

- MFCS
- 2007

We define the notion of height-deterministic pushdown automata, a model where for any given input string the stack heights duringâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- FSTTCS
- 2003

In this paper we give two equivalent characterizations of the Caucal hierarchy, a hierarchy of infinite graphs with a decidableâ€¦Â (More)

Is this relevant?

Highly Cited

1997

Highly Cited

1997

- 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

1997

Highly Cited

1997

- Handbook of Formal Languages
- 1997

Suppose we want to generate a set of strings (a language) L over an alphabet Î£. How shall we specify our language? One veryâ€¦Â (More)

Is this relevant?

1980

1980

- Information and Control
- 1980

A context-free language is said to be simple if it is accepted by a single-state deterministic pushdown automaton with emptyâ€¦Â (More)

Is this relevant?

1977

1977

- Mathematical systems theory
- 1977

We considered some of the important unsolved problems in the theory of computation concerning the relationship betweenâ€¦Â (More)

Is this relevant?

1977

1977

- Mathematical systems theory
- 1977

The realtime one-state deterministic pushdown automata with jumps define the family of deterministic languages. A simplifiedâ€¦Â (More)

Is this relevant?

1973

1973

- 1973

The existence and complexity of decision procedures for families of deterministic pushdo,,., -n automata are investigated, withâ€¦Â (More)

Is this relevant?

1968

1968

- Information and Control
- 1968

A n algorithm is presented which will determine whether any string w in Z*, of length n, is contained in a language L C Zâ€¦Â (More)

Is this relevant?