An algebraic characterization of deterministic regular languages over infinite alphabets

We state and prove an infinite alphabet counterpart of the classical Myhill–Nerode theorem.

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2003-09, Vol.306 (1-3), p.155-175
Main Authors: Francez, Nissim, Kaminski, Michael
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Computer science
control theory
systems
Exact sciences and technology
Language theory and syntactical analysis
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We state and prove an infinite alphabet counterpart of the classical Myhill–Nerode theorem.
ISSN:0304-3975
1879-2294
DOI:10.1016/S0304-3975(03)00246-9