SIGN IN
SIGN UP
Automatic linear orders and trees
Full Text:
PDF
Buy this Article
Authors:
Bakhadyr Khoussainov
University of Auckland, Auckland, New Zealand
Sasha Rubin
University of Auckland, Auckland, New Zealand
Frank Stephan
National University of Singapore, Singapore
Published in:
· Journal
ACM Transactions on Computational Logic (TOCL)
TOCL Homepage
archive
Volume 6 Issue 4, October 2005
Pages 675-700
ACM
New York, NY
, USA
table of contents
doi>
10.1145/1094622.1094625
2005 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 12
· Downloads (cumulative): 518
· Citation Count: 18
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
automata
automatic structures
classes defined by grammars or automata
languages
linear orders
theory
trees
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder