Probabilistic and weighted grammars

DOI10.1016/S0019-9958(69)90554-3zbMath0188.03201MaRDI QIDQ5581627

Arto Salomaa

Publication date: 1969

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

languages, automata, networks

Related Items (24)

Consistency of stochastic context-free grammars ⋮ Multityped abstract categorial grammars and their composition ⋮ Universality of SN P systems with stochastic application of rules ⋮ Probabilistic automata ⋮ Probabilistic Parallel Communicating Grammar Systems ⋮ Stochastic grammars and languages ⋮ PROBABILISTIC REWRITING P SYSTEMS ⋮ Automata theory based on quantum logic: reversibilities and pushdown automata ⋮ B-fuzzy grammars ⋮ Evolutionary induction of stochastic context free grammars ⋮ L-fuzzy grammars ⋮ Various kinds of automata with weights ⋮ Weighted path queries on semistructured databases ⋮ A probabilistic model of computing with words ⋮ Max-product grammars and languages ⋮ Fuzzy automata and languages ⋮ On stochastic context-free languages ⋮ General formulation of formal grammars ⋮ A homomorphism theorem for weighted context-free grammars ⋮ N-fold fuzzy grammars ⋮ Examples of formal grammars with weights ⋮ Theory of formal grammars ⋮ Sequential grammars and automata with valences ⋮ Survey: finite-state technology in natural language processing

This page was built for publication: Probabilistic and weighted grammars