Probabilistic grammars and automata

DOI10.1016/S0019-9958(72)90026-5MaRDI QIDQ5655313zbMATH OpenFDO

Authors Eugene S. Santos

Publication date 1972

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(8)

• A general technique to train language models on language models
• Classes of formal grammars
• Computation of distances for regular and context-free probabilistic languages
• Probabilistic automata
• Introducing divergence for infinite probabilistic models
• Homomorphisms of fuzzy recognizers
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Max-product grammars and languages

This page was built for publication: Probabilistic grammars and automata

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