惠勒语言
Wheeler Languages
摘要：
最近引入的Wheeler图类，灵感来自于给定字符串的Burrows-Wheeler变换（BWT），允许一个有效的索引数据结构用于搜索具有给定路径标签的子路径，并将Burrows-Wheeler变换的适用性从字符串提升到语言。本文研究了以Wheeler图为转移函数的自动机所接受的正则语言，证明了这类语言的判定性、Myhill_Nerode特征、可判定性和闭包性质。
英文摘要：
The recently introduced class of Wheeler graphs, inspired by the Burrows-Wheeler Transform (BWT) of a given string, admits an efficient index data structure for searching for subpaths with a given path label, and lifts the applicability of the Burrows-Wheeler transform from strings to languages. In this paper we study the regular languages accepted by automata having a Wheeler graph as transition function, and prove results on determination, Myhill_Nerode characterization, decidability, and closure properties for this class of languages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
