On the inherent ambiguity of simple tuple languages-Reference-Cited by-同舟云学术

On the inherent ambiguity of simple tuple languages

Published:1971-09 Issue:3-4 Volume:7 Page:194-203
ISSN:0010-485X
Container-title:Computing
language:en
Short-container-title:Computing

Author:

Kuich W.,Maurer H.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/BF02242346.pdf

Reference5 articles.

1. Kuich, W.: On the entropy of context-free languages. Information and Control16, 173–200 (1970).

2. Kuich, W., andH. Maurer: On the structure generating function and entropy of tuple languages. Proceedings of the ACM International Computing Symposium, Bonn. 870–879 (1970). To appear in: Information and Control.

3. Maurer, H.: Theoretische Grundlagen der Programmiersprachen — Syntax. Mannheim: Bibliographisches Institut. 1969.

4. Maurer, H.: A direct proof of the inherent ambiguity of a simple context-free language. JACM16, 256–260 (1969).

5. Maurer, H., andW. Kuich: Tuple languages. Proceedings of the ACM International Computing Symposium, Bonn, 882–891 (1970).

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simple Matrix Grammars and Their Leftmost Variants;INT J FOUND COMPUT S;2016

2. Simple Matrix Grammars and Their Leftmost Variants;International Journal of Foundations of Computer Science;2016-02

3. Ambiguity of the Multiple Interpretations on Regular Languages;Fundamenta Informaticae;2015

4. Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata;Handbook of Formal Languages;1997

5. Rediscovering pushdown machines;Lecture Notes in Computer Science;1994