Stochastic grammars and languages
From MaRDI portal
Publication:4045668
Cites work
- scientific article; zbMATH DE number 3254905 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- scientific article; zbMATH DE number 3313290 (Why is no real title available?)
- scientific article; zbMATH DE number 3190745 (Why is no real title available?)
- A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A context-free language which is not acceptable by a probabilistic automaton
- Deterministic context free languages
- Finite state languages
- Fuzzy events realized by finite probabilistic automata
- Fuzzy sets
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Indexed Grammars—An Extension of Context-Free Grammars
- Maximin automata
- Nested Stack Automata
- On certain formal properties of grammars
- On context-free languages and push-down automata
- On m-adic probabilistic automata
- On stochastic context-free languages
- On stochastic languages
- Phrase structure languages, finite machines, and channel capacity
- Probabilistic and weighted grammars
- Probabilistic automata
- Probabilistic tree automata and context free languages
- Programmed Grammars and Classes of Formal Languages
- Some aspects of probabilistic automata
- Some closure properties of the family of stochastic languages
- Some considerations on Fuzzy automata
- The theory of languages
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)
