Theoretical Computer Science
Observable Properties of Higher Order Functions that Dynamically Create Local Names, or What's new?
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
pi-Calculus, Structured Coalgebras, and Minimal HD-Automata
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Notes on Nominal Calculi for Security and Mobility
FOSAD '00 Revised versions of lectures given during the IFIP WG 1.7 International School on Foundations of Security Analysis and Design on Foundations of Security Analysis and Design: Tutorial Lectures
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Trustworthy Global Computing
Planning and verifying service composition
Journal of Computer Security - 18th IEEE Computer Security Foundations Symposium (CSF 18)
Automata vs. logics on data words
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
An automaton over data words that captures EMSO logic
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
Variable automata over infinite alphabets
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
On nominal regular languages with binders
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Model checking languages of data words
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Nominal automata for resource usage control
CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
Two kinds of automata are introduced, for recognising regular and context-free nominal languages. We compare their expressive power with that of analogous proposals in the literature. Some properties of our languages are proved, in particular that emptiness of a context-free nominal language L is decidable, and that the intersection of L with a regular nominal language is still context-free. This paves the way for model-checking systems against access control properties in the nominal case, which is our main objective.