Probabilistic tree automata and context free languages

DOI10.1007/BF02798680MaRDI QIDQ2542994zbMATH OpenOpenAlexFDO

Authors Menachem Magidor, Gadi Moran

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)

Cites work

• scientific article; zbMATH DE number 3174044 (Why is no real title available?)
• scientific article; zbMATH DE number 7354705 (Why is no real title available?)
• scientific article; zbMATH DE number 3301432 (Why is no real title available?)
• 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

Cited in

(5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2542994)