Nissim Francez, Michael Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets. Theoretical Computer Science, 306(1-3):155-175, 2003. [doi]
@article{FrancezK03,
title = {An algebraic characterization of deterministic regular languages over infinite alphabets},
author = {Nissim Francez and Michael Kaminski},
year = {2003},
doi = {10.1016/S0304-3975(03)00246-9},
url = {http://dx.doi.org/10.1016/S0304-3975(03)00246-9},
tags = { algebra},
researchr = {https://researchr.org/publication/FrancezK03},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {306},
number = {1-3},
pages = {155-175},
}