Some bounds on the complexity of predicate recognition by finite automata

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Some bounds on the complexity of predicate re ...
Y. Breitbart
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by Open Library Bot
December 5, 2010 | History

Some bounds on the complexity of predicate recognition by finite automata

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

This edition doesn't have a description yet. Can you add one?

Publish Date
Language
English
Pages
20

Buy this book

Edition Availability
Cover of: Some bounds on the complexity of predicate recognition by finite automata
Some bounds on the complexity of predicate recognition by finite automata
1974, Technion-Israel Institute of Technology, Dept. of Computer Science
in English

Add another edition?

Book Details


Edition Notes

Bibliography: leaf [21]

Published in
Haifa
Series
Technical report - Technion, Israel Institute of Technology, Department of Computer Science ; no. 34

Classifications

Dewey Decimal Class
519.4
Library of Congress
QA267.5.S4 B69

The Physical Object

Pagination
20, [1] leaves ;
Number of pages
20

ID Numbers

Open Library
OL4214734M
LCCN
80494332

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON
December 5, 2010 Edited by Open Library Bot Added subjects from MARC records.
December 10, 2009 Created by WorkBot add works page