The inclusion problem for some subclasses of context-free languages

DOI10.1016/S0304-3975(99)00113-9zbMATH Open0939.68066MaRDI QIDQ1978515FDOQ1978515

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)

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic context free languages
• On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
• Title not available (Why is that?)
• Two Families of Languages Related to ALGOL
• Title not available (Why is that?)
• The inclusion problem for simple languages
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the equivalence, containment, and covering problems for the regular and context-free languages
• NTS languages are deterministic and congruential
• Superdeterministic DPDAs: The method of accepting does affect decision problems
• Superdeterministic PDAs
• On equivalence of grammars through transformation trees
• The equivalence and inclusion problems for NTS languages

Cited In (9)

• Developments in Language Theory
• Comparing the notions of opacity for discrete-event systems
• An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
• Generating all permutations by context-free grammars in Chomsky normal form
• Generating all permutations by context-free grammars in Greibach normal form
• Relaxed Parsing of Regular Approximations of String-Embedded Languages
• The inclusion problem of context-free languages: some tractable cases
• The Inclusion Problem of Context-Free Languages: Some Tractable Cases
• The magic number problem for subregular language families

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)