Borrow it
- African Studies Library
- Alumni Medical Library
- Astronomy Library
- Fineman and Pappas Law Libraries
- Frederick S. Pardee Management Library
- Howard Gotlieb Archival Research Center
- Mugar Memorial Library
- Music Library
- Pikering Educational Resources Library
- School of Theology Library
- Science & Engineering Library
- Stone Science Library
The Resource Theories of abstract automata, Michael A. Arbib
Theories of abstract automata, Michael A. Arbib
Resource Information
The item Theories of abstract automata, Michael A. Arbib represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Theories of abstract automata, Michael A. Arbib represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
- Language
- eng
- Extent
- xiii, 412 pages
- Contents
-
- pt. I. Background. An overview of automata theory
- Algebraic background
- pt. II. An introduction to automata theory. Finite automata
- Turing machines and effective computations
- Post systems and context-free languages
- pt. III. Selected topics. Partial recursive functions
- Complexity of computation
- Algebraic decomposition theory
- Stochastic automata
- Machines which compute and construct
- Isbn
- 9780139133688
- Label
- Theories of abstract automata
- Title
- Theories of abstract automata
- Statement of responsibility
- Michael A. Arbib
- Subject
-
- Abstrakter Automat
- Automatentheorie
- Automatentheorie
- Automates mathématiques, Théorie des
- Automates mathématiques, Théorie des
- Machine theory
- Machine theory
- Theorie
- algèbre
- automate fini
- automate stochastique
- complexité calcul
- fonction récursive
- langage
- logique
- machine Turing
- modèle biologique
- AUTOMATE ABSTRAIT
- Language
- eng
- Cataloging source
- DLC
- http://library.link/vocab/creatorName
- Arbib, Michael A
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA267
- LC item number
- .A72
- Literary form
- non fiction
- Nature of contents
- bibliography
- Series statement
- Prentice-Hall series in automatic computation.
- http://library.link/vocab/subjectName
-
- Machine theory
- modèle biologique
- automate stochastique
- complexité calcul
- fonction récursive
- langage
- logique
- algèbre
- machine Turing
- automate fini
- AUTOMATE ABSTRAIT
- Automates mathématiques, Théorie des
- Machine theory
- Abstrakter Automat
- Automatentheorie
- Theorie
- Automates mathématiques, Théorie des
- Automatentheorie
- Label
- Theories of abstract automata, Michael A. Arbib
- Bibliography note
- Bibliography: p. 389-400
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- pt. I. Background. An overview of automata theory -- Algebraic background -- pt. II. An introduction to automata theory. Finite automata -- Turing machines and effective computations -- Post systems and context-free languages -- pt. III. Selected topics. Partial recursive functions -- Complexity of computation -- Algebraic decomposition theory -- Stochastic automata -- Machines which compute and construct
- Dimensions
- 24 cm.
- Extent
- xiii, 412 pages
- Isbn
- 9780139133688
- Lccn
- 72082901
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
-
- (OCoLC)00027275
- (OCoLC)ocm00027275
- Label
- Theories of abstract automata, Michael A. Arbib
- Bibliography note
- Bibliography: p. 389-400
- Carrier category
- volume
- Carrier category code
-
- nc
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- pt. I. Background. An overview of automata theory -- Algebraic background -- pt. II. An introduction to automata theory. Finite automata -- Turing machines and effective computations -- Post systems and context-free languages -- pt. III. Selected topics. Partial recursive functions -- Complexity of computation -- Algebraic decomposition theory -- Stochastic automata -- Machines which compute and construct
- Dimensions
- 24 cm.
- Extent
- xiii, 412 pages
- Isbn
- 9780139133688
- Lccn
- 72082901
- Media category
- unmediated
- Media MARC source
- rdamedia
- Media type code
-
- n
- Other physical details
- illustrations
- System control number
-
- (OCoLC)00027275
- (OCoLC)ocm00027275
Subject
- Abstrakter Automat
- Automatentheorie
- Automatentheorie
- Automates mathématiques, Théorie des
- Automates mathématiques, Théorie des
- Machine theory
- Machine theory
- Theorie
- algèbre
- automate fini
- automate stochastique
- complexité calcul
- fonction récursive
- langage
- logique
- machine Turing
- modèle biologique
- AUTOMATE ABSTRAIT
Member of
Library Locations
-
African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 -71.105717
-
Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 -71.107023
-
Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 -71.099547
-
Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 -71.108227
-
-
Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 -71.108227
-
Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 -71.101425
-
School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 -71.107235
-
Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 -71.102257
-
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Theories-of-abstract-automata-Michael-A./Q9AXxE57GKI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Theories-of-abstract-automata-Michael-A./Q9AXxE57GKI/">Theories of abstract automata, Michael A. Arbib</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Theories of abstract automata, Michael A. Arbib
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.bu.edu/portal/Theories-of-abstract-automata-Michael-A./Q9AXxE57GKI/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Theories-of-abstract-automata-Michael-A./Q9AXxE57GKI/">Theories of abstract automata, Michael A. Arbib</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>