An algebraic characterization of deterministic regular languages over infinite alphabets

Nissim Francez, Michael Kaminski. An algebraic characterization of deterministic regular languages over infinite alphabets. Theoretical Computer Science, 306(1-3):155-175, 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.