Pith. sign in

REVIEW 1 cited by

Wheeler Languages

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.10303 v1 pith:IEMSQMCN submitted 2020-02-24 cs.FL

Jarno Alanko , Giovanna D'Agostino , Alberto Policriti , Nicola Prezza This is my paper
classification cs.FL
keywords languageswheelerburrows-wheelerclassgiventransformacceptedadmits
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. THIRDEYE: Cue-Aware Monocular Depth Estimation via Brain-Inspired Multi-Stage Fusion

    cs.CV 2025-06 reject novelty 6.0 of 10

    A cue-aware monocular depth estimation architecture that fuses frozen specialist networks via a cortical-style hierarchy and key-value memory, with no experimental results provided yet.

Pith tools