Pages that link to "Item:Q853461"
From MaRDI portal
The following pages link to On the recognizability of fuzzy languages. I (Q853461):
Displayed 13 items.
- Fuzzy languages with infinite range accepted by fuzzy automata: pumping lemma and determinization procedure (Q279371) (← links)
- Brzozowski type determinization for fuzzy automata (Q279377) (← links)
- Determinization of fuzzy automata via factorization of fuzzy states (Q508600) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- On the recognizability of fuzzy languages. II (Q834447) (← links)
- A note on cut-worthiness of recognizable tree series (Q835283) (← links)
- Approximation of fuzzy context-free grammars (Q845326) (← links)
- Myhill-Nerode type theory for fuzzy languages and automata (Q969583) (← links)
- Determinization of weighted finite automata over strong bimonoids (Q991892) (← links)
- Formal power series and regular operations on fuzzy languages (Q2269825) (← links)
- Syntactic recognizability of graphs with fuzzy attributes (Q2445984) (← links)
- Determinization of fuzzy automata with membership values in complete residuated lattices (Q2465969) (← links)
- Similarity-based minimization of fuzzy tree automata (Q2634346) (← links)