This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
2.4 Bibliographic Notes
J. E. Hopcroft, R. Motwani, and J. D. Ullman. Introduction to Automata Theory, Languages and Computability. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2000.
Christos H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
P. Weil. Algebraic recognizability of languages. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), Prague, Czech Republic, volume 3153 of Lecture Notes in Computer Science, pages 149–175. Springer, 2004.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Preliminaries. In: Formal Models of Communicating Systems. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32923-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-32923-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32922-0
Online ISBN: 978-3-540-32923-7
eBook Packages: Computer ScienceComputer Science (R0)