Format:
XVII, 654 S
,
graph. Darst
,
24 cm
Edition:
3rd ed
ISBN:
0321322215
Note:
Includes bibliographical references (p. 641-647) and index
,
Mathematical preliminaries -- Languages -- Context-free grammars -- Normal forms for context-free grammars -- Finite automata -- Properties of regular languages -- Pushdown automata and context-free languages -- Turing machines -- Turing computable functions -- The Chomsky hierarchy -- Decision problems and the church-turing thesis -- Undecidability -- Mu-recursive functions -- Time complexity -- P, NP and Cook's theorem -- NP-complete problems -- Additional complexity classes -- Parsing : an introduction -- LL(k) grammars -- LR(k) grammars
Language:
English
Keywords:
Formale Sprache
;
Chomsky-Hierarchie
;
Endlicher Automat
;
Kontextfreie Sprache
;
Unentscheidbarkeit
;
Turing-Maschine
URL:
http://www.loc.gov/catdir/toc/ecip055/2004030342.html
Bookmarklink
