id: 06085040
dt: a
an: 06085040
au: Jirásková, Galina; Nagy, Benedek
ti: On union-free and deterministic union-free languages.
so: Baeten, Jos C. M. (ed.) et al., Theoretical computer science. 7th IFIP TC
    1/WG 2.2 international conference, TCS 2012, Amsterdam, The
    Netherlands, September 26‒28, 2012. Proceedings. Berlin: Springer
    (ISBN 978-3-642-33474-0/pbk). Lecture Notes in Computer Science 7604,
    179-192 (2012).
py: 2012
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-642-33475-7_13
ab: Summary: The paper continues the study of union-free and deterministic
    union-free languages. In contrast with the fact that every regular
    language can be described as a finite union of union-free languages, we
    show that the finite unions of deterministic union-free languages
    define a proper subfamily of regular languages. Then we examine the
    properties of this subfamily.
rv: