skip to content
Formal languages and their relation to automata Preview this item
ClosePreview this item
Checking...

Formal languages and their relation to automata

Author: John E Hopcroft; Jeffrey D Ullman
Publisher: Reading, Mass. : Addison-Wesley Pub. Co., 1969.
Series: Addison-Wesley series in computer science and information processing.
Edition/Format:   Book : EnglishView 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-
Formal languages and their relation to automata.
Reading, Mass., Addison-Wesley Pub. Co. [1969]
(OCoLC)558614508
Document Type: Book
All Authors / Contributors: John E Hopcroft; Jeffrey D Ullman
ISBN: 0201029839 9780201029833
OCLC Number: 5012
Notes: Includes index.
Description: vii, 242 p. : ill. ; 24 cm.
Contents: Languages and their representations --
Grammars --
Finite automata and regular grammars --
Context-free grammars --
Pushdown automata --
Turing machines --
Turing machines: the halting problem, type 0 languages --
Linear bounded automata and context-sensitive languages --
Operations on languages --
Time- and tap-bounded Turing machines --
Time and space bounds for recognizing context-free languages --
Deterministic pushdown automata --
Stack automata --
Decidability.
Series Title: Addison-Wesley series in computer science and information processing.
Responsibility: John E. Hopcroft, 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


<http://www.worldcat.org/oclc/5012>
library:oclcnum"5012"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/5012>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:about
schema:about
rdf:typeschema:Intangible
schema:name"Autómatas--Lenguaje formal."
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:author
schema:contributor
schema:datePublished"1969"
schema:description"Languages and their representations -- Grammars -- Finite automata and regular grammars -- Context-free grammars -- Pushdown automata -- Turing machines -- Turing machines: the halting problem, type 0 languages -- Linear bounded automata and context-sensitive languages -- Operations on languages -- Time- and tap-bounded Turing machines -- Time and space bounds for recognizing context-free languages -- Deterministic pushdown automata -- Stack automata -- Decidability."
schema:exampleOfWork<http://worldcat.org/entity/work/id/1128440>
schema:inLanguage"en"
schema:name"Formal languages and their relation to automata"
schema:numberOfPages"242"
schema:publisher
schema:workExample
schema:workExample

Content-negotiable representations

Close Window

Please sign in to WorldCat 

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