{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:21:20Z","timestamp":1725895280572},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540882817"},{"type":"electronic","value":"9783540882824"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-88282-4_19","type":"book-chapter","created":{"date-parts":[[2008,9,24]],"date-time":"2008-09-24T03:46:38Z","timestamp":1222227998000},"page":"196-208","source":"Crossref","is-referenced-by-count":3,"title":["Consensual Definition of Languages by Regular Sets"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Crespi Reghizzi","sequence":"first","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"A.K. Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D., Stockmeyer, L.J.: Alternation. Journal of ACM\u00a028, 114\u2013133 (1981)","journal-title":"Journal of ACM"},{"issue":"1","key":"19_CR2","first-page":"19","volume":"13","author":"M. Jantzen","year":"1979","unstructured":"Jantzen, M.: On the hierarchy of Petri net languages. R.A.I.R.O. Informatique th\u00e9orique\/Theoretical Informatics\u00a013(1), 19\u201330 (1979)","journal-title":"R.A.I.R.O. Informatique th\u00e9orique\/Theoretical Informatics"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-59126-6_2","volume-title":"Handbook of Formal Languages","author":"A. Joshi","year":"1997","unstructured":"Joshi, A., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 69\u2013124. Springer, Berlin (1997)"},{"key":"19_CR4","volume-title":"Theory of Computation","author":"D. Kozen","year":"2006","unstructured":"Kozen, D.: Theory of Computation. Springer, New York (2006)"},{"key":"19_CR5","volume-title":"Theory of Automata","author":"A. Salomaa","year":"1969","unstructured":"Salomaa, A.: Theory of Automata. Pergamon Press, Oxford (1969)"},{"issue":"6","key":"19_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/BF01191624","volume":"27","author":"K. Vijay-Shanker","year":"1994","unstructured":"Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory\u00a027(6), 511\u2013546 (1994)","journal-title":"Mathematical Systems Theory"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88282-4_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:59:54Z","timestamp":1619510394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88282-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540882817","9783540882824"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88282-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}