Theoretical Computer Science
On Hoare logic and Kleene algebra with tests
ACM Transactions on Computational Logic (TOCL)
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
An algebraic approach to data languages and timed languages
Information and Computation
A New Approach to Abstract Syntax Involving Binders
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
FreshML: programming with binders made simple
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Finite state machines for strings over infinite alphabets
ACM Transactions on Computational Logic (TOCL)
Adding nesting structure to words
Journal of the ACM (JACM)
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Electronic Notes in Theoretical Computer Science (ENTCS)
A fresh look at programming with names and binders
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Freshness and name-restriction in sets of traces with names
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
LICS '11 Proceedings of the 2011 IEEE 26th Annual Symposium on Logic in Computer Science
Automata and logics for words and trees over an infinite alphabet
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Regular Expressions for Languages over Infinite Alphabets
Fundamenta Informaticae
| Hi-index | 0.00 |
We give a characterisation of languages on infinite alphabets in a variant of nominal regular expressions with permutations (p-NREs). We also introduce automata with fresh name generations and permutations (fp-automata), inspired by history-dependent automata (HDAs) and fresh-register automata. Noteworthy, permutations require to deal with dynamic context-dependent expressions. Finally, we give a Kleene theorem for p-NREs and fp-automata to formally characterise languages on infinite alphabets.