The inclusion problem for some subclasses of context-free languages

DOI10.1016/S0304-3975(99)00113-9zbMath0939.68066MaRDI QIDQ1978515

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)

Related Items (4)

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 ⋮ Comparing the notions of opacity for discrete-event systems

Uses Software

• ALGOL 60

Cites Work

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

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