A Course in Formal Languages, Automata and Groups
The aim of the first three chapters is to give a rigorous proof that various notions of recursively enumerable language are equivalent. Chapter One begins with languages defined by Chomsky grammars and the idea of machine recognition, contains a discussion of Turing Machines, and includes work on fi...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | 圖書 |
| 語言: | English |
| 出版: |
Springer
2017
|
| 主題: | |
| 在線閱讀: | http://repository.vnu.edu.vn/handle/VNU_123/30240 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|