Stochastically costed tree automata: Turakainen's theorem
From MaRDI portal
Publication:1351787
DOI10.1016/0304-3975(95)00009-7zbMath0871.68128MaRDI QIDQ1351787
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00009-7
68Q45: Formal languages and automata
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recognizable formal power series on trees
- Stochastically costed tree automata: Turakainen's theorem
- Probabilistic tree automata and context free languages
- Word-functions of stochastic and pseudo stochastic automata
- Generalized Automata and Stochastic Languages
- Propriétés booléennes des langages stochastiques