Probabilistic tree automata and context free languages

DOI10.1007/BF02798680zbMath0207.02003OpenAlexW2071902050MaRDI QIDQ2542994

Gadi Moran, Menachem Magidor

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Alternating tree automata ⋮ Stochastically costed tree automata: Turakainen's theorem ⋮ Probabilistic automata ⋮ Stochastic grammars and languages ⋮ Theory of formal grammars

Cites Work

• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Probabilistic automata
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Probabilistic tree automata and context free languages