A Relation Between Unambiguous Regular Expressions and Data Types (1999)
by
Viorel Preoteasa
| Citations: | 1 - 0 self |
BibTeX
@MISC{Preoteasa99arelation,
author = {Viorel Preoteasa},
title = {A Relation Between Unambiguous Regular Expressions and Data Types},
year = {1999}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Using a categorical model of abstract data types [2, 3, 13, 15], we show, following the Kozen's technique [10] and Tarjan's constructions for a deterministic automaton [16], that if two unambiguous regular expressions dene the same regular language, then they represent two isomorphic abstract data types. 1
