×

Superdeterministic PDAs: A subcase with a decidable inclusion problem. (English) Zbl 0462.68030


MSC:

68Q05 Models of computation (Turing machines, etc.) (MSC2010)
68Q45 Formal languages and automata
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI