Testing for grammatical coverings
type: Item
instance of: scholarly article
title: Testing for grammatical coverings
zbMATH Open document ID: 0599.68056
DOI: 10.1016/0304-3975(85)90226-9
published in: Theoretical Computer Science
publication date: 1985-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3967931
zbMATH Keywords: context-free grammars
zbMATH Keywords: grammatical similarity relations
zbMATH Keywords: Reynolds covering
zbMATH Keywords: onto grammar homomorphism
zbMATH Keywords: grammar isomorphism
zbMATH Keywords: interpretation of grammar forms
zbMATH Keywords: NP-complete
zbMATH Keywords: unambiguous context-free grammars
zbMATH Keywords: polynomial time algorithms
zbMATH Keywords: graph isomorphism
author: Daniel J. Rosenkrantz
author: H. B. III Hunt
MaRDI profile type: Publication
full work available at URL: 0304-3975(85)90226-9
OpenAlex ID: W1995092809
cites work: An Observation on Relative Parsing Time
cites work: Q4047460
cites work: Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
cites work: Context-free grammar forms
cites work: The structure of context-free grammatical families
cites work: Q4198056
cites work: Bracketed context-free languages
cites work: On strict interpretations of grammar forms
cites work: On the Covering and Reduction Problems for Context-Free Grammars
cites work: Q3868788
cites work: On the equivalence, containment, and covering problems for the regular and context-free languages
cites work: Q3915993
cites work: Context-free grammars: covers, normal forms, and parsing
cites work: Transformational classes of grammars
cites work: Grammar and L forms: an introduction
description: scientific article; zbMATH DE number 3967931