{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:59:22Z","timestamp":1725796762590},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319097039"},{"type":"electronic","value":"9783319097046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09704-6_17","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T09:43:21Z","timestamp":1405071801000},"page":"186-197","source":"Crossref","is-referenced-by-count":8,"title":["Small Universal Non-deterministic Petri Nets with Inhibitor Arcs"],"prefix":"10.1007","author":[{"given":"Sergiu","family":"Ivanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisabeth","family":"Pelz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"17","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1581","DOI":"10.1016\/j.tcs.2010.10.033","volume":"412","author":"A. Alhazov","year":"2011","unstructured":"Alhazov, A., Verlan, S.: Minimization strategies for maximally parallel multiset rewriting systems. Theoretical Computer Science\u00a0412(17), 1581\u20131591 (2011)","journal-title":"Theoretical Computer Science"},{"key":"17_CR2","first-page":"42","volume":"1","author":"I.M. Barzdin","year":"1963","unstructured":"Barzdin, I.M.: Ob odnom klasse machin Turinga (machiny Minskogo), russian. Algebra i Logika\u00a01, 42\u201351 (1963)","journal-title":"Algebra i Logika"},{"key":"17_CR3","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: AMPL: A Modeling Language for Mathematical Programming, 2nd edn. Duxbury Press, Brooks\/Cole Publishing Company (2002)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Ivanov, S., Pelz, E., Verlan, S.: Small universal Petri nets with inhibitor arcs. In: Computability in Europe (2014)","DOI":"10.1007\/978-3-319-09704-6_17"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(98)00117-0","volume":"210","author":"P. Koiran","year":"1999","unstructured":"Koiran, P., Moore, C.: Closed-form analytic maps in one and two dimensions can simulate universal turing machines. Theor. Comput. Sci.\u00a0210(1), 217\u2013223 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0304-3975(96)00080-1","volume":"168","author":"I. Korec","year":"1996","unstructured":"Korec, I.: Small universal register machines. Theoretical Computer Science\u00a0168(2), 267\u2013301 (1996)","journal-title":"Theoretical Computer Science"},{"key":"17_CR7","volume-title":"Algorithms and Recursive Functions","author":"A.I. Malcev","year":"1970","unstructured":"Malcev, A.I.: Algorithms and Recursive Functions. Wolters-Noordhoff Pub. Co., Groningen (1970)"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(99)00102-4","volume":"231","author":"M. Margenstern","year":"2000","unstructured":"Margenstern, M.: Frontier between decidability and undecidability: A survey. Theoretical Computer Science\u00a0231(2), 217\u2013251 (2000)","journal-title":"Theoretical Computer Science"},{"key":"17_CR9","unstructured":"Margenstern, M.: An algorithm for buiding inrinsically universal automata in hyperbolic spaces. In: Arabnia, H.R., Murgin, M. (eds.) FCS, pp. 3\u20139. CSREA Press (2006)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Minsky, M.: Size and structure of universal Turing machines using tag systems. In: Recursive Function Theory: Proceedings, Symposium in Pure Mathematics, Provelence, vol.\u00a05, pp. 229\u2013238 (1962)","DOI":"10.1090\/pspum\/005\/0142452"},{"key":"17_CR11","volume-title":"Computations: Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computations: Finite and Infinite Machines. Prentice Hall, Englewood Cliffts (1967)"},{"key":"17_CR12","unstructured":"Gurobi Optimization, Inc. Gurobi optimizer reference manual (2014)"},{"key":"17_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56196-2","volume-title":"Membrane Computing. An Introduction","author":"G. P\u0103un","year":"2002","unstructured":"P\u0103un, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BFb0039620","volume-title":"STACS 87","author":"E. Pelz","year":"1987","unstructured":"Pelz, E.: Closure properties of deterministic Petri nets. In: Brandenburg, F.J., Wirsing, M., Vidal-Naquet, G. (eds.) STACS 1987. LNCS, vol.\u00a0247, pp. 371\u2013382. Springer, Heidelberg (1987)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages, vol.\u00a01\u20133. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6"},{"key":"17_CR16","unstructured":"Schroeppel, R.: A two counter machine cannot calculate 2N. In: AI Memos. MIT AI Lab (1972)"},{"issue":"2","key":"17_CR17","first-page":"230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society\u00a042(2), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"4-5","key":"17_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.tcs.2008.09.051","volume":"410","author":"D. Woods","year":"2009","unstructured":"Woods, D., Neary, T.: The complexity of small universal Turing machines: A survey. Theor. Comput. Sci.\u00a0410(4-5), 443\u2013450 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"17_CR19","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s10559-012-9429-4","volume":"48","author":"D.A. Zaitsev","year":"2012","unstructured":"Zaitsev, D.A.: Universal Petri net. Cybernetics and Systems Analysis\u00a048(4), 498\u2013511 (2012)","journal-title":"Cybernetics and Systems Analysis"},{"key":"#cr-split#-17_CR20.1","doi-asserted-by":"crossref","unstructured":"Zaitsev, D.A.: A small universal Petri net. EPTCS\u00a0128, 190-202 (2013)","DOI":"10.4204\/EPTCS.128.22"},{"key":"#cr-split#-17_CR20.2","unstructured":"In Proceedings of Machines, Computations and Universality (MCU 2013), arXiv:1309.1043"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09704-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T09:06:10Z","timestamp":1558947970000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09704-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319097039","9783319097046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09704-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}