The inclusion problem for some subclasses of context-free languages
type: Item
instance of: scholarly article
title: The inclusion problem for some subclasses of context-free languages
zbMATH Open document ID: 0939.68066
DOI: 10.1016/S0304-3975(99)00113-9
author: P. R. J. P. R. J. Asveld
author: Anton Nijholt
published in: Theoretical Computer Science
publication date: 2000-06-04T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1454292
zbMATH Keywords: inclusion problem
zbMATH Keywords: unambiguous context-free language
zbMATH Keywords: (restricted) context-free grammar
zbMATH Keywords: (restricted) deterministic push-down automaton
describes a project that uses: ALGOL 60
MaRDI profile type: Publication
cites work: Q3292904
cites work: NTS languages are deterministic and congruential
cites work: The inclusion problem for simple languages
cites work: Superdeterministic DPDAs: The method of accepting does affect decision problems
cites work: Deterministic context free languages
cites work: Two Families of Languages Related to ALGOL
cites work: Superdeterministic PDAs
cites work: Q4198075
cites work: On equivalence of grammars through transformation trees
cites work: Q5583856
cites work: Q5592246
cites work: On the equivalence, containment, and covering problems for the regular and context-free languages
cites work: Q5678435
cites work: Q4085271
cites work: The equivalence and inclusion problems for NTS languages
cites work: On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
cites work: Q4692941
description: scientific article; zbMATH DE number 1454292