无限加权自动机与图的枚举组合中的应用

Sci. Ann. Comput. Sci. Pub Date : 2013-10-09 DOI:10.7561/SACS.2014.1.137

R. Castro, Andrés L. Ramírez, J. L. Ramírez

{"title":"无限加权自动机与图的枚举组合中的应用","authors":"R. Castro, Andrés L. Ramírez, J. L. Ramírez","doi":"10.7561/SACS.2014.1.137","DOIUrl":null,"url":null,"abstract":"In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some generalizations. These methodology uses weighted automata, equations of ordinary generating functions and continued fractions. It is a variation of the one proposed by J. Rutten.","PeriodicalId":394919,"journal":{"name":"Sci. Ann. Comput. Sci.","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs\",\"authors\":\"R. Castro, Andrés L. Ramírez, J. L. Ramírez\",\"doi\":\"10.7561/SACS.2014.1.137\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some generalizations. These methodology uses weighted automata, equations of ordinary generating functions and continued fractions. It is a variation of the one proposed by J. Rutten.\",\"PeriodicalId\":394919,\"journal\":{\"name\":\"Sci. Ann. Comput. Sci.\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sci. Ann. Comput. Sci.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.7561/SACS.2014.1.137\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sci. Ann. Comput. Sci.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7561/SACS.2014.1.137","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

本文研究了无限加权自动机和一种统一解决各种经典格路径计数问题的一般方法。这个计数问题与Dyck路径，Motzkin路径和一些推广有关。这些方法使用加权自动机、普通生成函数方程和连分式。这是J. Rutten提出的一个变体。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Applications in Enumerative Combinatorics of Infinite Weighted Automata and Graphs

In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some generalizations. These methodology uses weighted automata, equations of ordinary generating functions and continued fractions. It is a variation of the one proposed by J. Rutten.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Sci. Ann. Comput. Sci.

自引率

0.00%

发文量