A relation between unambiguous regular expressions and abstract data types

• Autorzy: Preoteasa V.
• Języki publikacji: EN

Abstrakty

EN

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 define the same regular language, then they represent two isomorphic abstract data types.

Słowa kluczowe

EN

abstract data types; categorical model; unambiguous regular expressions; finite automata

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 1999
• Tom: Vol. 40, Nr 1
• Strony: 53--77
• Opis fizyczny: bibliogr. 16 poz.

Twórcy

autor

Preoteasa V.

• Turku Centre for Computer Science Data City, Lemminkäisenkatu 14A, FIN-20520 Turku, Finland