{"title":"关于普遍有限自动机或下推自动机的存在性","authors":"M. Kudlek","doi":"10.4204/EPTCS.88.7","DOIUrl":null,"url":null,"abstract":"We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach, using transition systems, is presented too.","PeriodicalId":88470,"journal":{"name":"Dialogues in cardiovascular medicine : DCM","volume":"1 1","pages":"79-86"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the Existence of Universal Finite or Pushdown Automata\",\"authors\":\"M. Kudlek\",\"doi\":\"10.4204/EPTCS.88.7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach, using transition systems, is presented too.\",\"PeriodicalId\":88470,\"journal\":{\"name\":\"Dialogues in cardiovascular medicine : DCM\",\"volume\":\"1 1\",\"pages\":\"79-86\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Dialogues in cardiovascular medicine : DCM\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.88.7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Dialogues in cardiovascular medicine : DCM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.88.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the Existence of Universal Finite or Pushdown Automata
We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding function. An alternative approach, using transition systems, is presented too.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
