Pages that link to "Item:Q1776375"
From MaRDI portal
The following pages link to A probabilistic model of computing with words (Q1776375):
Displaying 13 items.
- An interval type-2 fuzzy model of computing with words (Q507672) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Approximation of fuzzy context-free grammars (Q845326) (← links)
- Automata theory based on complete residuated lattice-valued logic: Pushdown automata (Q1037929) (← links)
- Grammar theory based on lattice-ordered monoid (Q1037932) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Probabilistic automata for computing with words (Q1936259) (← links)
- A formal model of semantic computing (Q2318288) (← links)
- Computation of moments for probabilistic finite-state automata (Q2660903) (← links)
- Conversion of fuzzy automata into fuzzy regular expressions using transitive closure (Q2987857) (← links)
- On Turing's formula for word probabilities (Q3763460) (← links)
- Switching and Learning in Feedback Systems (Q5710860) (← links)
- Probabilistic model for the growth of thesauri (Q5950004) (← links)