Cut sets as recognizable tree languages
From MaRDI portal
Publication:2493984
DOI10.1016/j.fss.2005.11.004zbMath1092.68052OpenAlexW2087660521MaRDI QIDQ2493984
Andreas Maletti, Heiko Vogler, Branimir Šešelja, Andreja Tepavčević, Björn Borchardt
Publication date: 16 June 2006
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2005.11.004
Related Items
A note on cut-worthiness of recognizable tree series ⋮ Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids ⋮ Weighted finite automata over strong bimonoids ⋮ Weighted tree automata and weighted logics ⋮ On the uniqueness of \(L\)-fuzzy sets in the representation of families of sets ⋮ Myhill-Nerode type theory for fuzzy languages and automata ⋮ On lattice valued up-sets and down-sets ⋮ Structures of compactly generated lattices described by cut sets of \(L\)-valued sets
Cites Work
- Recognizable formal power series on trees
- Finite tree automata with cost functions
- Positive tree representations and applications to tree automata
- A Kleene theorem for weighted tree automata
- Determinism and fuzzy automata
- Algebraic aspects of families of fuzzy languages
- Completion of ordered structures by cuts of fuzzy sets: An overview
- Representing ordered structures by fuzzy sets: An overview
- On a generalization of fuzzy algebras and congruences
- L-fuzzy sets
- Représentations matricielles des séries d'arbre reconnaissables
- Linear Automaton Transformations
- Deterministic Acceptors of Regular Fuzzy Languages
- On the Determinization of Weighted Finite Automata
- Maximin automata
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
