{"title":"有时辅助下推自动机的对称性与非确定性一致","authors":"E. Allender, Klaus-Jörn Lange","doi":"10.4086/toc.2014.v010a008","DOIUrl":null,"url":null,"abstract":"We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC^1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time.","PeriodicalId":328781,"journal":{"name":"2010 IEEE 25th Annual Conference on Computational Complexity","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata\",\"authors\":\"E. Allender, Klaus-Jörn Lange\",\"doi\":\"10.4086/toc.2014.v010a008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC^1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time.\",\"PeriodicalId\":328781,\"journal\":{\"name\":\"2010 IEEE 25th Annual Conference on Computational Complexity\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE 25th Annual Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4086/toc.2014.v010a008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE 25th Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4086/toc.2014.v010a008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata
We show that every language accepted by a nondeterministic auxiliary pushdown automaton in polynomial time (that is, every language in SAC^1 = Log(CFL)) can be accepted by a symmetric auxiliary pushdown automaton in polynomial time.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
