{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:06:42Z","timestamp":1725746802352},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402128"},{"type":"electronic","value":"9783642402135"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40213-5_12","type":"book-chapter","created":{"date-parts":[[2013,8,29]],"date-time":"2013-08-29T09:26:23Z","timestamp":1377768383000},"page":"183-198","source":"Crossref","is-referenced-by-count":4,"title":["A New Representation of Two-Dimensional Patterns and Applications to Interactive Programming"],"prefix":"10.1007","author":[{"given":"I.T.","family":"Banu-Demergian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.I.","family":"Paduraru","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Stefanescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,8,30]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.: A theory of timed automata. Theoretical Computer Science 126, 183\u2013235 (1994)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49, 172\u2013206 (2002)","journal-title":"J. ACM"},{"key":"12_CR3","unstructured":"Banu-Demergian, I., Stefanescu, G.: On the contour representation of two-dimensional patterns (2013), draft"},{"key":"12_CR4","unstructured":"Banu-Demergian, I., Stefanescu, G.: Representation of scenarios in finite interactive systems (2013), draft, submitted"},{"key":"12_CR5","first-page":"109","volume":"60","author":"J Bergstra","year":"1994","unstructured":"Bergstra, J., Bethke, I., Ponse, A.: Process algebra with iteration. The Computer Journal 60, 109\u2013137 (1994)","journal-title":"The Computer Journal"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129500000104","volume":"3","author":"S Bloom","year":"1993","unstructured":"Bloom, S., Esik, Z.: Equational axioms for regular sets. Mathematical Structures in Computer Science 3, 1\u201324 (1993)","journal-title":"Mathematical Structures in Computer Science"},{"key":"12_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78034-9","volume-title":"Iteration Theories: The Equational Logic of Iterative Processes","author":"S Bloom","year":"1993","unstructured":"Bloom, S., Esik, Z.: Iteration Theories: The Equational Logic of Iterative Processes. Springer, Berlin (1993)"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Bonsangue, M., Rutten, J., Silva, A.: A Kleene theorem for polynomial coalgebras. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 122\u2013136. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-00596-1_10"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1990-13204","volume":"13","author":"V Cazanescu","year":"1990","unstructured":"Cazanescu, V., Stefanescu, G.: Towards a new algebraic foundation of flowchart scheme theory. Fundamenta Informaticae 13, 171\u2013210 (1990)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Cazanescu, V., Stefanescu, G.: Feedback, iteration and repetition. In: P\u0103un, G. (ed.) Mathematical Aspects of Natural and Formal Languages, pp. 43\u201362. World Scientific, Singapore (1995)","DOI":"10.1142\/9789814447133_0003"},{"key":"12_CR11","unstructured":"Conway, J.: Regular Algebra and Finite Machines. Chapman and Hall (1971)"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.entcs.2008.04.087","volume":"203","author":"C Dragoi","year":"2008","unstructured":"Dragoi, C., Stefanescu, G.: Agapia v0.1: A programming language for interactive systems and its typing system. Electronic Notes in Theoretical Computer Science 203(3), 69\u201394 (2008)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0304-3975(92)90339-H","volume":"96","author":"V Garg","year":"1992","unstructured":"Garg, V., Ragunath, M.: Concurrent regular expressions and their relationship to Petri nets. Theoretical Computer Science 96, 285\u2013304 (1992)","journal-title":"Theoretical Computer Science"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Handbook of Formal Languages, pp. 215\u2013267. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Goldin, D., Smolka, S., Wegner, P.: Interactive computation: The new paradigm. Springer (2006)","DOI":"10.1007\/3-540-34874-3"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Joyal, A., Street, R., Verity, D.: Traced monoidal categories. In. Proceedings of the Cambridge Philosophical Society, vol. 119 (1996)","DOI":"10.1017\/S0305004100074338"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies (34), 3 (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"12_CR18","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. In: LICS 1991, pp. 214\u2013225. IEEE (1991)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0304-3975(91)90395-I","volume":"89","author":"D Krob","year":"1991","unstructured":"Krob, D.: Complete systems of $$\\beta $$ \u03b2 -rational identities. Theoretical Computer Science 89, 207\u2013343 (1991)","journal-title":"Theoretical Computer Science"},{"key":"12_CR20","volume-title":"Semirings, automata and languages","author":"W Kuich","year":"1985","unstructured":"Kuich, W., Salomaa, A.: Semirings, automata and languages. Springer, Berlin (1985)"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/inco.1997.2659","volume":"138","author":"M Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Information and Computation 138(2), 160\u2013169 (1997)","journal-title":"Information and Computation"},{"issue":"5\u20136","key":"12_CR22","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1023\/A:1023027932419","volume":"91","author":"K Lindgren","year":"1998","unstructured":"Lindgren, K., Moore, C., Nordahl, M.: Complexity of two-dimensional patterns. Journal of Statistical Physics 91(5\u20136), 909\u2013951 (1998)","journal-title":"Journal of Statistical Physics"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(95)00082-8","volume":"160","author":"R Maddux","year":"1996","unstructured":"Maddux, R.: Relation-algebraic semantics. Theoretical Computer Science 160, 1\u201385 (1996)","journal-title":"Theoretical Computer Science"},{"key":"12_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4962-7","volume-title":"Algebraic approaches to program semantics","author":"E Manes","year":"1986","unstructured":"Manes, E., Arbib, M.: Algebraic approaches to program semantics. Springer, Berlin (1986)"},{"issue":"4","key":"12_CR25","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1145\/322154.322167","volume":"26","author":"R Milner","year":"1979","unstructured":"Milner, R.: Flowgraphs and flow algebras. Journal of the ACM (JACM) 26(4), 794\u2013818 (1979)","journal-title":"Journal of the ACM (JACM)"},{"key":"12_CR26","unstructured":"Milner, R.: Action calculi V : Reflexive molecular forms (1994), draft, Department of Computer Science, University of Edinburgh"},{"key":"12_CR27","unstructured":"Petri, C.: Kommunikation mit automaten. Ph.D. thesis, Instituts fur Instrumentelle Mathematik, Bonn, Germany"},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1145\/321312.321326","volume":"13","author":"A Salomaa","year":"1966","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. Journal of the ACM (JACM) 13(1), 158\u2013169 (1966)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"12_CR29","first-page":"265","volume":"12","author":"A. Sofronia","year":"2009","unstructured":"Sofronia, A., Popa, A., Stefanescu, G.: Undecidability results for finite interactive systems. Romanian Journal of Information Science and Technology 12(2), 265\u2013279 (2009), also: Arxiv, CoRR abs\/1001.0143 (2010)","journal-title":"Romanian Journal of Information Science and Technology"},{"key":"12_CR30","unstructured":"Stefanescu, G.: Feedback Theories (A Calculus for Isomorphism Classes of Flowchart Schemes). Preprint Series in Mathematics, vol. 24. INCREST (1986); also in: Revue Roumaine de Mathematiques Pures et Applique 35, 73\u201379 (1990)"},{"issue":"2","key":"12_CR31","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-0000(87)90011-0","volume":"35","author":"G Stefanescu","year":"1987","unstructured":"Stefanescu, G.: On flowchart theories: Part I. The deterministic case. Journal of Computer and System Sciences 35(2), 163\u2013191 (1987)","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"12_CR32","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0304-3975(87)90114-9","volume":"52","author":"G Stefanescu","year":"1987","unstructured":"Stefanescu, G.: On flowchart theories: Part II. The nondeterministic case. Theoretical Computer Science 52(3), 307\u2013340 (1987)","journal-title":"The nondeterministic case. Theoretical Computer Science"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"Stefanescu, G.: Network algebra. Springer (2000)","DOI":"10.1007\/978-1-4471-0479-7"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Stefanescu, G.: Algebra of networks: Modeling simple networks as well as complex interactive systems. In: Proof and System-Reliability, pp. 49\u201378. Springer (2002)","DOI":"10.1007\/978-94-010-0413-8_3"},{"issue":"1","key":"12_CR35","first-page":"285","volume":"73","author":"G Stefanescu","year":"2006","unstructured":"Stefanescu, G.: Interactive systems with registers and voices. Fundamenta Informaticae 73(1), 285\u2013305 (2006)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Software Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40213-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T02:50:42Z","timestamp":1646448642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40213-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402128","9783642402135"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40213-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}