Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Nissim Francez, Michael Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets. Theoretical Computer Science, 306(1-3):155-175, 2003. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Regular Expressions for Languages over Infinite AlphabetsMichael Kaminski, Tony Tan. FUIN, 69(3):301-318, 2006. [doi] Regular Expressions for Languages over Infinite AlphabetsMichael Kaminski, Tony Tan. cocoon 2004: 171-178 [doi] Context-Free Languages over Infinite AlphabetsEdward Y. C. Cheng, Michael Kaminski. ACTA, 35(3):245-267, 1998. [doi] Closure Under Reversal of Languages over Infinite AlphabetsDaniel Genkin, Michael Kaminski, Liat Peterfreund. csr 2018: 145-156 [doi]
The following publications are possibly variants of this publication: