000 01147cam a2200241 a 4500
001 vtls000001613
003 VRT
005 20250102224544.0
008 081105s2001 mau |b 001 0 eng
020 _a0763714224
039 9 _a201402040058
_bVLOAD
_c201005301237
_dmalmash
_c200811081319
_dvenkatrajand
_c200811051355
_dNoora
_y200811051353
_zNoora
050 0 0 _aQA267.3
_b.L56 2001
100 1 _aLinz, Peter.
_935446
245 1 3 _aAn Introduction to Formal Languages and Automata /
_cPeter Linz.
250 _a3rd ed.
260 _aBoston :
_bJones and Bartlett,
_c2001.
300 _axi, 410 p. ;
_c25 cm.
504 _aIncludes bibliographical references (p. 405) and index.
520 _a$a Formal languages, automata, computability, and related matters form the major part of the theory of computation. This textbook is designed for an introductory course for computer science and computer engineering majors who have knowledge of some higher-level programming language, the fundamentals of data structures and algorithms, and discrete math
650 0 _aFormal languages.
_91101
650 0 _aMachine theory.
_91100
942 _2lcc
_n0
_cBK
999 _c20011
_d20011