Some bounds on the complexity of predicate recognition by finite automata
By: by Y. Breitbart.
Series: Technical report - Technion, Israel Institute of Technology, Department of Computer Science ; no. 34
Publisher: Technion-Israel Institute of Technology, Dept. of Computer Science
Published: 1974
Place of publication: Haifa
Language: eng
Number of pages: 20
Subjects: Sequential machine theory.; Predicate calculus.; Computational complexity.
Notes: Bibliography: leaf [21]