Stochastic grammars and languages
From MaRDI portal
Publication:4045668
DOI10.1007/BF00995736zbMATH Open0293.68060MaRDI QIDQ4045668FDOQ4045668
Authors:
Publication date: 1972
Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)
Cites Work
- Fuzzy sets
- Probabilistic automata
- Deterministic context free languages
- Title not available (Why is that?)
- Finite state languages
- Maximin automata
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- Title not available (Why is that?)
- On certain formal properties of grammars
- Indexed Grammars—An Extension of Context-Free Grammars
- Nested Stack Automata
- The theory of languages
- Title not available (Why is that?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- On context-free languages and push-down automata
- Title not available (Why is that?)
- A context-free language which is not acceptable by a probabilistic automaton
- Probabilistic and weighted grammars
- Programmed Grammars and Classes of Formal Languages
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Some considerations on Fuzzy automata
- Some closure properties of the family of stochastic languages
- Phrase structure languages, finite machines, and channel capacity
- Some aspects of probabilistic automata
- On stochastic languages
- On stochastic context-free languages
- Probabilistic tree automata and context free languages
- On m-adic probabilistic automata
- Fuzzy events realized by finite probabilistic automata
Cited In (5)
This page was built for publication: Stochastic grammars and languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4045668)
