{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:29Z","timestamp":1725936329733},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_25","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T04:35:54Z","timestamp":1513744554000},"page":"306-319","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations"],"prefix":"10.1007","author":[{"given":"Phan Thuan","family":"Do","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thi Thu Huong","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Vajnovszki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00236-004-0139-x","volume":"40","author":"S Bacchelli","year":"2004","unstructured":"Bacchelli, S., Barcucci, E., Grazzini, E., Pergola, E.: Exhaustive generation of combinatorial objects by ECO. Acta Informatica 40, 585\u2013602 (2004)","journal-title":"Acta Informatica"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(01)00250-3","volume":"246","author":"C Banderier","year":"2002","unstructured":"Banderier, C., Flajolet, P., Gardy, D., Bousquet-Melou, M., Denise, A., Gouyou-Beauchamps, D.: Generating functions for generating trees. Discrete Math. 246, 29\u201355 (2002)","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"25_CR3","first-page":"1","volume":"17","author":"E Barcucci","year":"2006","unstructured":"Barcucci, E., Bernini, A., Poneti, M.: From Fibonacci to Catalan permutations. Pu.M.A. 17(1\u20132), 1\u201317 (2006)","journal-title":"Pu.M.A."},{"key":"25_CR4","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10236199908808200","volume":"5","author":"E Barcucci","year":"1999","unstructured":"Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO: a methodology for the enumeration of combinatorial objects. J. Difference Equ. Appl. 5, 435\u2013490 (1999)","journal-title":"J. Difference Equ. Appl."},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tcs.2012.02.039","volume":"502","author":"E Barcucci","year":"2013","unstructured":"Barcucci, E., Vajnovszki, V.: Generalized Schr\u00f6der permutations. Theoret. Comput. Sci. 502, 210\u2013216 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR6","first-page":"1","volume":"17","author":"JL Baril","year":"2006","unstructured":"Baril, J.L., Do, P.T.: ECO-generation for p-generalized fibonacci and lucas permutations. Pu.M.A. 17, 1\u201319 (2006)","journal-title":"Pu.M.A."},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/j.disc.2004.07.019","volume":"298","author":"S Brlek","year":"2005","unstructured":"Brlek, S., Duchi, E., Pergola, E., Rinaldi, S.: On the equivalence problem for succession rules. Discrete Math. 298, 142\u2013154 (2005)","journal-title":"Discrete Math."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0012-365X(98)00384-7","volume":"204","author":"T Chow","year":"1999","unstructured":"Chow, T., West, J.: Forbidden sequences and Chebyshev polynomials. Discrete Math. 204, 119\u2013128 (1999)","journal-title":"Discrete Math."},{"key":"25_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45066-1_10","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"A Lungo Del","year":"2003","unstructured":"Del Lungo, A., Frosini, A., Rinaldi, S.: ECO method and the exhaustive generation of convex polyominoes. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol. 2731, pp. 129\u2013140. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45066-1_10"},{"key":"25_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/j.aam.2004.05.002","volume":"34","author":"E Deutsch","year":"2005","unstructured":"Deutsch, E., Ferrari, L., Rinaldi, S.: Production matrices. Adv. Appl. Math. 34, 101\u2013122 (2005)","journal-title":"Adv. Appl. Math."},{"key":"25_CR11","unstructured":"Do, P.T.: Arbres de g\u00e9n\u00e9ration et g\u00e9n\u00e9ration exhausitive. Ph.D. Thesis, University of Burgundy, France (2008)"},{"key":"25_CR12","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.disc.2013.12.007","volume":"320","author":"PT Do","year":"2014","unstructured":"Do, P.T., Rossin, D., Tran, T.T.H.: Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths. Discrete Math. 320, 40\u201350 (2014)","journal-title":"Discrete Math."},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.tcs.2007.12.002","volume":"396","author":"WMB Dukes","year":"2008","unstructured":"Dukes, W.M.B., Flanagan, M.F., Mansour, T., Vajnovszki, V.: Combinatorial gray codes for classes of pattern avoiding permutations. Theoret. Comput. Sci. 396, 35\u201349 (2008)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(02)00868-3","volume":"271","author":"L Ferrari","year":"2003","unstructured":"Ferrari, L., Pergola, E., Pinzani, R., Rinaldi, S.: Jumping succession rules and their generating functions. Discrete Math. 271, 29\u201350 (2003)","journal-title":"Discrete Math."},{"key":"25_CR15","unstructured":"Gire, S.: Arbres, permutations \u00e0 motifs exclus et cartes planaires: quelques probl\u00e8mes algorithmiques et combinatoires. Ph.D. Thesis, Universit\u00e9 Bordeaux 1 (1993)"},{"key":"25_CR16","unstructured":"Guibert, O.: Combinatoire des permutations \u00e0 motifs exclus en liaison avec mots, cartes planaires et tableaux de Young. Ph.D. Thesis, Universit\u00e9 Bordeaux 1 (1995)"},{"key":"25_CR17","unstructured":"Buss, J.F., Bose, P., Lubiw, A.: Pattern matching for permutations. In: Proceedings of the 6th Workshop on Algorithms and Data Structures (1993)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Sabri, A., Vajnovszki, V.: More restricted growth functions: Gray codes and exhaustive generations. To appear in Graphs and Combinatorics (2017)","DOI":"10.1007\/s00373-017-1774-7"},{"key":"25_CR19","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s00236-002-0097-0","volume":"38","author":"V Vajnovszki","year":"2002","unstructured":"Vajnovszki, V.: Gray visiting Motzkins. Acta Informatica 38, 793\u2013811 (2002)","journal-title":"Acta Informatica"},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(94)00067-1","volume":"146","author":"J West","year":"1994","unstructured":"West, J.: Generating trees and the catalan and Schr\u00f6der numbers. Discrete Math. 146, 247\u2013262 (1994)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T04:57:35Z","timestamp":1570510655000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}