Неизвестный автор (2018)
© 2017, Springer Science+Business Media, LLC, part of Springer Nature. We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. ...