{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:47:00Z","timestamp":1725518820231},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877295"},{"type":"electronic","value":"9783540877301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87730-1_18","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T22:45:47Z","timestamp":1221950747000},"page":"172-187","source":"Crossref","is-referenced-by-count":7,"title":["Spider Diagrams of Order and a Hierarchy of Star-Free Regular Languages"],"prefix":"10.1007","author":[{"given":"Aidan","family":"Delaney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Taylor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Thompson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"Barwise, J., Etchemendy, J.: Hyperproof. CSLI Press (1994)","key":"18_CR1"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.: Weak second order arithmetic and finite automata. Z. Math. Logik und Grundl. Math.\u00a06, 66\u201392 (1960)","journal-title":"Z. Math. Logik und Grundl. Math."},{"doi-asserted-by":"crossref","unstructured":"Chomsky, N.: Three models for the description of language. IRE Transactions on Information Theory, 113\u2013124 (1956)","key":"18_CR3","DOI":"10.1109\/TIT.1956.1056813"},{"unstructured":"Delaney, A., Stapleton, G.: On the descriptional complexity of a diagrammatic notation. In: Visual Languages and Computing (September 2007)","key":"18_CR4"},{"unstructured":"Delaney, A., Stapleton, G.: Spider diagrams of order. In: International Workshop on Visual Languages and Logic (September 2007)","key":"18_CR5"},{"key":"18_CR6","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1991","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1991)","edition":"2"},{"unstructured":"Euler, L.: Lettres a une princesse dallemagne sur divers sujets de physique et de philosophie. Letters??2, 102???108 (1775);","key":"#cr-split#-18_CR7.1"},{"unstructured":"Berne, Socit Typographique","key":"#cr-split#-18_CR7.2"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/VL.1999.795884","volume-title":"Proceedings of IEEE Symposium on Visual Languages, Tokyo","author":"J. Gil","year":"1999","unstructured":"Gil, J., Howse, J., Kent, S.: Formalising spider diagrams. In: Proceedings of IEEE Symposium on Visual Languages, Tokyo, September 1999, pp. 130\u2013137. IEEE Computer Society Press, Los Alamitos (1999)"},{"unstructured":"Hammer, E.: Logic and Visual Information. CSLI Publications (1995)","key":"18_CR9"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1051\/ita:2003002","volume":"36","author":"P.-C. H\u00e9am","year":"2002","unstructured":"H\u00e9am, P.-C.: On shuffle ideals. Theoretical Informatics and Applications\u00a036, 359\u2013384 (2002)","journal-title":"Theoretical Informatics and Applications"},{"key":"18_CR11","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing, Reading (1979)"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1112\/S1461157000000942","volume":"8","author":"J. Howse","year":"2005","unstructured":"Howse, J., Stapleton, G., Taylor, J.: Spider diagrams. LMS Journal of Computation and Mathematics\u00a08, 145\u2013194 (2005)","journal-title":"LMS Journal of Computation and Mathematics"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1145\/263698.263756","volume-title":"Proceedings of OOPSLA 1997","author":"S. Kent","year":"1997","unstructured":"Kent, S.: Constraint diagrams: Visualizing invariants in object oriented modelling. In: Proceedings of OOPSLA 1997, October 1997, pp. 327\u2013341. ACM Press, New York (1997)"},{"key":"18_CR14","first-page":"679","volume-title":"Syntactic semigroups","author":"J.-E. Pin","year":"1997","unstructured":"Pin, J.-E.: Syntactic semigroups, pp. 679\u2013746. Springer-Verlag, New York (1997)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0890-5401(92)90063-L","volume":"101","author":"J.-E. Pin","year":"1992","unstructured":"Pin, J.-E., Straubing, H., Th\u00e9rien, D.: Some results on the generalized star-height problem. Information and Computation\u00a0101, 219\u2013250 (1992)","journal-title":"Information and Computation"},{"key":"18_CR16","volume-title":"The Logical Status of Diagrams","author":"S.-J. Shin","year":"1994","unstructured":"Shin, S.-J.: The Logical Status of Diagrams. Cambridge University Press, Cambridge (1994)"},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1093\/logcom\/14.6.857","volume":"14","author":"G. Stapleton","year":"2004","unstructured":"Stapleton, G., Thompson, S., Howse, J., Taylor, J.: The expressiveness of spider diagrams. Journal of Logic and Computation\u00a014(6), 857\u2013880 (2004)","journal-title":"Journal of Logic and Computation"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(85)90003-9","volume":"35","author":"J. Stern","year":"1985","unstructured":"Stern, J.: Characterizations of some classes of regular events. Theoretical Computer Science\u00a035, 17\u201342 (1985)","journal-title":"Theoretical Computer Science"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences\u00a025, 360\u2013376 (1982)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Venn, J.: On the diagrammatic and mechanical representation of propositions and reasonings. Phil. Mag. (1880)","key":"18_CR20","DOI":"10.1080\/14786448008626877"}],"container-title":["Lecture Notes in Computer Science","Diagrammatic Representation and Inference"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87730-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:45:37Z","timestamp":1619509537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87730-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540877295","9783540877301"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87730-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}