Pages that link to "Item:Q954457"
From MaRDI portal
The following pages link to Approximation and universality of fuzzy Turing machines (Q954457):
Displaying 9 items.
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Approximation of fuzzy context-free grammars (Q845326) (← links)
- The equivalence between fuzzy Mealy and fuzzy Moore machines (Q862553) (← links)
- Lattice-valued fuzzy Turing machines: computing power, universality and efficiency (Q1043325) (← links)
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines (Q1434368) (← links)
- Fuzzy Turing machines: normal form and limitative theorems (Q1697984) (← links)
- Weak Second‐Order Arithmetic and Finite Automata (Q3287248) (← links)
- Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages (Q5275234) (← links)