SIGN IN
SIGN UP
Finite automation over real-number alphabets (abstract only): some theoretical results and applications
Author:
Martin E. Kaliski
Published in:
· Proceeding
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
ACM
New York, NY
, USA
©1985
table of contents
ISBN:0-89791-150-4
doi>
10.1145/320599.322479
1985 Article
Bibliometrics
· Downloads (6 Weeks): n/a
· Downloads (12 Months): n/a
· Citation Count: 0
Tools and Resources
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
experimentation
models of computation
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