skip to content
Introduction to automata theory, languages, and computation Preview this item
ClosePreview this item
Checking...

Introduction to automata theory, languages, and computation

Author: John E Hopcroft; Rajeev Motwani; Jeffrey D Ullman
Publisher: Boston : Addison-Wesley, ©2001.
Edition/Format:   Print book : English : 2nd edView all editions and formats
Database:WorldCat
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Additional Physical Format: Online version:
Hopcroft, John E., 1939-
Introduction to automata theory, languages, and computation.
Boston : Addison-Wesley, ©2001
(OCoLC)664427437
Document Type: Book
All Authors / Contributors: John E Hopcroft; Rajeev Motwani; Jeffrey D Ullman
ISBN: 0201441241 9780201441246
OCLC Number: 44934231
Description: xiv, 521 pages : illustrations ; 25 cm
Contents: Automata: The Methods and the Madness --
Finite Automata --
Regular Expressions and Languages --
Properties of Regular Languages --
Context-Free Grammars and Languages --
Pushdown Automata --
Properties of Context-Free Languages.
Responsibility: John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/44934231> # Introduction to automata theory, languages, and computation
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "44934231" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/mau> ;
   library:placeOfPublication <http://dbpedia.org/resource/Boston> ; # Boston
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/automates_mathematiques_theorie_des> ; # Automates mathématiques, Théorie des
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/complexite_algorithmique> ; # Complexité algorithmique
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/automate_mathematique> ; # Automate mathématique
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/theorie_des_automates> ; # Théorie des automates
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/computers> ; # Computers
   schema:about <http://id.worldcat.org/fast/871991> ; # Computational complexity
   schema:about <http://id.worldcat.org/fast/932922> ; # Formal languages
   schema:about <http://dewey.info/class/511.3/e21/> ;
   schema:about <http://id.worldcat.org/fast/1004846> ; # Machine theory
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/langage_formel> ; # Langage formel
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/formele_talen> ; # Formele talen
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/cellulaire_automaten> ; # Cellulaire automaten
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/programmeren_computers> ; # Programmeren (computers)
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/complexite_de_calcul_informatique> ; # Complexité de calcul (Informatique)
   schema:about <http://experiment.worldcat.org/entity/work/data/9643580#Topic/langages_formels> ; # Langages formels
   schema:bookEdition "2nd ed." ;
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/27998371> ; # Rajeev Motwani
   schema:contributor <http://viaf.org/viaf/108124067> ; # Jeffrey D. Ullman
   schema:copyrightYear "2001" ;
   schema:creator <http://viaf.org/viaf/61608974> ; # John E. Hopcroft
   schema:datePublished "2001" ;
   schema:description "Automata: The Methods and the Madness -- Finite Automata -- Regular Expressions and Languages -- Properties of Regular Languages -- Context-Free Grammars and Languages -- Pushdown Automata -- Properties of Context-Free Languages."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/9643580> ;
   schema:inLanguage "en" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/664427437> ;
   schema:name "Introduction to automata theory, languages, and computation"@en ;
   schema:productID "44934231" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/44934231#PublicationEvent/boston_addison_wesley_2001> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/9643580#Agent/addison_wesley> ; # Addison-Wesley
   schema:workExample <http://worldcat.org/isbn/9780201441246> ;
   umbel:isLike <http://bnb.data.bl.uk/id/resource/GBA143365> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/44934231> ;
    .


Related Entities

<http://dbpedia.org/resource/Boston> # Boston
    a schema:Place ;
   schema:name "Boston" ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Agent/addison_wesley> # Addison-Wesley
    a bgn:Agent ;
   schema:name "Addison-Wesley" ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/automate_mathematique> # Automate mathématique
    a schema:Intangible ;
   schema:name "Automate mathématique"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/automates_mathematiques_theorie_des> # Automates mathématiques, Théorie des
    a schema:Intangible ;
   schema:name "Automates mathématiques, Théorie des"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/cellulaire_automaten> # Cellulaire automaten
    a schema:Intangible ;
   schema:name "Cellulaire automaten"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/complexite_algorithmique> # Complexité algorithmique
    a schema:Intangible ;
   schema:name "Complexité algorithmique"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/complexite_de_calcul_informatique> # Complexité de calcul (Informatique)
    a schema:Intangible ;
   schema:name "Complexité de calcul (Informatique)"@fr ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/programmeren_computers> # Programmeren (computers)
    a schema:Intangible ;
   schema:name "Programmeren (computers)"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/9643580#Topic/theorie_des_automates> # Théorie des automates
    a schema:Intangible ;
   schema:name "Théorie des automates"@en ;
    .

<http://id.worldcat.org/fast/1004846> # Machine theory
    a schema:Intangible ;
   schema:name "Machine theory"@en ;
    .

<http://id.worldcat.org/fast/871991> # Computational complexity
    a schema:Intangible ;
   schema:name "Computational complexity"@en ;
    .

<http://id.worldcat.org/fast/932922> # Formal languages
    a schema:Intangible ;
   schema:name "Formal languages"@en ;
    .

<http://viaf.org/viaf/108124067> # Jeffrey D. Ullman
    a schema:Person ;
   schema:birthDate "1942" ;
   schema:familyName "Ullman" ;
   schema:givenName "Jeffrey D." ;
   schema:name "Jeffrey D. Ullman" ;
    .

<http://viaf.org/viaf/27998371> # Rajeev Motwani
    a schema:Person ;
   schema:familyName "Motwani" ;
   schema:givenName "Rajeev" ;
   schema:name "Rajeev Motwani" ;
    .

<http://viaf.org/viaf/61608974> # John E. Hopcroft
    a schema:Person ;
   schema:birthDate "1939" ;
   schema:familyName "Hopcroft" ;
   schema:givenName "John E." ;
   schema:name "John E. Hopcroft" ;
    .

<http://worldcat.org/isbn/9780201441246>
    a schema:ProductModel ;
   schema:isbn "0201441241" ;
   schema:isbn "9780201441246" ;
    .

<http://www.worldcat.org/oclc/664427437>
    a schema:CreativeWork ;
   rdfs:label "Introduction to automata theory, languages, and computation." ;
   schema:description "Online version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/44934231> ; # Introduction to automata theory, languages, and computation
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.