Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem

Authors:
S. A. Greibach;E. P. Friedman
Affiliations:
Department of Computer Science, University of California, Los Angeles, California;Department of Computer Science, University of California, Los Angeles, California
Venue:
Journal of the ACM (JACM)
Year:
1980

An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs

Language and Automata Theory and Applications
String analysis as an abstract interpretation

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Polynomial-time identification of an extension of very simple grammars from positive data

ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
XML validation for context-free grammars

APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
An intersection type system for deterministic pushdown automata

TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Some decision problems concerning NPDAs, palindromes, and dyck languages

CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata

Hi-index	0.01