Table compression for tree automata

doi:10.1145/117009.117013

Table compression for tree automata

Full Text:

Pdf

Buy this Article

Authors:	Jürgen Börstler	Univ. des Saarlandes, Saarbru¨cken, Germany
	Ulrich Möncke	Univ. des Saarlandes, Saarbru¨cken, Germany
	Reinhard Wilhelm	Univ. des Saarlandes, Saarbru¨cken, Germany

Published in:

· Journal

ACM Transactions on Programming Languages and Systems (TOPLAS) TOPLAS Homepage archive

Volume 13 Issue 3, July 1991
Pages 295 - 314
ACM New York, NY, USA
table of contents doi>10.1145/117009.117013

	1991 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 8 · Downloads (cumulative): 428 · Citation Count: 2

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: automata data compaction and compression design experimentation parsing sparse tables table compression theory tree automata 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 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