SIGN IN
SIGN UP
A short proof of a conjecture of De Remer and Pennello
Full Text:
Pdf
Buy this Article
Author:
Thomas J. Sager
Univ. of Missouri-Rolla, Rolla
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 8 Issue 2, April 1986
ACM
New York, NY
, USA
table of contents
doi>
10.1145/5397.30850
1986 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 8
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
classes defined by grammars or automata
grammar types
languages
syntax
theory
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