| 期刊全稱(chēng) | Automata Theory and Formal Languages | | 期刊簡(jiǎn)稱(chēng) | Fundamental Notions, | | 影響因子2023 | Alberto Pettorossi | | 視頻video | http://file.papertrans.cn/167/166183/166183.mp4 | | 發(fā)行地址 | Assumes no prior exposure to these topics nor any training in mathematics or logic.Presents fundamental techniques for parsing both regular and context-free languages.Offers helpful supplementary mate | | 學(xué)科分類(lèi) | Undergraduate Topics in Computer Science | | 圖書(shū)封面 |  | | 影響因子 | Knowledge of automata theory and formal languages is crucial for understanding human-computer interaction, as well as for understanding the various processes that take place when manipulating knowledge if that knowledge is, indeed, expressed as sentences written in a suitably formalized language. In particular, it is at the basis of the theory of parsing, which plays an important role in language translation, compiler construction, and knowledge manipulation in general..Presenting basic notions and fundamental results, this concise textbook is structured on the basis of a correspondence that exists between classes of automata and classes of languages. That correspondence is established by the fact that the recognition and the manipulation of sentences in a given class of languages can be done by an automaton in the corresponding class of automata. Four central chapters center on: finite automata and regular languages; pushdown automata and context-free languages; linear bounded automata and context-sensitive languages; and Turing machines and type 0 languages.? The book also examines decidable and undecidable problems with emphasis on the case for context-free languages..Topics and | | Pindex | Textbook 2022 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-12 07:48
發(fā)表于 2025-3-21 16:27:04
