An algebraic characterization of deterministic regular languages over infinite alphabets.

DOI10.1016/S0304-3975(03)00246-9zbMath1059.68059MaRDI QIDQ1426447

Nissim Francez, Michael Kaminski

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (5)

Nominal Kleene Coalgebra ⋮ Nominal monoids ⋮ A succinct canonical register automaton model ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ A Myhill-Nerode theorem for register automata and symbolic trace languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of regular and context-free languages over countably infinite alphabets
• Langages sur des alphabets infinis
• Formes de langages et de grammaires
• Finite-memory automata
• Finite-state unification automata and relational languages
• Context-free languages over infinite alphabets
• Intractability of decision problems for finite-memory automata

This page was built for publication: An algebraic characterization of deterministic regular languages over infinite alphabets.