Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
20
click to vote
ICALP
2009
Springer
favorite
Email
discuss
report
100
views
Programming Languages
»
more
ICALP 2009
»
A Decidable Characterization of Locally Testable Tree Languages
14 years 8 months ago
Download
www.lsv.ens-cachan.fr
Thomas Place, Luc Segoufin
Real-time Traffic
ICALP 2009
|
Testable Tree Languages
|
Theoretical Computer Science
|
claim paper
Related Content
»
Piecewise Testable Tree Languages
»
Effective characterizations of tree logics
»
A new algorithm for testing if a regular language is locally threshold testable
»
Approximate schemas sourceconsistency and query answering
»
Classifying Regular Languages via Cascade Products of Automata
»
Characterizing EF and EX Tree Logics
»
On Decidability Properties of Local Sentences
»
Rigid Tree Automata
»
Associative language descriptions
more »
Post Info
More Details (n/a)
Added
03 Dec 2009
Updated
03 Dec 2009
Type
Conference
Year
2009
Where
ICALP
Authors
Thomas Place, Luc Segoufin
Comments
(0)
Researcher Info
Programming Languages Study Group
Computer Vision