Keywords
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.
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.
3.7 Bibliographic Notes
H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. second edition. Springer, 1994.
E. Grädel, W. Thomas, and T. Wilke, editors. Automata, logics, and infinite games, volume 2500 of Lecture Notes in Computer Science. Springer, 2002.
L. Libkin. Elements of Finite Model Theory. Springer, Berlin, 2004.
W. Thomas. On Logics, Tilings, and Automata. In Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP 1991), Madrid, Spain, volume 510 of Lecture Notes in Computer Science. Springer, 1991.
W. Thomas. Elements of an automata theory over partial orders. In Proceedings of Workshop on Partial Order Methods in Verification (POMIV 1996), volume 29 of DIMACS. AMS, 1996.
W. Thomas. Automata theory on trees and partial orders. In Proceedings of TAPSOFT 1997: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, volume 1214 of Lecture Notes in Computer Science, pages 20–38. Springer, 1997.
W. Thomas. Languages, automata and logic. In A. Salomaa and G. Rozenberg, editors, Handbook of Formal Languages, volume 3, Beyond Words, pages 389–455. Springer, Berlin, 1997.
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2006). Graphs, Logics, and Graph Acceptors. In: Formal Models of Communicating Systems. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32923-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-32923-4_3
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)