The inclusion problem for some subclasses of context-free languages

DOI10.1016/S0304-3975(99)00113-9MaRDI QIDQ1978515zbMATHFDO

Authors P. R. J. P. R. J. Asveld, Anton Nijholt

Publication date 4 June 2000

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

inclusion problemunambiguous context-free language(restricted) context-free grammar(restricted) deterministic push-down automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The Inclusion Problem of Context-Free Languages: Some Tractable Cases
• The inclusion problem of context-free languages: some tractable cases
• Inclusion is undecidable for pattern languages
• Developments in Language Theory
• scientific article; zbMATH DE number 871439

Cites work

• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 3504474 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• scientific article; zbMATH DE number 194974 (Why is no real title available?)
• scientific article; zbMATH DE number 3302285 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Deterministic context free languages
• NTS languages are deterministic and congruential
• On equivalence of grammars through transformation trees
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Superdeterministic DPDAs: The method of accepting does affect decision problems
• Superdeterministic PDAs
• The equivalence and inclusion problems for NTS languages
• The inclusion problem for simple languages
• Two Families of Languages Related to ALGOL

Cited in

(11)

• The inclusion problem of context-free languages: some tractable cases
• Generating all permutations by context-free grammars in Chomsky normal form
• Comparing the notions of opacity for discrete-event systems
• Relaxed parsing of regular approximations of string-embedded languages
• Generating all permutations by context-free grammars in Greibach normal form
• Developments in Language Theory
• The Inclusion Problem of Context-Free Languages: Some Tractable Cases
• Inclusion between the frontier language of a non-deterministic recursive program scheme and the Dyck language is undecidable
• An intersection type system for deterministic pushdown automata
• The magic number problem for subregular language families
• An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs

Describes a project that uses

Uses Software

• ALGOL 60

This page was built for publication: The inclusion problem for some subclasses of context-free languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978515)