Previous |  Up |  Next

Article

Title: Descriptional complexity measures of context-free languages (English)
Author: Černý, Anton
Language: English
Journal: Kybernetika
ISSN: 0023-5954
Volume: 19
Issue: 3
Year: 1983
Pages: 237-247
.
Category: math
.
MSC: 68C25
MSC: 68F05
MSC: 68Q45
idZBL: Zbl 0535.68039
idMR: MR716652
.
Date available: 2009-09-24T17:34:28Z
Last updated: 2012-06-05
Stable URL: http://hdl.handle.net/10338.dmlcz/124915
.
Reference: [1] S. Ginsburg: The Mathematical Theory of Context-Free Languages.McGraw-Hill, New York 1966. Zbl 0184.28401, MR 0211815
Reference: [2] J. Gruska: Some classifications of context-free languages.Information and Control 14 (1969), 2, 152-179. Zbl 0174.28901, MR 0253836
Reference: [3] J. Gruska: Complexity and unambiguity of context-free grammars and languages.Information and Control 18 (1971), 5, 502-519. Zbl 0238.68022, MR 0311152
Reference: [4] J. Gruska: Descriptional complexity of context-free languages.Proceedings MFCS' 73, High Tatras, 71-83. MR 0405938
Reference: [5] A. Salomaa: Formal Languages.Academic Press, New York and London 1973. Zbl 0262.68025, MR 0438755
.

Files

Files Size Format View
Kybernetika_19-1983-3_5.pdf 500.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo