| Record ID | marc_loc_2016/BooksAll.2016.part13.utf8:48063194:1029 |
| Source | Library of Congress |
| Download Link | /show-records/marc_loc_2016/BooksAll.2016.part13.utf8:48063194:1029?format=raw |
LEADER: 01029cam a2200241 i 4500
001 80494332
003 DLC
005 20130430091333.0
008 800926s1974 is b 000 0 eng
010 $a 80494332
040 $aDLC$cDLC$dDLC
050 00 $aQA267.5.S4$bB69
082 00 $a519.4$219
100 1 $aBreitbart, Y.
245 10 $aSome bounds on the complexity of predicate recognition by finite automata /$cby Y. Breitbart.
260 $aHaifa :$bTechnion-Israel Institute of Technology, Dept. of Computer Science,$c1974.
300 $a20, [1] leaves ;$c27 cm.
490 1 $aTechnical report - Technion, Israel Institute of Technology, Department of Computer Science ; no. 34
504 $aBibliography: leaf [21]
650 0 $aSequential machine theory.
650 0 $aPredicate calculus.
650 0 $aComputational complexity.
810 1 $aHaifa.$bTechnion, Israel Institute of Technology.$bDepartment of Computer Sciences.$tTechnical report - Technion, Israel Institute of Technology, Department of Computer Science ;$vno. 34.