Normal view MARC view ISBD view

Automata, Computability and Complexity :

Published by : Pearson Prentice Hall, (New Delhi) Physical details: xx, 1099 p. : ill. ; 25 cm. ISBN:9788131788226.

Subject(s): Machine theory. | Computable functions. | Computational complexity. | Electronic data processing.

Year: 2008

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

This record has many physical items (150). Click here to view them all.

Previous								Next
Previous	005.131 RIC Automata, Computability and Complexity :	005.131 RIC Automata, Computability and Complexity :	005.131 RIC Automata, Computability and Complexity :	005.131 RIC Automata, Computability and Complexity :	005.131 RIC Automata, Computability and Complexity :	005.131 RIC Automata, Computability and Complexity :	005.131 SUN Formal Languages and Automata Theory	Next

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 for this item.

RYMEC Library