@article{
    jPreoteasa99a,
    author = "Preoteasa, Viorel",
    publisher = "{IOS} Press",
    title = "A Relation Between Unambiguous Regulat Expressions and Abstract Data Types",
    journal = "Fundamenta Informaticae",
    number = "1",
    abstract = "Using a categorical model of abstract data types, we show, following Kozen's technique [D. C. Kozen, Inform. and Comput. 110 (1994), no. 2, 366--390] and Tarjan's constructions for a deterministic automaton [R. E. Tarjan, J. Assoc. Comput. Mach. 28 (1981), no. 3, 577--593], that if two unambiguous regular expressions define the same regular language, then they represent two isomorphic abstract data types.",
    month = "Oct",
    volume = "40",
    flags = "copy",
    year = "1999",
    keywords = "abstract data types, categorical model, unambiguous regular expressions, finite automata",
    pdf = "jPreoteasa99a.pdf",
    pages = "53-77"
}