000 | 01177nam a22001817a 4500 | ||
---|---|---|---|
999 |
_c44794 _d44794 |
||
003 | OSt | ||
020 | _a9789385323219 | ||
082 | _a005.131 LIN-I | ||
100 | _aLinz, Peter | ||
245 | _aIntroduction to Formal Language and Automata | ||
250 | _a6th | ||
260 |
_aNew Delhi _bJones & Bartlett Learning _c2018 |
||
300 | _a449p. | ||
500 | _a1. Introduction to the Theory of Computation 2. Finite Automata 3. Regular Languages and Regular Grammars 4. Properties of Regular Languages 5. Context Fress Languages 6. Simplification of Context Free Grammars and Normal Forms 7. Pushdown Automata 8. Properties of Context Free Languages 9. Turing Machines 10. Other Models of Turing machines 11. A Hierachy of Formal languages and Automata 12. Limits of Algorithmic Computation 13. Other Models of Computation 14. An Overview of Computational Complexity | ||
856 | _uhttps://books.google.co.in/books?id=pDaUCwAAQBAJ&printsec=frontcover&dq=an+introduction+to+formal+languages+and+automata&hl=en&sa=X&ved=0ahUKEwiEgOrs8NnlAhUML48KHXdbDmYQ6AEIRjAE#v=onepage&q=an%20introduction%20to%20formal%20languages%20and%20automata&f=false | ||
901 | _a29326 | ||
942 |
_2ddc _cBK |