{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:43:13Z","timestamp":1725745393416},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_13","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"123-134","source":"Crossref","is-referenced-by-count":1,"title":["Logic and Branching Automata"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bedon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-32033-3_35","volume-title":"Term Rewriting and Applications","author":"A. Bouajjani","year":"2005","unstructured":"Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 484\u2013499. Springer, Heidelberg (2005)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. Richard B\u00fcchi","year":"1960","unstructured":"Richard B\u00fcchi, J.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik. Grund. Math.\u00a06, 66\u201392 (1960)","journal-title":"Zeit. Math. Logik. Grund. Math."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-44881-0_18","volume-title":"Rewriting Techniques and Applications","author":"S. Dal-Zilio","year":"2003","unstructured":"Dal-Zilio, S., Lugiez, D.: XML Schema, Tree Logic and Sheaves Automata. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 246\u2013263. Springer, Heidelberg (2003)"},{"key":"13_CR4","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite model theory, 2nd edn. Springer monographs in mathematics. Springer (1999)"},{"issue":"2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0021-8693(69)90070-2","volume":"13","author":"S. Eilenberg","year":"1969","unstructured":"Eilenberg, S., Sch\u00fctzenberger, M.-P.: Rational sets in commutative monoids. Journal of Algebra\u00a013(2), 173\u2013191 (1969)","journal-title":"Journal of Algebra"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-46011-X_18","volume-title":"Developments in Language Theory","author":"Z. \u00c9sik","year":"2002","unstructured":"\u00c9sik, Z., N\u00e9meth, Z.L.: Automata on series-parallel biposets. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol.\u00a02295, pp. 217\u2013227. Springer, Heidelberg (2002)"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pacific Journal of Mathematics\u00a016(2), 285\u2013296 (1966)","journal-title":"Pacific Journal of Mathematics"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1996-253409","volume":"25","author":"H.J. Hoogeboom","year":"1996","unstructured":"Hoogeboom, H.J., ten Pas, P.: Text languages in an algebraic framework. Fund. Inform.\u00a025, 353\u2013380 (1996)","journal-title":"Fund. Inform."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF02679464","volume":"30","author":"H.J. Hoogeboom","year":"1997","unstructured":"Hoogeboom, H.J., ten Pas, P.: Monadic second-order definable languages. Theory Comput. Syst.\u00a030, 335\u2013354 (1997)","journal-title":"Theory Comput. Syst."},{"key":"13_CR11","first-page":"3","volume-title":"Automata Studies","author":"S.C. Kleene","year":"1956","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, McCarthy (eds.) Automata Studies, pp. 3\u201342. Princeton University Press, Princeton (1956)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/3-540-45022-X_55","volume-title":"Automata, Languages and Programming","author":"D. Kuske","year":"2000","unstructured":"Kuske, D.: Infinite series-parallel posets: Logic and languages. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 648\u2013662. Springer, Heidelberg (2000)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-49382-2_33","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"K. Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: A Kleene iteration for parallelism. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.\u00a01530, pp. 355\u2013367. Springer, Heidelberg (1998)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BFb0028590","volume-title":"STACS 98","author":"K. Lodaya","year":"1998","unstructured":"Lodaya, K., Weil, P.: Series-parallel posets: algebra, automata and languages. In: Morvan, M., Meinel, C., Krob, D. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 555\u2013565. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(00)00031-1","volume":"237","author":"K. Lodaya","year":"2000","unstructured":"Lodaya, K., Weil, P.: Series-parallel languages and the bounded-width property. Theoret. Comput. Sci.\u00a0237(1-2), 347\u2013380 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/inco.2001.3077","volume":"171","author":"K. Lodaya","year":"2001","unstructured":"Lodaya, K., Weil, P.: Rationality in algebras with a series operation. Inform. Comput.\u00a0171, 269\u2013293 (2001)","journal-title":"Inform. Comput."},{"key":"13_CR17","first-page":"92","volume":"12","author":"M. Presburger","year":"1930","unstructured":"Presburger, M.: \u00dcber die vollstandigkeit eines gewissen systems der arithmetic ganzer zahlen, in welchem die addition als einzige operation hervortritt. In: Proc. Sprawozdaniez I Kongresu Matematykow Krajow Slowianskich, Warsaw, pp. 92\u2013101 (1930); English translation: On the completeness of certain system of arithmetic of whole numbers in which addition occurs as the only operation. Hist. Philos. Logic 12, 92\u2013101 (1991)","journal-title":"Hist. Philos. Logic"},{"key":"#cr-split#-13_CR18.1","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates. Vuibert (2003)"},{"key":"#cr-split#-13_CR18.2","unstructured":"English (and revised) version: Elements of automata theory. Cambridge University Press (2009)"},{"key":"13_CR19","unstructured":"Seidl, H., Schwentick, T., Muscholl, A.: Counting in trees. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata. Texts in Logic and Games, vol.\u00a02, pp. 575\u2013612. Amsterdam University Press (2008)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a0III, pp. 389\u2013455. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"13_CR21","first-page":"101","volume":"3","author":"B.A. Trakhtenbrot","year":"1962","unstructured":"Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Siberian Math.\u00a03, 101\u2013131 (1962) (Russian) English translation in AMS Transl. 59, 23\u201355 (1966)","journal-title":"Siberian Math."},{"key":"13_CR22","unstructured":"Valdes, J.: Parsing flowcharts and series-parallel graphs. Technical Report STAN-CS-78-682, Computer science departement of the Stanford University, Standford, Ca (1978)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput.\u00a011, 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,2]],"date-time":"2020-08-02T03:24:07Z","timestamp":1596338647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}