{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:26Z","timestamp":1759638026476},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319628080"},{"type":"electronic","value":"9783319628097"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_6","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"96-108","source":"Crossref","is-referenced-by-count":8,"title":["Operational State Complexity and Decidability of Jumping Finite Automata"],"prefix":"10.1007","author":[{"given":"Simon","family":"Beier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Holzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutrib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"key":"6_CR1","volume-title":"Modern Information Retrieval: The Concepts and Technology Behind Search","author":"R Baeza-Yates","year":"2011","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval: The Concepts and Technology Behind Search. Addison-Wesley, New York (2011)"},{"key":"6_CR2","unstructured":"Beier, S., Holzer, M., Kutrib, M.: On the descriptional complexity of operations on semilinear sets. IFIG Research Report 1701, Institut f\u00fcr Informatik, Universit\u00e4t Giessen (2017). http:\/\/www.informatik.uni-giessen.de\/reports\/Report1701.pdf"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35, 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-319-22360-5_8","volume-title":"Implementation and Application of Automata","author":"H Fernau","year":"2015","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L.: Jumping finite automata: characterizations and complexity. In: Drewes, F. (ed.) CIAA 2015. LNCS, vol. 9223, pp. 89\u2013101. Springer, Cham (2015). doi: 10.1007\/978-3-319-22360-5_8"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.tcs.2016.07.006","volume":"679","author":"H Fernau","year":"2017","unstructured":"Fernau, H., Paramasivan, M., Schmid, M.L., Vorel, V.: Characterization and complexity results on jumping finite automata. Theor. Comput. Sci. 679, 31\u201352 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR6","first-page":"333","volume":"113","author":"S Ginsburg","year":"1964","unstructured":"Ginsburg, S., Spanier, E.H.: Bounded ALGOL-like languages. Trans. AMS 113, 333\u2013368 (1964)","journal-title":"Trans. AMS"},{"key":"6_CR7","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(84)90092-6","volume":"33","author":"DT Huynh","year":"1984","unstructured":"Huynh, D.T.: Deciding the inequivalence of context-free grammars with 1-letter terminal alphabet is $$\\Sigma _2^{p}$$ -complete. Theor. Comput. Sci. 33, 305\u2013326 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0019-9958(85)80015-2","volume":"66","author":"DT Huynh","year":"1985","unstructured":"Huynh, D.T.: The complexity of equivalence problems for commutative grammars. Inf. Control 66, 103\u2013121 (1985)","journal-title":"Inf. Control"},{"key":"6_CR10","first-page":"147","volume":"22","author":"DT Huynh","year":"1986","unstructured":"Huynh, D.T.: A simple proof for the $$\\Sigma _2^P$$ upper bound of the inequivalence problem for semilinear sets. Elektr. Informationsverarb. Kybernet. 22, 147\u2013156 (1986)","journal-title":"Elektr. Informationsverarb. Kybernet."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-10003-2_81","volume-title":"Automata, Languages and Programming","author":"T-D Huynh","year":"1980","unstructured":"Huynh, T.-D.: The complexity of semilinear sets. In: Bakker, J., Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 324\u2013337. Springer, Heidelberg (1980). doi: 10.1007\/3-540-10003-2_81"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Kopczy\u0144ki, E., To, A.W.: Parikh images of grammar: Complexity and applications. In: Joiannaud, J.P. (ed.) Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, pp. 80\u201389. IEEE (2010)","DOI":"10.1109\/LICS.2010.21"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Kopczy\u0144ski, E.: Complexity of problems of commutative grammars. Log. Methods Comput. Sci. 11(1) (2015). Paper 9","DOI":"10.2168\/LMCS-11(1:9)2015"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ic.2013.06.003","volume":"228\u2013229","author":"GJ Lavado","year":"2013","unstructured":"Lavado, G.J., Pighizzini, G., Seki, S.: Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inf. Comput. 228\u2013229, 1\u201315 (2013)","journal-title":"Inf. Comput."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-319-09704-6_26","volume-title":"Descriptional Complexity of Formal Systems","author":"GJ Lavado","year":"2014","unstructured":"Lavado, G.J., Pighizzini, G., Seki, S.: Operational state complexity under parikh equivalence. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 294\u2013305. Springer, Cham (2014). doi: 10.1007\/978-3-319-09704-6_26"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"1555","DOI":"10.1142\/S0129054112500244","volume":"23","author":"A Meduna","year":"2012","unstructured":"Meduna, A., Zemek, P.: Jumping finite automata. Int. J. Found. Comput. Sci. 23, 1555\u20131578 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR17","unstructured":"To, A.W.: Parikh images of regular languages: complexity and applications (2010). http:\/\/arxiv.org\/abs\/1002.1464v2"},{"key":"6_CR18","unstructured":"Vorel, V.: On basic properties of jumping finite automata (2015). http:\/\/arxiv.org\/abs\/1511.08396v2"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-41114-9_16","volume-title":"Descriptional Complexity of Formal Systems","author":"V Vorel","year":"2016","unstructured":"Vorel, V.: Two results on discontinuous input processing. In: C\u00e2mpeanu, C., Manea, F., Shallit, J. (eds.) DCFS 2016. LNCS, vol. 9777, pp. 205\u2013216. Springer, Cham (2016). doi: 10.1007\/978-3-319-41114-9_16"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T03:04:49Z","timestamp":1569899089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}