Unambiguous finite automata over a unary alphabet

Alexander Okhotin. Unambiguous finite automata over a unary alphabet. Inf. Comput., 212:15-36, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.