Analytic models and ambiguity of context-free languages
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 49 (2-3) , 283-309
- https://doi.org/10.1016/0304-3975(87)90011-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Uniform Random Generation of Strings in a Context-Free LanguageSIAM Journal on Computing, 1983
- On the number of words in the languageDiscrete Mathematics, 1982
- The average height of binary trees and other simple treesJournal of Computer and System Sciences, 1982
- String overlaps, pattern matching, and nontransitive gamesJournal of Combinatorial Theory, Series A, 1981
- The characterization of nonexpansive grammars by rational power seriesInformation and Control, 1981
- Differentiably Finite Power SeriesEuropean Journal of Combinatorics, 1980
- On the Altitude of Nodes in Random TreesCanadian Journal of Mathematics, 1978
- The Average Time for Carry PropagationIndagationes Mathematicae, 1978
- The structure generating function of some families of languagesInformation and Control, 1976
- Some inherently ambiguous context-free languagesInformation and Control, 1971