Calculating with Automata

  • Jos C. M. Baeten
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5065)


Some elements are presented of a forthcoming textbook on automata theory and formal languages, that puts more emphasis on equational reasoning. Some advantages of such an approach are discussed. This paper is dedicated to Ugo Montanari, who has contributed such a lot to concurrency theory and the theory of computational models.


Formal Language Regular Expression Regular Language Sequential Composition Operational Rule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aceto, L., Fokkink, W.J., Verhoef, C.: Structural operational semantics. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 197–292. North-Holland, Amsterdam (2001)CrossRefGoogle Scholar
  2. 2.
    Baeten, J.C.M., Bergstra, J.A., Klop, J.W.: On the consistency of Koomen’s fair abstraction rule. Theoretical Computer Science 51, 129–176 (1987)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Baeten, J.C.M., Corradini, F., Grabmayer, C.A.: A characterization of regular expressions under bisimulation. Journal of the ACM 54(2), 6.1–28 (2007)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Baeten, J.C.M., Weijland, W.P.: Process Algebra. In: Number 18 in Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge (1990)Google Scholar
  5. 5.
    Brzozowski, J.A.: Derivatives of regular expressions. Journal of the ACM 11(4), 481–494 (1964)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall, Boca Raton (1971)zbMATHGoogle Scholar
  7. 7.
    Ginzburg, A.: Algebraic Theory of Automata. Academic Press, London (1968)zbMATHGoogle Scholar
  8. 8.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  9. 9.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Pearson, London (2006)Google Scholar
  10. 10.
    Linz, P.: An Introduction to Formal Languages and Automata. Jones and Bartlett (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jos C. M. Baeten
    • 1
  1. 1.Division of Computer ScienceTechnische Universiteit Eindhoven 

Personalised recommendations