Image from Google Jackets

Normal view MARC view ISBD view

Elementary computability formal languages and automata

By:

McNaughton, Robert

Publication details: New Jersey Prentice-Hall of India 1982Description: xvi,400pSubject(s):

Computer science Programming languages

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

Holdings
Item type	Current library	Call number	Status	Date due	Barcode
Books	University Library Secondary Collection	004.421.4 MCN;1 (Browse shelf(Opens below))	Available		00033201

Browsing University Library shelves, Shelving location: Secondary Collection Close shelf browser (Hides shelf browser)

Previous		No cover image available	No cover image available	No cover image available	No cover image available		No cover image available	Next
Previous	004.421.2 HUS Non determinism in Algebric specifications and algebraic programs	004.421.2 RIC Numerical methods, software and analysis	004.421.2 YEH Applied computation theory: analysis, design, modeling	004.421.4 MCN;1 Elementary computability formal languages and automata	004.421.4 TRA Analytic computational complexity	004.421TEL Introduction to distributed algorithms	004.4'22 BRA Applications development using CASE tools	Next

There are no comments on this title.

to post a comment.

University Library, CUSAT