Показать сокращенную информацию
dc.contributor.author | Khadieva A. | |
dc.contributor.author | Yakaryılmaz A. | |
dc.date.accessioned | 2022-02-09T20:33:46Z | |
dc.date.available | 2022-02-09T20:33:46Z | |
dc.date.issued | 2021 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/169031 | |
dc.description.abstract | We initiate the study of the verification power of Affine finite automata (AfA) as a part of Arthur-Merlin (AM) proof systems. We show that every unary language is verified by a real-valued AfA verifier. Then, we focus on the verifiers restricted to have only integer-valued or rational-valued transitions. We observe that rational-valued verifiers can be simulated by integer-valued verifiers, and their protocols can be simulated in nondeterministic polynomial time. We show that this upper bound is tight by presenting an AfA verifier for NP-complete problem SUBSETSUM. We also show that AfAs can verify certain non-affine and non-stochastic unary languages. | |
dc.relation.ispartofseries | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.subject | Affine automata | |
dc.subject | Arthur-Merlin games | |
dc.subject | Interactive proof systems | |
dc.subject | NP | |
dc.subject | Subset-sum problem | |
dc.subject | Unary languages | |
dc.title | Affine Automata Verifiers | |
dc.type | Conference Proceeding | |
dc.relation.ispartofseries-volume | 12984 LNCS | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 84 | |
dc.source.id | SCOPUS03029743-2021-12984-SID85118125675 |