A Relation Between Unambiguous Regular Expressions and Abstract Data Types

Authors:
Viorel Preoteasa
Affiliations:
(Correspd. email: viorel.preoteasa@abo.fi) Department of Computer Science, Academy of Economic Studies, Bucharest, Romania
Venue:
Fundamenta Informaticae
Year:
1999

Citing 7
Cited 0

Introduction to higher order categorical logic

Introduction to higher order categorical logic
Categories, types, and structures: an introduction to category theory for the working computer scientist

Categories, types, and structures: an introduction to category theory for the working computer scientist
A completeness theorem for Kleene algebras and the algebra of regular events

Papers presented at the IEEE symposium on Logic in computer science
Category theory for computing science, 2nd ed.

Category theory for computing science, 2nd ed.
A Unified Approach to Path Problems

Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Categorical Fixed Point Calculus

CTCS '95 Proceedings of the 6th International Conference on Category Theory and Computer Science

Quantified Score

Hi-index	0.00

Visualization

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