GALINAJIRÁSKOVÁ Mathematical Institute, Slovak Academy of Sciences Grešákova 6, 040 01 Košice, Slovakia
TOMÁŠMASOPUST CWI, P.O. Box 94079, 1090 GB Amsterdam, The NetherlandsMathematical Institute, Czech Academy of Sciences, Žižkova 22, 616 62 Brno, Czech Republic
Abstract
Cite
JIRÁSKOVÁ, GALINA, and TOMÁŠ MASOPUST. “COMPLEXITY IN UNION-FREE REGULAR LANGUAGES”. International Journal of Foundations of Computer Science, vol. 22, no. 07, 2011, pp. 1639-53, https://doi.org/10.1142/s0129054111008933.
JIRÁSKOVÁ, G., & MASOPUST, T. (2011). COMPLEXITY IN UNION-FREE REGULAR LANGUAGES. International Journal of Foundations of Computer Science, 22(07), 1639-1653. https://doi.org/10.1142/s0129054111008933
JIRÁSKOVÁ G, MASOPUST T. COMPLEXITY IN UNION-FREE REGULAR LANGUAGES. International Journal of Foundations of Computer Science. 2011;22(07):1639-53.