Pages that link to "Item:Q2493984"
From MaRDI portal
The following pages link to Cut sets as recognizable tree languages (Q2493984):
Displaying 8 items.
- A note on cut-worthiness of recognizable tree series (Q835283) (← links)
- Weighted finite automata over strong bimonoids (Q845343) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- Myhill-Nerode type theory for fuzzy languages and automata (Q969583) (← links)
- On lattice valued up-sets and down-sets (Q983040) (← links)
- On the uniqueness of \(L\)-fuzzy sets in the representation of families of sets (Q1697980) (← links)
- Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids (Q2136289) (← links)
- Structures of compactly generated lattices described by cut sets of \(L\)-valued sets (Q2318242) (← links)
