|
Volumn 159, Issue 22, 2008, Pages 3087-3090
|
A note on cut-worthiness of recognizable tree series
|
Author keywords
Bottom up finite state weighted tree automata; Cut sets; Cut worthy approach; Poset (lattice) valued fuzzy sets; Recognizable tree languages; Recognizable tree series; Semirings
|
Indexed keywords
CIVIL AVIATION;
FUZZY SETS;
LINGUISTICS;
QUERY LANGUAGES;
SET THEORY;
BOTTOM-UP FINITE STATE WEIGHTED TREE AUTOMATA;
CUT SETS;
CUT-WORTHY APPROACH;
POSET (LATTICE)-VALUED FUZZY SETS;
RECOGNIZABLE TREE LANGUAGES;
RECOGNIZABLE TREE SERIES;
SEMIRINGS;
COMPUTER PROGRAMMING LANGUAGES;
|
EID: 51449083589
PISSN: 01650114
EISSN: None
Source Type: Journal
DOI: 10.1016/j.fss.2008.02.009 Document Type: Article |
Times cited : (6)
|
References (20)
|