{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:45:08Z","timestamp":1743036308831,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319948119"},{"type":"electronic","value":"9783319948126"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-94812-6_16","type":"book-chapter","created":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T22:12:26Z","timestamp":1530223946000},"page":"186-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Guillon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pighizzini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Prigioniero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"key":"16_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-44977-9_4","volume-title":"Implementation and Application of Automata","author":"M Anselmo","year":"2003","unstructured":"Anselmo, M., Giammarresi, D., Varricchio, S.: Finite automata and non-self-embedding grammars. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol. 2608, pp. 47\u201356. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44977-9_4"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.ic.2014.03.002","volume":"237","author":"Z Bedn\u00e1rov\u00e1","year":"2014","unstructured":"Bedn\u00e1rov\u00e1, Z., Geffert, V., Mereghetti, C., Palano, B.: Removing nondeterminism in constant height pushdown automata. Inf. Comput. 237, 257\u2013267 (2014)","journal-title":"Inf. Comput."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N.: On certain formal properties of grammars. Inf. Control 2(2), 137\u2013167 (1959)","journal-title":"Inf. Control"},{"issue":"4","key":"16_CR4","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0019-9958(59)80017-6","volume":"2","author":"N Chomsky","year":"1959","unstructured":"Chomsky, N.: A note on phrase structure grammars. Inf. Control 2(4), 393\u2013395 (1959)","journal-title":"Inf. Control"},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.ic.2010.01.002","volume":"208","author":"V Geffert","year":"2010","unstructured":"Geffert, V., Mereghetti, C., Palano, B.: More concise representation of regular languages by automata and regular expressions. Inf. Comput. 208(4), 385\u2013394 (2010)","journal-title":"Inf. Comput."},{"issue":"1\/2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/S0019-9958(67)90513-X","volume":"11","author":"TN Hibbard","year":"1967","unstructured":"Hibbard, T.N.: A generalization of context-free determinism. Inf. Control 11(1\/2), 196\u2013238 (1967)","journal-title":"Inf. Control"},{"key":"16_CR7","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley-Longman, Reading (2001)","edition":"2"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0304-3975(83)90026-9","volume":"28","author":"A Kelemenov\u00e1","year":"1984","unstructured":"Kelemenov\u00e1, A.: Complexity of normal form grammars. Theor. Comput. Sci. 28, 299\u2013314 (1984)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-19225-3_13","volume-title":"Descriptional Complexity of Formal Systems","author":"M Kutrib","year":"2015","unstructured":"Kutrib, M., Wendlandt, M.: On simulation cost of unary limited automata. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 153\u2013164. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_13"},{"issue":"3","key":"16_CR10","first-page":"287","volume":"5","author":"C Mereghetti","year":"2000","unstructured":"Mereghetti, C., Pighizzini, G.: Two-way automata simulations and unary languages. J. Automata Lang. Comb. 5(3), 287\u2013300 (2000)","journal-title":"J. Automata Lang. Comb."},{"issue":"2","key":"16_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0214031","volume":"14","author":"WF Ogden","year":"1985","unstructured":"Ogden, W.F., Ross, R.J., Winklmann, K.: An \u201cinterchange lemma\u201d for context-free languages. SIAM J. Comput. 14(2), 410\u2013415 (1985)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1142\/S0129054109006784","volume":"20","author":"G Pighizzini","year":"2009","unstructured":"Pighizzini, G.: Deterministic pushdown automata and unary languages. Int. J. Found. Comput. Sci. 20(4), 629\u2013645 (2009)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"7","key":"16_CR13","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1142\/S0129054114400140","volume":"25","author":"G Pighizzini","year":"2014","unstructured":"Pighizzini, G., Pisoni, A.: Limited automata and regular languages. Int. J. Found. Comput. Sci. 25(7), 897\u2013916 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-62809-7_23","volume-title":"Developments in Language Theory","author":"G Pighizzini","year":"2017","unstructured":"Pighizzini, G., Prigioniero, L.: Limited automata and unary languages. In: Charlier, \u00c9., Leroy, J., Rigo, M. (eds.) DLT 2017. LNCS, vol. 10396, pp. 308\u2013319. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62809-7_23"},{"key":"16_CR15","first-page":"197","volume":"2017","author":"G Pighizzini","year":"2017","unstructured":"Pighizzini, G., Prigioniero, L.: Non-self-embedding grammars and descriptional complexity. NCMA 2017, 197\u2013209 (2017)","journal-title":"NCMA"},{"key":"16_CR16","volume-title":"Computational Complexity","author":"KW Wagner","year":"1986","unstructured":"Wagner, K.W., Wechsung, G.: Computational Complexity. D. Reidel Publishing Company, Dordrecht (1986)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94812-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:53:50Z","timestamp":1709826830000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94812-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319948119","9783319948126"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94812-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Charlottetown, PE","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.smcs.upei.ca\/ciaa2018","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}