首页    期刊浏览 2024年08月31日 星期六
登录注册

文章基本信息

  • 标题:Orbit-Finite Sets and Their Algorithms (Invited Talk)
  • 本地全文:下载
  • 作者:Mikolaj Bojanczyk
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2017
  • 卷号:80
  • 页码:1:1-1:14
  • DOI:10.4230/LIPIcs.ICALP.2017.1
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:An introduction to orbit-finite sets, which are a type of sets that are infinite enough to describe interesting examples, and finite enough to have algorithms running on them. The notion of orbit-finiteness is illustrated on the example of register automata, an automaton model dealing with infinite alphabets.
  • 关键词:Orbit-finite sets; sets with atoms; data words; register automata
国家哲学社会科学文献中心版权所有