Stochastic grammars and languages

DOI10.1007/BF00995736zbMath0293.68060MaRDI QIDQ4045668

No author found.

Publication date: 1972

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Sequential classification of strings generated by SCFG's ⋮ B-fuzzy grammars ⋮ An application of stochastic languages to fingerprint pattern recognition ⋮ Fuzzy automata and languages ⋮ Properties of stochastic syntax-directed translation schemata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some considerations on Fuzzy automata
• Probabilistic tree automata and context free languages
• On stochastic context-free languages
• Finite state languages
• On certain formal properties of grammars
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• Fuzzy sets
• Deterministic context free languages
• Some aspects of probabilistic automata
• On m-adic probabilistic automata
• Fuzzy events realized by finite probabilistic automata
• The theory of languages
• Maximin automata
• Indexed Grammars—An Extension of Context-Free Grammars
• Probabilistic automata
• Programmed Grammars and Classes of Formal Languages
• Nested Stack Automata
• Probabilistic and weighted grammars
• A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
• Generalized finite automata theory with an application to a decision problem of second-order logic
• On stochastic languages
• A context-free language which is not acceptable by a probabilistic automaton
• Some closure properties of the family of stochastic languages
• Phrase structure languages, finite machines, and channel capacity
• On context-free languages and push-down automata

This page was built for publication: Stochastic grammars and languages