Cut sets as recognizable tree languages

DOI10.1016/J.FSS.2005.11.004MaRDI QIDQ2493984zbMATH OpenOpenAlexFDO

Authors Björn Borchardt, Andreas Maletti, Branimir Šešelja, Andreja Tepavčević, Heiko Vogler

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A note on cut-worthiness of recognizable tree series
• Fuzzy tree language recognizability
• Some remarks on recognizable treeseries
• scientific article; zbMATH DE number 2040322
• Fuzzy tree automata

Cites work

• scientific article; zbMATH DE number 58315 (Why is no real title available?)
• scientific article; zbMATH DE number 3598539 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 3623470 (Why is no real title available?)
• scientific article; zbMATH DE number 1257742 (Why is no real title available?)
• scientific article; zbMATH DE number 2040322 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 1358710 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 3271554 (Why is no real title available?)
• scientific article; zbMATH DE number 2211801 (Why is no real title available?)
• A Kleene theorem for weighted tree automata
• Algebraic aspects of families of fuzzy languages
• Completion of ordered structures by cuts of fuzzy sets: An overview
• Determinism and fuzzy automata
• Deterministic Acceptors of Regular Fuzzy Languages
• Finite tree automata with cost functions
• Kleene type results for weighted tree automata
• L-fuzzy sets
• Linear Automaton Transformations
• Maximin automata
• On a generalization of fuzzy algebras and congruences
• On the Determinization of Weighted Finite Automata
• Positive tree representations and applications to tree automata
• Recognizable formal power series on trees
• Representing ordered structures by fuzzy sets: An overview
• Représentations matricielles des séries d'arbre reconnaissables

Cited in

(8)

• Weighted tree automata and weighted logics
• Weighted finite automata over strong bimonoids
• 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
• Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids
• Structures of compactly generated lattices described by cut sets of \(L\)-valued sets
• A note on cut-worthiness of recognizable tree series

This page was built for publication: Cut sets as recognizable tree languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493984)