Clump Combinatorics, Automata, and Word Asymptotics

M. Régnier, Billy Fang, Daria Iakovishina
{"title":"Clump Combinatorics, Automata, and Word Asymptotics","authors":"M. Régnier, Billy Fang, Daria Iakovishina","doi":"10.1137/1.9781611973204.6","DOIUrl":null,"url":null,"abstract":"Given a set of words and a probability model for random texts, we are interested in the behavior of occurrences of the words in a random text. Clumps are shown here to play a central role in these problems. They can be used to calculate relevant quantities, such as the probability that a random text contains a given number of pattern word occurrences. We provide combinatorial properties that greatly simplify the classical enumeration of these texts by inclusion-exclusion approaches. We describe two clump automata that can be used to efficiently calculate generating functions.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611973204.6","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Given a set of words and a probability model for random texts, we are interested in the behavior of occurrences of the words in a random text. Clumps are shown here to play a central role in these problems. They can be used to calculate relevant quantities, such as the probability that a random text contains a given number of pattern word occurrences. We provide combinatorial properties that greatly simplify the classical enumeration of these texts by inclusion-exclusion approaches. We describe two clump automata that can be used to efficiently calculate generating functions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
聚类组合、自动机和词渐近
给定一组单词和随机文本的概率模型,我们对单词在随机文本中出现的行为感兴趣。这里显示团块在这些问题中起着核心作用。它们可用于计算相关数量,例如随机文本包含给定数量的模式单词出现的概率。我们提供了组合属性,通过包含-排除方法大大简化了这些文本的经典枚举。我们描述了两个可以用来有效地计算生成函数的簇自动机。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Protection Number of Recursive Trees Ranked Schröder Trees QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract) Subcritical random hypergraphs, high-order components, and hypertrees Esthetic Numbers and Lifting Restrictions on the Analysis of Summatory Functions of Regular Sequences
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1