Internet Archive Scholar

Undecidability of L(𝒜)=L(ℬ) recognized by measure many 1-way quantum automata [article]

Tianrong Lin
2021 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (187.3 kB)
https://web.archive.org/web/20210903132609/https://arxiv.org/pdf/1308.3301v11.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL. The file type is application/pdf.

Other Versions

2013 pre-print
arXiv:1308.3301v1 fatcat:dykrxyuuazhopodxvjqiwtdoyu
2014 pre-print
arXiv:1308.3301v9 fatcat:26a2yam4ivahxppgysbhpgcz64
2013 pre-print
arXiv:1308.3301v2 fatcat:42ubzhig6besvd6ccsbbsyl5rq
2013 pre-print
arXiv:1308.3301v5 fatcat:yidmfhz25zcctk5ogriiq4uzwi
2013 pre-print
arXiv:1308.3301v6 fatcat:seoep5hngrblpc5wxkplnqzvru
2013 pre-print
arXiv:1308.3301v3 fatcat:lgvfppuznncbjdxkcrf7out7cm
2019 pre-print
arXiv:1308.3301v10 fatcat:gqtrbyil6je5bhisxthzbeft5u
2013 pre-print
arXiv:1308.3301v4 fatcat:5oa6cdrebfccxmtracoa3sy7aq
2014 pre-print
arXiv:1308.3301v8 fatcat:uhrrgpahgrbu5codvex3uo4ixy
2013 pre-print
arXiv:1308.3301v7 fatcat:53bd3t43yngalmb46z4czjbd4a
Let L_>λ(𝒜) and L_≥λ(𝒜) be the languages recognized by measure many 1-way quantum finite automata (MMQFA) (or,enhanced 1-way quantum finite automata(EQFA)) 𝒜 with strict, resp. non-strict cut-point λ. We consider the languages equivalence problem, showing that * both strict and non-strict languages equivalence are undecidable; * to do this, we provide an additional proof of the undecidability of non-strict and strict emptiness of MMQFA(EQFA), and then reducing the languages equivalence problem
more » ... o emptiness problem; * Finally, some other Propositions derived from the above results are collected.
arXiv:1308.3301v11 fatcat:ybm6yonqojftxhos6qopwnh2li
Open Access Multiple Versions
Citation

Tianrong Lin. "Undecidability of L(𝒜)=L(ℬ) recognized by measure many 1-way quantum automata." arXiv (2021)