Probabilistic tree automata and context free languages
From MaRDI portal
Publication:2542994
DOI10.1007/BF02798680zbMath0207.02003MaRDI QIDQ2542994
Publication date: 1970
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02798680
68Q45: Formal languages and automata
Related Items
Alternating tree automata, Probabilistic automata, Stochastically costed tree automata: Turakainen's theorem, Theory of formal grammars, Stochastic grammars and languages
Cites Work