Regularity and Related Problems for Deterministic Pushdown Automata


It ~S shown that to decide whether the language accepted by an arbitrary deterministic pushdown automaton is LL (k), or whether ~t m accepted by some one-counter or finite-turn pushdown machine, must be at least as difficult as to decide whether it is regular. The regularity problem itself is analyzed in detail, and Stearns' dec~mon procedure for this as… (More)
DOI: 10.1145/321864.321865


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics