{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:46:28Z","timestamp":1725533188323},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024771"},{"type":"electronic","value":"9783642024788"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02478-8_63","type":"book-chapter","created":{"date-parts":[[2009,6,5]],"date-time":"2009-06-05T22:46:41Z","timestamp":1244242001000},"page":"504-511","source":"Crossref","is-referenced-by-count":1,"title":["Permutation Languages in Formal Linguistics"],"prefix":"10.1007","author":[{"given":"Benedek","family":"Nagy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","first-page":"61","volume":"4","author":"S. Abraham","year":"1965","unstructured":"Abraham, S.: Some questions of phrase-structure grammars. Comp. Linguistics\u00a04, 61\u201370 (1965)","journal-title":"Comp. Linguistics"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A. Aho","year":"1968","unstructured":"Aho, A.: Indexed grammars\u2013An extension of context-free grammars. J. ACM\u00a015, 647\u2013671 (1968)","journal-title":"J. ACM"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF00976059","volume":"2","author":"R.V. Book","year":"1973","unstructured":"Book, R.V.: On the structure of context-sensitive grammars. Int. Journal of Computer and Information Sciences\u00a02, 129\u2013139 (1973)","journal-title":"Int. Journal of Computer and Information Sciences"},{"key":"63_CR4","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/B978-044482830-9\/50027-8","volume-title":"Handbook of Process Algebra","author":"O. Burkart","year":"2001","unstructured":"Burkart, O., Caucal, D., Moller, F., Steffen, B.: Verification on infinite structures. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 545\u2013623. Elsevier, Amsterdam (2001)"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1142\/9789814261456_0012","volume-title":"The book of traces","author":"M. Clerbout","year":"1995","unstructured":"Clerbout, M., Latteux, M., Roos, Y.: Semi-Commutations. In: Diekert, V., Rozenberg, G. (eds.) The book of traces, pp. 487\u2013552. World Scientific, Singapore (1995)"},{"key":"63_CR6","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated rewriting in formal language theory","author":"J. Dassow","year":"1989","unstructured":"Dassow, J., P\u0103un, G.: Regulated rewriting in formal language theory. EATCS Monographs on Theoretical Computer Science, vol.\u00a018. Springer, Berlin (1989)"},{"key":"63_CR7","first-page":"23","volume":"30","author":"J. Esperanza","year":"1997","unstructured":"Esperanza, J.: Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. Fundamenta Informaticae\u00a030, 23\u201341 (1997)","journal-title":"Fundamenta Informaticae"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/jcss.1997.1553","volume":"56","author":"J. Kortelainen","year":"1998","unstructured":"Kortelainen, J.: Remarks about Commutative Context-Free Languages. Journal of Computer and System Sciences\u00a056, 125\u2013129 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"Fischer, M.: Grammars with macrolike productions. Ph.D. Dissertation, Harvard University, Cambridge, Massachusetts (1968)","DOI":"10.1109\/SWAT.1968.12"},{"key":"63_CR10","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)"},{"key":"63_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/BF01936139","volume":"25","author":"E. M\u00e4kinen","year":"1985","unstructured":"M\u00e4kinen, E.: On permutative grammars generating context-free languages. BIT\u00a025, 604\u2013610 (1985)","journal-title":"BIT"},{"key":"63_CR12","series-title":"Studies in Fuziness and Soft Computing","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-540-39886-8_7","volume-title":"Formal languages and applications","author":"A. Mateescu","year":"2004","unstructured":"Mateescu, A.: On context-sensitive grammars. In: Martin-Vide, C., Mitrana, V., P\u0103un, G. (eds.) Formal languages and applications. Studies in Fuziness and Soft Computing, vol.\u00a0148, pp. 139\u2013161. Springer, Heidelberg (2004)"},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00163-1","volume":"197","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theoretical Computer Science\u00a0197, 1\u201356 (1998)","journal-title":"Theoretical Computer Science"},{"key":"63_CR14","first-page":"20","volume":"18","author":"F. Moller","year":"1998","unstructured":"Moller, F.: A Taxonomy of Infinite State Processes. Electonic Notes in Theoretical Computer Science\u00a018, 20 pages (1998)","journal-title":"Electonic Notes in Theoretical Computer Science"},{"key":"63_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/B978-044481714-3\/50005-9","volume-title":"Handbook of Logic and Language","author":"M. Moortgat","year":"1997","unstructured":"Moortgat, M.: Categorial Type Logics. In: van Benthem, J., ter Meulen, A. (eds.) Handbook of Logic and Language, pp. 93\u2013177. Elsevier, Amsterdam (1997)"},{"key":"63_CR16","unstructured":"Nagy, B.: Languages generated by context-free grammars extended by type AB \u2192BA rules. Journal of Automata, Languages and Combinatorics (accepted)"},{"key":"63_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/S0019-9958(74)91049-3","volume":"25","author":"M. Penttonen","year":"1974","unstructured":"Penttonen, M.: One-sided and two-sided context in formal grammars. Information and Control\u00a025, 371\u2013392 (1974)","journal-title":"Information and Control"},{"key":"63_CR18","doi-asserted-by":"crossref","unstructured":"Pentus, M.: Lambek grammars are context-free. In: Proc. of LICS, pp. 429\u2013433 (1993)","DOI":"10.1109\/LICS.1993.287565"},{"key":"63_CR19","volume-title":"Introduction to Formal Languages","author":"G.E. R\u00e9v\u00e9sz","year":"1983","unstructured":"R\u00e9v\u00e9sz, G.E.: Introduction to Formal Languages. McGraw-Hill, New York (1983)"},{"key":"63_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/321495.321504","volume":"16","author":"D. Rosenkrantz","year":"1969","unstructured":"Rosenkrantz, D.: Programmed grammars and classes of formal languages. J. ACM\u00a016, 107\u2013131 (1969)","journal-title":"J. ACM"},{"key":"63_CR21","unstructured":"Salomaa, A.: On grammars with restricted use of productions. Ann. Acad. Sci. Fenn., Ser. A, No. 454 (1969)"},{"key":"63_CR22","volume-title":"Formal Languages","author":"A. Salomaa","year":"1973","unstructured":"Salomaa, A.: Formal Languages. Academic Press, New York (1973)"},{"key":"63_CR23","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.tcs.2004.03.048","volume":"324","author":"R. Schott","year":"2004","unstructured":"Schott, R., Spehner, J.-C.: Two optimal parallel algorithms on the commutation class of a word. Theoretical Computer Science\u00a0324, 107\u2013131 (2004)","journal-title":"Theoretical Computer Science"},{"key":"63_CR24","unstructured":"Sillars, W.: Formal properties of essentially context-dependent languages. Ph.D. Dissertation, Pennsylvania State Univ. (1968)"}],"container-title":["Lecture Notes in Computer Science","Bio-Inspired Systems: Computational and Ambient Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02478-8_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T18:06:23Z","timestamp":1558375583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02478-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024771","9783642024788"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02478-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}