Pith. sign in

REVIEW 1 cited by

Automata and rational expressions

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 1502.03573 v1 pith:262ASLAR submitted 2015-02-12 cs.FL

Jacques Sakarovitch (LTCI) This is my paper · ORCID
classification cs.FL
keywords automataexpressionsrationalappearautomathachaptereditedeuropean
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This text is an extended version of the chapter 'Automata and rational expressions' in the AutoMathA Handbook that will appear soon, published by the European Science Foundation and edited by JeanEricPin.

Discussion (0). Continue with ORCID 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. Solving of Regular Equations Revisited (extended version)

    cs.FL 2019-08 conditional novelty 6.0 of 10

    A formal framework based on bijective parse-tree coercions shows that non-overlapping regular equations, including those from DFAs and subtraction, yield unambiguous solutions.

Pith tools