Previous |  Up |  Next

Article

Title: Structural unambiguity of formal languages (English)
Author: Fabian, Václav
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 14
Issue: 3
Year: 1964
Pages: 394-430
Summary lang: Russian
.
Category: math
.
MSC: 94.50
idZBL: Zbl 0278.68062
idMR: MR0171639
.
Date available: 2008-06-09T13:22:30Z
Last updated: 2016-04-06
Stable URL: http://hdl.handle.net/10338.dmlcz/100629
.
Reference: [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 0130074
Reference: [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. Zbl 0089.33201, MR 0103154
Reference: [3] D. G. Cantor: On the Ambiguity Problem of Backus Systems.J. Assoc. Comp. Mach. 9 (1962), 477-479. Zbl 0114.33003, MR 0150037, 10.1145/321138.321145
Reference: [4] Noam Chomsky: On certain Formal Properties of Grammars.Information and Control 2 (1959), 137-167. MR 0105365, 10.1016/S0019-9958(59)90362-6
Reference: [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.)
Reference: [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 0152391
Reference: [7] Martin Davis: Computability and Unsolvability.New York, McGraw-Hill 1958. MR 0124208
Reference: [8] Francois Genuys: Commentaires sur le langage Algol.Chiffres 5 (1962), 29-53.
Reference: [9] Sheita A. Greibach: The Undecidability of the Ambiguity Problem for Minimal Linear Grammars.Information and Control 6 (1963), 119-125. MR 0160675, 10.1016/S0019-9958(63)90149-9
Reference: [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.
.

Files

Files Size Format View
CzechMathJ_14-1964-3_5.pdf 4.566Mb application/pdf View/Open
Back to standard record
Partner of
EuDML logo