DocumentCode :
2038851
Title :
Piecewise Testable Tree Languages
Author :
Bojanczyk, Mikolaj ; Segoufin, Luc ; Straubing, Howard
Author_Institution :
Warsaw Univ., Warsaw
fYear :
2008
fDate :
24-27 June 2008
Firstpage :
442
Lastpage :
451
Abstract :
This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Sigma1 formulas. This is a tree extension of the Simon theorem, which says that a string language can be defined by a boolean combination of Sigma1 formulas if and only if its syntactic monoid is J-trivial.
Keywords :
Boolean functions; computational linguistics; decidability; formal languages; trees (mathematics); Boolean combination; Simon theorem; decidable characterization; piecewise testable tree languages; syntactic monoid; Algebra; Automata; Automatic testing; Boolean functions; Computer science; Educational institutions; Logic functions; Logic testing; Page description languages; Veins; algebra; logic; tree automata;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Logic in Computer Science, 2008. LICS '08. 23rd Annual IEEE Symposium on
Conference_Location :
Pittsburgh, PA
ISSN :
1043-6871
Print_ISBN :
978-0-7695-3183-0
Type :
conf
DOI :
10.1109/LICS.2008.46
Filename :
4557933
Link To Document :
https://search.ricest.ac.ir/dl/search/defaultta.aspx?DTC=49&DC=2038851
بازگشت