skip to content
Theory of computation : formal languages, automata, and complexity Preview this item
ClosePreview this item
Checking...

Theory of computation : formal languages, automata, and complexity

Author: J Glenn Brookshear
Publisher: Redwood City, Calif. : Benjamin/Cummings, 1991.
Series: Benjamin/Cummings series in computer science.
Edition/Format:   Print book : English : [Nachdr.]View all editions and formats
Rating:

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

Find a copy online

Links to this item

Find a copy in the library

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

Details

Material Type: Internet resource
Document Type: Book, Internet Resource
All Authors / Contributors: J Glenn Brookshear
ISBN: 0805301437 9780805301434
OCLC Number: 256784242
Description: XII, 322 Seiten : Diagramme.
Contents: Preliminaries. Review of Set Theory.Grammatical Basis of Language Translation.Historical Background.Preview of the Remaining Text.Chapter Review Problems.Finite Automata and Regular Languages. Lexical Analysis.Deterministic Finite Automata.The Limits of Deterministic Finite Automata.Nondeterministic Finite Automata.Regular Grammars.Regular Expressions.Closing Comments.Chapter Review Problems.Pushdown Automata and Context-Free Languages. Pushdown Automata.Context-Free Grammars.The Limits of Pushdown Automata.LL(k) Parsers.LR(k) Parsers.Turing Machines and Phase-Structure Languages. Turing Machines.Modular Construction of Turing Machines.Turing Machines as Language Accepters.Turing-Acceptable Languages.Beyond Phrase-Structure Languages.Closing Comments.Chapter Review Problems.Computability. Foundations of Recursive Function Theory.The Scope of Primitive Recursive Functions.Partial Recursive Functions.The Power of Programming Languages.Closing Comments.Chapter Review Problems.Complexity. Computations.The Complexity of Algorithms.The Complexity of Problems.Time Complexity of Language Recognition Problems.Time Complexity of Nondeterministic Machines.Closing Comments.Chapter Review Problems.Appendices. A. More About Constructing LR(1) Parse Tables.B. More About Ackerman's Function.C. Some Important Unsolvable Problems.D. On the Complexity of the String Comparison Problem.E. A Sampling of NP Problems.Additional Reading. 0805301437T04062001
Series Title: Benjamin/Cummings series in computer science.
Responsibility: J. Glenn Brookshear.

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/256784242> # Theory of computation : formal languages, automata, and complexity
    a schema:CreativeWork, schema:Book ;
   library:oclcnum "256784242" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/600330#Place/redwood_city_calif> ; # Redwood City, Calif.
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/cau> ;
   schema:bookEdition "[Nachdr.]." ;
   schema:bookFormat bgn:PrintBook ;
   schema:creator <http://viaf.org/viaf/77708962> ; # J Glenn Brookshear
   schema:datePublished "1991" ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/600330> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/600330#Series/the_benjamin_cummings_series_in_computer_science> ; # The Benjamin/Cummings series in computer science
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/600330#Series/benjamin_cummings_series_in_computer_science> ; # Benjamin/Cummings series in computer science.
   schema:name "Theory of computation : formal languages, automata, and complexity" ;
   schema:productID "256784242" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/256784242#PublicationEvent/redwood_city_calif_benjamin_cummings_1991> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/600330#Agent/benjamin_cummings> ; # Benjamin/Cummings
   schema:url <http://www.gbv.de/dms/bowker/toc/9780805301434.pdf> ;
   schema:workExample <http://worldcat.org/isbn/9780805301434> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/256784242> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/600330#Agent/benjamin_cummings> # Benjamin/Cummings
    a bgn:Agent ;
   schema:name "Benjamin/Cummings" ;
    .

<http://experiment.worldcat.org/entity/work/data/600330#Place/redwood_city_calif> # Redwood City, Calif.
    a schema:Place ;
   schema:name "Redwood City, Calif." ;
    .

<http://experiment.worldcat.org/entity/work/data/600330#Series/benjamin_cummings_series_in_computer_science> # Benjamin/Cummings series in computer science.
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/256784242> ; # Theory of computation : formal languages, automata, and complexity
   schema:name "Benjamin/Cummings series in computer science." ;
    .

<http://experiment.worldcat.org/entity/work/data/600330#Series/the_benjamin_cummings_series_in_computer_science> # The Benjamin/Cummings series in computer science
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/256784242> ; # Theory of computation : formal languages, automata, and complexity
   schema:name "The Benjamin/Cummings series in computer science" ;
    .

<http://viaf.org/viaf/77708962> # J Glenn Brookshear
    a schema:Person ;
   schema:familyName "Brookshear" ;
   schema:givenName "J. Glenn" ;
   schema:name "J Glenn Brookshear" ;
    .

<http://worldcat.org/isbn/9780805301434>
    a schema:ProductModel ;
   schema:isbn "0805301437" ;
   schema:isbn "9780805301434" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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