Automata, computability and complexity : theory and applications
Material type:![Text](/opac-tmpl/lib/famfamfam/BK.png)
- 9788131788226
- 511.3 RIC-A
- QA267 .R53 2008
Contents:
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
![]() |
IIITD Reference | Mathematics | REF 511.3 RIC-A (Browse shelf(Opens below)) | Available | 001247 | ||
![]() |
IIITD General Stacks | Mathematics | 511.3 RIC-A (Browse shelf(Opens below)) | Available | 001248 |
Total holds: 0
Includes bibliographical references and index.
Finite state machines and regular languages -- Context-free languages and pushdown automata -- Turing machines and undecidability -- Complexity.
There are no comments on this title.