Pattern Ambiguities for Pure Context—Free Grammars

Authors:
Erkki Mäkinen;Ferucio Laurenţiu Ţiplea
Affiliations:
Department of Computer Science, University of Tampere, Tampere, Finland. em@cs.uta.fi;Faculty of Informatics, “Al. I. Cuza” University of Iaşi, Iaşi, Romania. fltiplea@infoiasi.ro
Venue:
Fundamenta Informaticae
Year:
1997

Citing 5
Cited 0

Formal languages

Formal languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Introduction to Formal Language Theory

Introduction to Formal Language Theory
The Finest Homophonic Partition and Related Code Concepts

MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
(0,1)-TOTALITY IS UNDECIDABLE FOR ARBITRARY CONTEXT-FREE GRAMMARS

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider here some special forms of ambiguity for pure context-free grammars, namely pattern avoiding ambiguity, pattern preserving ambiguity, pattern ambiguity, and grammar avoiding ambiguity. The first two properties are undecidable for arbitrary pure context-free grammars, and in a particular but general enough case we can effectively decide whether or not a pure context-free grammar is pattern preserving ambiguous.