Advertisement

A Characterisation of Languages on Infinite Alphabets with Nominal Regular Expressions

  • Alexander Kurz
  • Tomoyuki Suzuki
  • Emilio Tuosto
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7604)

Abstract

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.

Keywords

Regular Expression Derivation Tree Tree Automaton Deterministic Automaton Permutation Action 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Alur, R., Madhusudan, P.: Adding nesting structure to words. J. ACM 56(3) (2009)Google Scholar
  2. 2.
    Bartoletti, M., Degano, P., Ferrari, G.L., Zunino, R.: Hard life with weak binders. Electr. Notes Theor. Comput. Sci. 242(1), 49–72 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bojanczyk, M.: Data monoids. In: STACS, pp. 105–116 (2011)Google Scholar
  4. 4.
    Bojanczyk, M., Klin, B., Lasota, S.: Automata with group actions. In: IEEE Symposium on Logic in Computer Science, pp. 355–364 (2011)Google Scholar
  5. 5.
    Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. Inf. Comput. 182(2), 137–162 (2003)zbMATHCrossRefGoogle Scholar
  6. 6.
    Ciancia, V., Tuosto, E.: A novel class of automata for languages on infinite alphabets. Technical Report CS-09-003, Leicester (2009)Google Scholar
  7. 7.
    Ciancia, V., Venema, Y.: Stream automata are coalgebras. In: 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012 (2012)Google Scholar
  8. 8.
    Gabbay, M.J., Ciancia, V.: Freshness and Name-Restriction in Sets of Traces with Names. In: Hofmann, M. (ed.) FOSSACS 2011. LNCS, vol. 6604, pp. 365–380. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Gabbay, M., Pitts, A.: A new approach to abstract syntax involving binders. In: Symbolic on Logics in Comput Science, pp. 214–224 (1999)Google Scholar
  10. 10.
    Kaminski, M., Tan, T.: Regular expressions for languages over infinite alphabets. Fundam. Inform. 69(3), 301–318 (2006)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Kaminski, N., Francez, M.: Finite-memory automata. TCS 134(2), 329–363 (1994)MathSciNetzbMATHCrossRefGoogle Scholar
  12. 12.
    Kozen, D.: On Hoare logic and Kleene algebra with tests. ACM Trans. Comput. Log. 1(1), 60–76 (2000)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kurz, A., Suzuki, T., Tuosto, E.: On Nominal Regular Languages with Binders. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol. 7213, pp. 255–269. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  14. 14.
    Montanari, U., Pistore, M.: π-Calculus, Structured Coalgebras and Minimal HD-Automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 569–578. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. 15.
    Myers, R.: Rational Coalgebraic Machines in Varieties: Languages, Completeness and Automatic Proofs. PhD thesis, Imperial College London (2011)Google Scholar
  16. 16.
    Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5(3), 403–435 (2004)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Pistore, M.: History Dependent Automata. PhD thesis, Dipartimento di Informatica, Università di Pisa (1999)Google Scholar
  18. 18.
    Pouillard, N., Pottier, F.: A fresh look at programming with names and binders. In: Proceeding of the 15th ACM SIGPLAN International Conference on Functional Programming, pp. 217–228 (2010)Google Scholar
  19. 19.
    Segoufin, L.: Automata and Logics for Words and Trees over an Infinite Alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41–57. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  20. 20.
    Shinwell, M., Pitts, A., Gabbay, M.: Freshml: programming with binders made simple. In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, pp. 263–274 (2003)Google Scholar
  21. 21.
    Stirling, C.: Dependency Tree Automata. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 92–106. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  22. 22.
    Tzevelekos, N.: Fresh-Register Automata. In: Symposium on Principles of Programming Languages, pp. 295–306. ACM (2011)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2012

Authors and Affiliations

  • Alexander Kurz
    • 1
  • Tomoyuki Suzuki
    • 1
  • Emilio Tuosto
    • 1
  1. 1.Department of Computer ScienceUniversity of LeicesterUK

Personalised recommendations