| 書目名稱 | Finite Automata, Formal Logic, and Circuit Complexity | | 編輯 | Howard Straubing | | 視頻video | http://file.papertrans.cn/344/343518/343518.mp4 | | 叢書名稱 | Progress in Theoretical Computer Science | | 圖書封面 |  | | 描述 | The study of the connections between mathematical automata and for- mal logic is as old as theoretical computer science itself. In the founding paper of the subject, published in 1936, Turing showed how to describe the behavior of a universal computing machine with a formula of first- order predicate logic, and thereby concluded that there is no algorithm for deciding the validity of sentences in this logic. Research on the log- ical aspects of the theory of finite-state automata, which is the subject of this book, began in the early 1960‘s with the work of J. Richard Biichi on monadic second-order logic. Biichi‘s investigations were extended in several directions. One of these, explored by McNaughton and Papert in their 1971 monograph Counter-free Automata, was the characterization of automata that admit first-order behavioral descriptions, in terms of the semigroup- theoretic approach to automata that had recently been developed in the work of Krohn and Rhodes and of Schiitzenberger. In the more than twenty years that have passed since the appearance of McNaughton and Papert‘s book, the underlying semigroup theory has grown enor- mously, permitting a considerable extension of the | | 出版日期 | Book 1994 | | 關(guān)鍵詞 | algorithms; automata; complexity; computer; computer science; formal language; formal languages; formal log | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-0289-9 | | isbn_softcover | 978-1-4612-6695-2 | | isbn_ebook | 978-1-4612-0289-9 | | copyright | Springer Science+Business Media New York 1994 |
The information of publication is updating
書目名稱Finite Automata, Formal Logic, and Circuit Complexity影響因子(影響力)
書目名稱Finite Automata, Formal Logic, and Circuit Complexity影響因子(影響力)學(xué)科排名
書目名稱Finite Automata, Formal Logic, and Circuit Complexity網(wǎng)絡(luò)公開度
書目名稱Finite Automata, Formal Logic, and Circuit Complexity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Finite Automata, Formal Logic, and Circuit Complexity被引頻次
書目名稱Finite Automata, Formal Logic, and Circuit Complexity被引頻次學(xué)科排名
書目名稱Finite Automata, Formal Logic, and Circuit Complexity年度引用
書目名稱Finite Automata, Formal Logic, and Circuit Complexity年度引用學(xué)科排名
書目名稱Finite Automata, Formal Logic, and Circuit Complexity讀者反饋
書目名稱Finite Automata, Formal Logic, and Circuit Complexity讀者反饋學(xué)科排名
|
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-16 22:51
發(fā)表于 2025-3-21 19:23:27
