000405232 000__ 01126cam\a2200313\a\4500
000405232 001__ 405232
000405232 005__ 20210513142242.0
000405232 006__ m\\\\\\\\u\\\\\\\\
000405232 007__ cr\cn|||||||||
000405232 008__ 091006s2005\\\\ii\a\\\\sb\\\\001\0\eng\d
000405232 020__ $$z9788122415087
000405232 020__ $$z9788122423341
000405232 020__ $$z8122423345
000405232 035__ $$a(CaPaEBR)ebr10323327
000405232 035__ $$a(OCoLC)646817587
000405232 040__ $$aCaPaEBR$$cCaPaEBR
000405232 05014 $$aQA267.7$$b.X38 2005eb
000405232 1001_ $$aXavier, S. P. Eugene.
000405232 24510 $$aTheory of automata, formal languages and computation$$h[electronic resource] /$$cS.P. Eugene Xavier.
000405232 260__ $$aNew Delhi :$$bNew Age International (P) Ltd., Publishers,$$cc2005.
000405232 300__ $$axiii, 345 p. :$$bill.
000405232 504__ $$aIncludes bibliographical references and index.
000405232 506__ $$aAccess limited to authorized users.
000405232 650_0 $$aComputational complexity.
000405232 650_0 $$aMachine theory.
000405232 655_7 $$aElectronic books.$$2lcsh
000405232 85280 $$bebk$$hProquest Ebook Central Academic Complete
000405232 85640 $$3ProQuest Ebook Central Academic Complete$$uhttps://univsouthin.idm.oclc.org/login?url=http://site.ebrary.com/lib/usiricelib/Doc?id=10323327$$zOnline Access
000405232 909CO $$ooai:library.usi.edu:405232$$pGLOBAL_SET
000405232 980__ $$aEBOOK
000405232 980__ $$aBIB
000405232 982__ $$aEbook
000405232 983__ $$aOnline