Cancellation in context-free languages: enrichment by reduction
type: Item
instance of: scholarly article
title: Cancellation in context-free languages: enrichment by reduction
zbMATH Open document ID: 0805.68076
DOI: 10.1016/0304-3975(94)90104-X
published in: Theoretical Computer Science
publication date: 1995-01-26T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 567720
zbMATH Keywords: decidability
zbMATH Keywords: context-free languages
zbMATH Keywords: context-free grammar
zbMATH Keywords: symmetric Dyck set
zbMATH Keywords: cancellation
zbMATH Keywords: recursively enumerable set
zbMATH Keywords: Petri net languages
author: Matthias Jantzen
author: Holger Petersen
MaRDI profile type: Publication
cites work: Q5616207
cites work: Monadic Thue systems
cites work: Efficient reductions of picture words
cites work: Q4040325
cites work: Finiteness Conditions on Subgroups and Formal Language Theory
cites work: Q3751035
cites work: Normal forms for phrase-structure grammars
cites work: Full AFLs and nested iterated substitution
cites work: Some remarks on derivations in general rewriting systems
cites work: Q3766866
cites work: Q4430312
cites work: Q3766878
cites work: Q3471701
cites work: A Supernormal-Form Theorem for Context-Free Grammars
cites work: Using string languages to describe picture languages
cites work: Q3911403
cites work: How to Make Arbitrary Grammars Look Like Context-Free Grammars
cites work: Some characterizations of lindenmayer systems in terms of chomsky-type grammars and stack machines
cites work: Q4725769
cites work: Q5672208
description: scientific article; zbMATH DE number 567720