Ambiguity and decision problems for local adjunct languages

Authors:
Johnson Murdoch Hart
Affiliations:
-
Venue:
Journal of Computer and System Sciences
Year:
1974

Citing 5
Cited 0

On The Ambiguity Problem of Backus Systems

Journal of the ACM (JACM)
Ambiguity in context free languages

Journal of the ACM (JACM)
The Unsolvability of the Recognition of Linear Context-Free Languages

Journal of the ACM (JACM)
The Mathematical Theory of Context-Free Languages

The Mathematical Theory of Context-Free Languages
Finite automata and their decision problems

IBM Journal of Research and Development

Quantified Score

Hi-index	0.00

Visualization

Abstract

Some of the formal properties of the local adjunct languages of Joshi, Kosaraju, and Yamada are developed. This class of languages is a proper subclass of the context-free languages and is related to the star languages. The first result is that a bounded context-free language is a local adjunct language iff it is regular. Next, many questions regarding local adjunct grammars and languages are shown to be unsolvable. In particular, it is not solvable if the local adjunct language generated by an arbitrary (local adjunct) grammar is regular. Finally, an inherently ambiguous local adjunct language (with respect to the class of local adjunct grammars) is demonstrated.