An algebraic characterization of deterministic regular languages over infinite alphabets.

DOI10.1016/S0304-3975(03)00246-9MaRDI QIDQ1426447zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1834677
• AN ALGEBRAIC THEORY FOR REGULAR LANGUAGES OF FINITE AND INFINITE WORDS
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Classes of regular and context-free languages over countably infinite alphabets
• Mathematical Foundations of Computer Science 2004
• On algebraic and logical specifications of classes of regular languages.
• On a subclass of \(\infty\)-regular languages
• Context-free languages over infinite alphabets
• On some structural properties of a subclass of \(\infty\)-regular languages
• Fixed-point characterization of context-free ∞-languages

Cites work

• scientific article; zbMATH DE number 3862472 (Why is no real title available?)
• scientific article; zbMATH DE number 2086669 (Why is no real title available?)
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• scientific article; zbMATH DE number 3310090 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Classes of regular and context-free languages over countably infinite alphabets
• Context-free languages over infinite alphabets
• Finite-memory automata
• Finite-state unification automata and relational languages
• Formes de langages et de grammaires
• Intractability of decision problems for finite-memory automata
• Langages sur des alphabets infinis

Cited in

(7)

• Nondeterministic and co-nondeterministic implies deterministic, for data languages
• A Myhill-Nerode theorem for register automata and symbolic trace languages
• A succinct canonical register automaton model
• A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions
• Nominal monoids
• Classes of regular and context-free languages over countably infinite alphabets
• Nominal Kleene coalgebra

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1426447)