A note on cut-worthiness of recognizable tree series

DOI10.1016/J.FSS.2008.02.009MaRDI QIDQ835283zbMATH OpenOpenAlexFDO

Authors Branimir Šešelja, Andreja Tepavčević, Heiko Vogler

Publication date 28 August 2009

Published in Fuzzy Sets and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.fss.2008.02.009

zbMATH Keywords

semiringscut setsrecognizable tree languagesbottom-up finite state weighted tree automatacut-worthy approachposet (lattice)-valued fuzzy setsrecognizable tree series

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Formal languages and automata (68Q45) Semirings (16Y60)

Recommendations

• Cut sets as recognizable tree languages
• Some remarks on recognizable treeseries
• scientific article; zbMATH DE number 2211801
• A Medvedev characterization of recognizable tree series
• Finitely presentable tree series

Cites work

• scientific article; zbMATH DE number 1183717 (Why is no real title available?)
• scientific article; zbMATH DE number 56812 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (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?)
• A Kleene theorem for weighted tree automata
• Completion of ordered structures by cuts of fuzzy sets: An overview
• Cut sets as recognizable tree languages
• Fuzzy sets
• L-fuzzy sets
• Minimization of lattice finite automata and its application to the decomposition of lattice languages
• On a generalization of fuzzy algebras and congruences
• On the recognizability of fuzzy languages. I
• Partially ordered and relational valued fuzzy relations. I
• Representing ordered structures by fuzzy sets: An overview
• Weighted grammars and Kleene's theorem
• Weighted tree automata and weighted logics

Cited in

(7)

• Weighted finite automata over strong bimonoids
• Myhill-Nerode type theory for fuzzy languages and automata
• On lattice valued up-sets and down-sets
• Finitely presentable tree series
• scientific article; zbMATH DE number 5854945 (Why is no real title available?)
• Structures of compactly generated lattices described by cut sets of \(L\)-valued sets
• Cut sets as recognizable tree languages

This page was built for publication: A note on cut-worthiness of recognizable tree series

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