{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:22Z","timestamp":1759637722433,"version":"3.37.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319773124"},{"type":"electronic","value":"9783319773131"}],"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-77313-1_15","type":"book-chapter","created":{"date-parts":[[2018,3,7]],"date-time":"2018-03-07T02:20:49Z","timestamp":1520389249000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analytic Combinatorics of Lattice Paths with Forbidden Patterns: Enumerative Aspects"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0689-0775","authenticated-orcid":false,"given":"Andrei","family":"Asinowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9789-7074","authenticated-orcid":false,"given":"Axel","family":"Bacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0755-3022","authenticated-orcid":false,"given":"Cyril","family":"Banderier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2639-8227","authenticated-orcid":false,"given":"Bernhard","family":"Gittenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,8]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Asinowski, A., Bacher, A., Banderier, C., Gittenberger, B.: Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects. In preparation (2017)","DOI":"10.1007\/978-3-319-77313-1_15"},{"issue":"8","key":"15_CR2","doi-asserted-by":"crossref","first-page":"2365","DOI":"10.1016\/j.jcta.2011.06.001","volume":"118","author":"A Bacher","year":"2011","unstructured":"Bacher, A., Bousquet-M\u00e9lou, M.: Weakly directed self-avoiding walks. J. Comb. Theory Ser. A 118(8), 2365\u20132391 (2011)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"15_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548314000728","volume":"24","author":"C Banderier","year":"2015","unstructured":"Banderier, C., Drmota, M.: Formulae and asymptotics for coefficients of algebraic functions. Comb. Probab. Comput. 24(1), 1\u201353 (2015)","journal-title":"Comb. Probab. Comput."},{"issue":"1\u20132","key":"15_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0304-3975(02)00007-5","volume":"281","author":"C Banderier","year":"2002","unstructured":"Banderier, C., Flajolet, P.: Basic analytic combinatorics of directed lattice paths. Theoret. Comput. Sci. 281(1\u20132), 37\u201380 (2002)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Banderier, C., Gittenberger, B.: Analytic combinatorics of lattice paths: enumeration and asymptotics for the area. Discrete Math. Theor. Comput. Sci. Proc. AG: 345\u2013355 (2006)","DOI":"10.46298\/dmtcs.3481"},{"key":"15_CR6","unstructured":"Banderier, C., Nicod\u00e8me, P.: Bounded discrete walks. Discrete Math. Theor. Comput. Sci. AM: 35\u201348, 2010"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Banderier, C., Wallner, M.: The kernel method for lattice paths below a rational slope. In: Lattice Paths Combinatorics And Applications, Developments in Mathematics Series, pp. 1\u201336. Springer (2018)","DOI":"10.1007\/978-3-030-11102-1_7"},{"issue":"3","key":"15_CR8","first-page":"13","volume":"17","author":"J-L Baril","year":"2016","unstructured":"Baril, J.-L.: Avoiding patterns in irreducible permutations. Discret. Math. Theor. Comput. Sci. 17(3), 13\u201330 (2016)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"issue":"11","key":"15_CR9","first-page":"1","volume":"18","author":"J-L Baril","year":"2015","unstructured":"Baril, J.-L., Petrossian, A.: Equivalence classes of Motzkin paths modulo a pattern of length at most two. J. Integer Seq. 18(11), 1\u201317 (2015). Article no. 15.7.1","journal-title":"J. Integer Seq."},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Bernini, A., Ferrari, L., Pinzani, R., West, J.: Pattern-avoiding Dyck paths. Discrete Math. Theor. Comput. Sci. Proc. 683\u2013694 (2013)","DOI":"10.46298\/dmtcs.2334"},{"issue":"3","key":"15_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s00026-010-0060-7","volume":"14","author":"M B\u00f3na","year":"2010","unstructured":"B\u00f3na, M., Knopfmacher, A.: On the probability that certain compositions have the same number of parts. Ann. Comb. 14(3), 291\u2013306 (2010)","journal-title":"Ann. Comb."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Bousquet-M\u00e9lou, M.: Rational and algebraic series in combinatorial enumeration. In: International Congress of Mathematicians, vol. III, pp. 789\u2013826. EMS (2006)","DOI":"10.4171\/022-3\/40"},{"issue":"5","key":"15_CR13","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/j.jctb.2005.12.003","volume":"96","author":"M Bousquet-M\u00e9lou","year":"2006","unstructured":"Bousquet-M\u00e9lou, M., Jehanne, A.: Polynomial equations with one catalytic variable, algebraic series and map enumeration. J. Comb. Theory Ser. B 96(5), 623\u2013672 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1\u20134","key":"15_CR14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.3233\/FI-2012-691","volume":"117","author":"C Brennan","year":"2012","unstructured":"Brennan, C., Mavhungu, S.: Visits to level $$r$$ by Dyck paths. Fund. Inform. 117(1\u20134), 127\u2013145 (2012)","journal-title":"Fund. Inform."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Chomsky, N., Sch\u00fctzenberger, M.-P.: The algebraic theory of context-free languages. In: Computer Programming and Formal Systems, pp. 118\u2013161, North-Holland, Amsterdam (1963)","DOI":"10.1016\/S0049-237X(08)72023-8"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., Zaks, S.: More patterns in trees: up and down, young and old, odd and even. SIAM J. Discret. Math. 23(1), 447\u2013465 (2008\/2009)","DOI":"10.1137\/070687475"},{"issue":"3","key":"15_CR17","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/S0012-365X(02)00341-2","volume":"256","author":"E Deutsch","year":"2002","unstructured":"Deutsch, E., Shapiro, L.W.: A bijection between ordered trees and 2-Motzkin paths and its many consequences. Discret. Math. 256(3), 655\u2013670 (2002)","journal-title":"Discret. Math."},{"issue":"1\u20132","key":"15_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.dam.2011.08.018","volume":"160","author":"Y Ding","year":"2012","unstructured":"Ding, Y., Du, R.R.X.: Counting humps in Motzkin paths. Discret. Appl. Math. 160(1\u20132), 187\u2013191 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"15_CR19","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0012-365X(00)00150-3","volume":"225","author":"P Duchon","year":"2000","unstructured":"Duchon, P.: On the enumeration and generation of generalized Dyck words. Discret. Math. 225(1\u20133), 121\u2013135 (2000)","journal-title":"Discret. Math."},{"issue":"4","key":"15_CR20","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1111\/1467-9590.t01-1-00042","volume":"111","author":"S-P Eu","year":"2003","unstructured":"Eu, S.-P., Liu, S.-C., Yeh, Y.-N.: Dyck paths with peaks avoiding or restricted to a given set. Stud. Appl. Math. 111(4), 453\u2013465 (2003)","journal-title":"Stud. Appl. Math."},{"key":"15_CR21","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801655","volume-title":"Analytic Combinatorics","author":"P Flajolet","year":"2009","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (2009)"},{"issue":"2","key":"15_CR22","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. J. Combin. Theory Ser. A 30(2), 183\u2013208 (1981)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"15_CR23","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.disc.2011.06.004","volume":"312","author":"IL Hofacker","year":"2012","unstructured":"Hofacker, I.L., Reidys, C.M., Stadler, P.F.: Symmetric circular matchings and RNA folding. Discret. Math. 312(1), 100\u2013112 (2012)","journal-title":"Discret. Math."},{"issue":"4","key":"15_CR24","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1007\/s11538-007-9265-2","volume":"70","author":"EY Jin","year":"2008","unstructured":"Jin, E.Y., Reidys, C.M.: Asymptotic enumeration of RNA structures with pseudoknots. Bull. Math. Biol. 70(4), 951\u2013970 (2008)","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"15_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(90)90039-K","volume":"82","author":"J Labelle","year":"1990","unstructured":"Labelle, J., Yeh, Y.N.: Generalized Dyck paths. Discret. Math. 82(1), 1\u20136 (1990)","journal-title":"Discret. Math."},{"issue":"2","key":"15_CR26","doi-asserted-by":"crossref","first-page":"10","DOI":"10.37236\/2214","volume":"19","author":"K Manes","year":"2012","unstructured":"Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P.: Strings of length 3 in Grand-Dyck paths and the Chung-Feller property. Electron. J. Combin. 19(2), 10 (2012). Paper 2","journal-title":"Electron. J. Combin."},{"issue":"10","key":"15_CR27","doi-asserted-by":"crossref","first-page":"2557","DOI":"10.1016\/j.disc.2016.05.001","volume":"339","author":"K Manes","year":"2016","unstructured":"Manes, K., Sapounakis, A., Tasoulas, I., Tsikouras, P.: Equivalence classes of ballot paths modulo strings of length 2 and 3. Discret. Math. 339(10), 2557\u20132572 (2016)","journal-title":"Discret. Math."},{"key":"15_CR28","first-page":"1","volume":"9","author":"T Mansour","year":"2006","unstructured":"Mansour, T.: Statistics on Dyck paths. J. Integer Seq. 9, 1\u201317 (2006). Article no. 06.1.5","journal-title":"J. Integer Seq."},{"issue":"13\u201314","key":"15_CR29","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1016\/j.dam.2013.03.007","volume":"161","author":"T Mansour","year":"2013","unstructured":"Mansour, T., Shattuck, M.: Counting humps and peaks in generalized Motzkin paths. Discret. Appl. Math. 161(13\u201314), 2213\u20132216 (2013)","journal-title":"Discret. Appl. Math."},{"issue":"1\u20133","key":"15_CR30","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(98)00126-7","volume":"91","author":"D Merlini","year":"1999","unstructured":"Merlini, D., Rogers, D.G., Sprugnoli, R., Verri, M.C.: Underdiagonal lattice paths with unrestricted steps. Discret. Appl. Math. 91(1\u20133), 197\u2013213 (1999)","journal-title":"Discret. Appl. Math."},{"issue":"11","key":"15_CR31","doi-asserted-by":"crossref","first-page":"2652","DOI":"10.1016\/j.disc.2016.04.024","volume":"339","author":"Y Park","year":"2016","unstructured":"Park, Y., Park, S.K.: Enumeration of generalized lattice paths by string types, peaks, and ascents. Discret. Math. 339(11), 2652\u20132659 (2016)","journal-title":"Discret. Math."},{"key":"15_CR32","unstructured":"Righi, C.: Number of \u201cudu\u201ds of a Dyck path and ad-nilpotent ideals of parabolic subalgebras of $$sl_{l+1}$$ ( $${\\mathbb{C}}$$ ). S\u00e9m. Lothar. Combin. 59, 17 (2007\/2010). Article no. B59c"},{"key":"15_CR33","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/S0019-9958(63)90306-1","volume":"6","author":"M-P Sch\u00fctzenberger","year":"1963","unstructured":"Sch\u00fctzenberger, M.-P.: On context-free languages and push-down automata. Inf. Control 6, 246\u2013264 (1963)","journal-title":"Inf. Control"},{"key":"15_CR34","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0019-9958(64)90232-3","volume":"7","author":"M-P Sch\u00fctzenberger","year":"1964","unstructured":"Sch\u00fctzenberger, M.-P.: On the synchronizing properties of certain prefix codes. Inf. Control 7, 23\u201336 (1964)","journal-title":"Inf. Control"},{"key":"15_CR35","series-title":"Cambridge Studies in Advanced Mathematics","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058520","volume-title":"Enumerative Combinatorics: Volume 1","author":"RP Stanley","year":"2011","unstructured":"Stanley, R.P.: Enumerative Combinatorics: Volume 1. Cambridge Studies in Advanced Mathematics, vol. 49, 2nd edn. Cambridge University Press, Cambridge (2011)","edition":"2"},{"issue":"1\u20133","key":"15_CR36","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.disc.2004.07.002","volume":"287","author":"Y Sun","year":"2004","unstructured":"Sun, Y.: The statistic \u201cnumber of udu\u2019s\u201d in Dyck paths. Discret. Math. 287(1\u20133), 177\u2013186 (2004)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T12:52:13Z","timestamp":1660567933000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}