Geodesic
Structural unambiguity of formal languages
Czechoslovak Mathematical Journal, Tome 14 (1964) no. 3, pp. 394-430
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1964.100629
Classification : 94.50 
@article{10_21136_CMJ_1964_100629,
     author = {Fabian, V\'aclav},
     title = {Structural unambiguity of formal languages},
     journal = {Czechoslovak Mathematical Journal},
     pages = {394--430},
     year = {1964},
     volume = {14},
     number = {3},
     doi = {10.21136/CMJ.1964.100629},
     mrnumber = {0171639},
     zbl = {0278.68062},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1964.100629/}
}
TY  - JOUR
AU  - Fabian, Václav
TI  - Structural unambiguity of formal languages
JO  - Czechoslovak Mathematical Journal
PY  - 1964
SP  - 394
EP  - 430
VL  - 14
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1964.100629/
DO  - 10.21136/CMJ.1964.100629
LA  - en
ID  - 10_21136_CMJ_1964_100629
ER  - 
%0 Journal Article
%A Fabian, Václav
%T Structural unambiguity of formal languages
%J Czechoslovak Mathematical Journal
%D 1964
%P 394-430
%V 14
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1964.100629/
%R 10.21136/CMJ.1964.100629
%G en
%F 10_21136_CMJ_1964_100629
Fabian, Václav. Structural unambiguity of formal languages. Czechoslovak Mathematical Journal, Tome 14 (1964) no. 3, pp. 394-430. doi: 10.21136/CMJ.1964.100629

[1] J. W. Backus F. L. Bauer J. Green С. Katz J. McCarthy P. Naur (editor) A. J. Perlis H. Rutishauser K. Samelson E. Vauquois J. H. Wegstein A. van Wijngaarden M. Woodger: Report on the Algorithmic Language ALGOL 60. Numerische Mathematik 2 (1960), 106-136. | MR

[2] H. Bottenbruch: Übersetzung von algorithmischen Formelsprachen in die Programmsprachen von Rechenmaschinen. Zeit. für math. Logik und Grundlagen der Mathematik 4 (1958), 180-221. | MR | Zbl

[3] D. G. Cantor: On the Ambiguity Problem of Backus Systems. J. Assoc. Comp. Mach. 9 (1962), 477-479. | DOI | MR | Zbl

[4] Noam Chomsky: On certain Formal Properties of Grammars. Information and Control 2 (1959), 137-167. | DOI | MR

[5] Noam Chomsky: Three Models for the Description of Language. IRE Trans. 1, T-2, No. 3 (1956), 113-124. (Russian translation: Kibernetičeskij sbornik 2 (1961), 237-266, Izd. in. lit., Moskva.)

[6] N. Chomsky, M. P. Schützenberger: The Algebraic Theory of Context-free Languages. Computer Programming and Formal Systems (ed. by P. Braffort and D. Hirschberg), Amsterdam 1963. | MR

[7] Martin Davis: Computability and Unsolvability. New York, McGraw-Hill 1958. | MR

[8] Francois Genuys: Commentaires sur le langage Algol. Chiffres 5 (1962), 29-53.

[9] Sheita A. Greibach: The Undecidability of the Ambiguity Problem for Minimal Linear Grammars. Information and Control 6 (1963), 119-125. | DOI | MR

[10] Peter Zilahy Ingerman: A Syntax-Oriented Compiler for Languages whose Syntax Is Expressible in Backus Normal Form, and Some Proposed Extensions Thereto. University of Pennsylvania, The Moore School of Electrical Engineering, Philadelphia, Pennsylvania, April 1963.

Cité par Sources :