On the computation of quotients and factors of regular languages
by
Mircea Marin
,
Temur Kutsia
| Venue: | In Proceedings of The Sixth Asian Workshop on Foundations of Software (AWFS 2009 |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Marin_onthe,
author = {Mircea Marin and Temur Kutsia},
title = {On the computation of quotients and factors of regular languages},
booktitle = {In Proceedings of The Sixth Asian Workshop on Foundations of Software (AWFS 2009},
year = {},
pages = {6--8}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Quotients and factors of regular languages are important notions in the design of computational procedures in the algebra of regular expressions and the analysis of their logical properties. We present algorithms for the computation of quotients and factors of languages specified by regular expressions. 1
Citations
| 238 | Introduction to Automata Theory - Hopcroft, Ullman - 1979 |
| 211 | Transductions and Context-Free Languages - Berstel - 1979 |
| 173 | Derivatives of regular expressions - Brzozowski - 1964 |
| 49 | Partial derivatives of regular expressions and finite automaton constructions - Antimirov - 1996 |
| 5 | Automata and computability. Undergraduate Texts in Computer Science - Kozen - 1997 |
| 4 | Regular Algebra and Finite Machines. Mathematics series - Conway - 1971 |
| 4 | Factorizations of languages and commutativity conditions - Mateescu, Salomaa, et al. |
| 2 | Product derivatives of regular expressions - Suzuki, Okui - 2008 |
