Cited By
View all- Holzer MKutrib M(2019)Non-Recursive Trade-Offs Are “Almost Everywhere”Computing with Foresight and Industry10.1007/978-3-030-22996-2_3(25-36)Online publication date: 15-Jul-2019
Succinctness of Descriptions of Unambiguous Context-Free Languages
Abstract
There is no recursive function bounding the succinctness gained using ambiguous grammars rather than unambiguous ones in the description of unambiguous context-free languages.
References
[1]
Alfred V. Aho, Jeffrey D. Ullman, The theory of parsing, translation, and compiling. Vol. I: Parsing, Prentice-Hall Inc., Englewood Cliffs, N. J., 1972xviii+541
[2]
J. Hartmanis, Context-free languages and Turing machine computationsProc. Sympos. Appl. Math., Vol. XIX, Amer. Math. Soc., Providence, R.I., 1967, 42–51
[3]
A. R. Meyer, M. J. Fisher, Economy of description by automata, grammars and formal systems, Proc. 12th An. Sympos. on Switching and Automata Theory, IEEE Computer Society, Silver Spring, MD, 1971, 188–191
[4]
William Ogden, A helpful result for proving inherent ambiguity, Math. Systems Theory, 2 (1968), 191–194
[5]
R. E. Stearns, A regularity test for pushdown machines, Information and Control, 11 (1967), 323–340
[6]
Leslie G. Valiant, A note on the succinctness of descriptions of deterministic languages, Information and Control, 32 (1976), 139–145
Index Terms
- Succinctness of Descriptions of Unambiguous Context-Free Languages
Index terms have been assigned to the content through auto-classification.
Recommendations
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications VLimited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11: Proceedings of the 37th international conference on Current trends in theory and practice of computer scienceLinear conjunctive grammars define the same family of languages as one-way real-time cellular automata (Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", RAIRO ITA, 2004), and this family is known to be incomparable to ...
Linear context free languages
ICTAC'07: Proceedings of the 4th international conference on Theoretical aspects of computingIn this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-deterministic linear automata (NLA). At the begining of the work of an NLA, the reading heads ...
Comments
Information & Contributors
Information
Published In
Copyright © 1977 © Society for Industrial and Applied Mathematics.
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 September 1977
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
Cited By
View all- Holzer MKutrib M(2019)Non-Recursive Trade-Offs Are “Almost Everywhere”Computing with Foresight and Industry10.1007/978-3-030-22996-2_3(25-36)Online publication date: 15-Jul-2019
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in