自动机理论中的不确定性和不完备性结果

A Half-Century of Automata Theory Pub Date : 2001-10-01 DOI:10.1142/9789812810168_0002

J. Hartmanis

{"title":"自动机理论中的不确定性和不完备性结果","authors":"J. Hartmanis","doi":"10.1142/9789812810168_0002","DOIUrl":null,"url":null,"abstract":"Automata theory is inextricably intertwined with undecidability and incompleteness results. This papers explores the beautiful panorama of undecidability and Godel-like incompleteness results in automata theory that reveals their ubiquity and clarifies and illustrates how the severity of these results changes with the complexity of the problems and the computing power of the automata.","PeriodicalId":294477,"journal":{"name":"A Half-Century of Automata Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Undecidability and Incompleteness Results in Automata Theory\",\"authors\":\"J. Hartmanis\",\"doi\":\"10.1142/9789812810168_0002\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Automata theory is inextricably intertwined with undecidability and incompleteness results. This papers explores the beautiful panorama of undecidability and Godel-like incompleteness results in automata theory that reveals their ubiquity and clarifies and illustrates how the severity of these results changes with the complexity of the problems and the computing power of the automata.\",\"PeriodicalId\":294477,\"journal\":{\"name\":\"A Half-Century of Automata Theory\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"A Half-Century of Automata Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/9789812810168_0002\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"A Half-Century of Automata Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/9789812810168_0002","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

自动机理论与不确定性和不完备性结果密不可分。本文探索了自动机理论中不可判定性和哥德尔式不完备性结果的美丽全景，揭示了它们的普遍性，并阐明了这些结果的严重性如何随着问题的复杂性和自动机的计算能力而变化。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Undecidability and Incompleteness Results in Automata Theory

Automata theory is inextricably intertwined with undecidability and incompleteness results. This papers explores the beautiful panorama of undecidability and Godel-like incompleteness results in automata theory that reveals their ubiquity and clarifies and illustrates how the severity of these results changes with the complexity of the problems and the computing power of the automata.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

A Half-Century of Automata Theory

自引率

0.00%

发文量