10 citations · 22 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.FL2015★ 10 cited
An Automata Theoretic Approach to the Zero-One Law for Regular Languages: Algorithmic and Logical Aspects
Ryoma Sin'ya
A zero-one language L is a regular language whose asymptotic probability converges to either zero or one. In this case, we say that L obeys the zero-one law. We prove that a regula…
cs.FL2015
Zero-One Law for Regular Languages and Semigroups with Zero
Ryoma Sin'ya
A regular language has the zero-one law if its asymptotic density converges to either zero or one. We prove that the class of all zero-one languages is closed under Boolean operati…