Unary probabilistic and quantum automata on promise problems on
unary languages. We show that bounded-error
unary QFAs are more powerful than bounded-error
unary PFAs
Unary probabilistic and quantum automata on promise problems of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on
unary languages. We
Unary probabilistic and quantum automata on promise problems of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on
unary languages. We
Affine Automata Verifiers-Merlin (AM) proof systems. We show that every
unary language is verified by a real-valued AfA verifier. Then
Degree Spectra for Transcendence in Fields© 2019, Springer Nature Switzerland AG. We show that for both the
unary relation of transcendence
Esoteric programming languages as a state-of-the-art semiotic trendThe article gives an overview of esoteric programming
languages features dwelling upon LOLCODE
Minimal Algebras of Unary MultioperationsPeryazev, Nikolay A.,
Peryazeva, Yulia V.,
Sharankhaev, Ivan K.,
Перязев, Николай А.,
Перязева, Юлия В.,
Шаранхаев, Иван К. A matrix impression of algebras of
unary multioperations of a finite rank and the list