loading...
Piecewise Testable Tree Languages
June 24-June 27
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/LICS.2008.462008 23rd Annual IEEE Symposium on Lo ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing, "Piecewise Testable Tree Languages," Logic in Computer Science, Symposium on, pp. 442-451, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2008.46,
author = {Mikolaj Bojanczyk and Luc Segoufin and Howard Straubing},
title = {Piecewise Testable Tree Languages},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2008},
issn = {1043-6871},
pages = {442-451},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2008.46},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - Piecewise Testable Tree Languages
SN - 1043-6871
SP442
EP451
A1 - Mikolaj Bojanczyk,
A1 - Luc Segoufin,
A1 - Howard Straubing,
PY - 2008
KW - logic
KW - algebra
KW - tree automata
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
This paper presents a decidable characterization of tree languages??that can be defined by a boolean combination of $\Sigma_1$??formulas. This is a tree extension of the Simon theorem, which says??that a string language can be defined by a boolean combination of??$\Sigma_1$ formulas if and only if its syntactic monoid is??$J$-trivial.
Index Terms:
logic, algebra, tree automata
Citation:
Mikolaj Bojanczyk, Luc Segoufin, Howard Straubing, "Piecewise Testable Tree Languages," lics, pp.442-451, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, 2008
Usage of this product signifies your acceptance of the Terms of Use.