Regular tree languages definable in FO and in FOmod

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Michael Benedikt Oxford University, Oxford, UK
Luc Segoufin INRIA, LSV, CACHAN, Cedex, France
Published in:
Cover Image
 
· Journal
ACM Transactions on Computational Logic (TOCL) TOCL Homepage archive
Volume 11 Issue 1, October 2009
Article No. 4
ACM New York, NY, USA
table of contents doi>10.1145/1614431.1614435
Regular tree languages definable in FO and in FO<sub><i>mod</i></sub> Published by ACM 2009 Article
  • Research
  • Refereed
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 5
· Downloads (12 Months): 20
· Downloads (cumulative): 129
· Citation Count: 5


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder