MARC 닫기
00422nam ac200169 k 4500
000003536011
20220101120000
ta
010731s1979 US 000 eng
▼a 211070
▼c 211070
▼l WM0004010316
▼a QA267
▼a QA267
▼b H56
▼a INTRODUCTION TO AUTOMATA THEORY LANGUAGES AND COMPUTATION/
▼d HOPCROFT,JOHN E
▼c 1979.
▼a 418p.
▼a HOPCROFT,JOHN E
▼a 단행본
| 자료유형 : | 단행본 |
|---|---|
| 분류기호 : | QA267 |
| 서명/저자사항 : | INTRODUCTION TO AUTOMATA THEORY LANGUAGES AND COMPUTATION/ HOPCROFT,JOHN E |
| 발행사항 : | 1979. |
| 형태사항 : | 418p. |
| 개인저자 : | HOPCROFT,JOHN E |
| 언어 | 영어 |
WMO199903502
권 호 : 418
발행년 : 1979
서 명 : INTRODUCTION TO AUTOMATA THEORY LANGUAGES AND COMPUTATION
발행처 : HOPCROFT,JOHN E
목차
1. PRELIMINARIES
2. FINITE AUTOMATA AND REGULAR EXPRESSIONS
3. PROPERTIES OF REGULAR SETS
4. CONTEXT-FREE GRAMMARS
5. PUSHDOWM AUTOMATA
6. PROPERTIES OF CONTEST-FREE LANGUAGES
7. TURING MACHINES
8. UNDECIDABILITY
9. THE CHOMSKY HIERARCHY
10. DETERMINISTIC CONTEXT-FREE LANGUAGES
11. CLOSURE PROPERTIES OF FAMILIES OF LANGUAGES
12. INTRACTABLE PROBLEMS
13. HIGHLIGHTS OF OTHER IMPORTANT LANGUAGE CLASSES
서평쓰기