In the Maze of Data Languages

Loris D'Antoni

In the Maze of Data 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 1208.5980 v1 pith:63PAAHIV submitted 2012-08-29 cs.FL

Loris D'Antoni This is my paper

classification cs.FL

keywords datalanguagesalphabetfinitemodelsalphabetsautomatabeen

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

In data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the string and tree cases. In this paper we describe and compare the complexity and expressiveness of such models to understand which ones are better candidates as regular models.

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

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
cs.LO 2025-06 conditional novelty 8.0 of 10

A monitorability hierarchy for a modal mu-calculus with data is established, including a maximal monitorable fragment for least-fixed-point formulas and undecidability of monitorability in the full logic.

Pith tools