1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Abuzer Yakaryilmaz, A. C. Cem Say
We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-w…