Research Catalog
Formal languages and their relation to automata
- Title
- Formal languages and their relation to automata [by] John E. Hopcroft [and] Jeffrey D. Ullman.
- Author
- Hopcroft, John E., 1939-
- Publication
- Reading, Mass., Addison-Wesley Pub. Co. [1969]
Items in the Library & Off-site
Filter by
1 Item
| Status | Format | Access | Call Number | Item Location |
|---|---|---|---|---|
| Text | Use in library | QA267.3 .H6 | Off-site |
Details
- Additional Authors
- Ullman, Jeffrey D., 1942-
- Description
- vii, 242 pages illustrations; 24 cm.
- Series Statement
- Addison-Wesley series in computer science and information processing
- Uniform Title
- Addison-Wesley series in computer science and information processing.
- Subject
- Bibliography (note)
- Bibliography: p. 233-238.
- 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.
- ISBN
- 0201029839
- 9780201029833
- LCCN
- 69014297
- OCLC
- ocm00005012
- 5012
- SCSB-9226288
- Owning Institutions
- Princeton University Library