Pith. sign in

Wheeler Languages

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

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.

fields

cs.CV 1

years

2025 1

verdicts

REJECT 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.