Layered memory automata: recognizers for quasi-regular languages with unbounded memory

DOI10.1007/978-3-031-06653-5_3MaRDI QIDQ2165231zbMATH OpenOpenAlexFDO

Authors Clément Bertrand, Hanna Klaudel, Frédéric Peschanski

Publication date 19 August 2022

Full work available at URL https://doi.org/10.1007/978-3-031-06653-5_3

zbMATH Keywords

data languagesmemory automataquasi-regular languagesregister automataunbounded memory

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Finite-memory automata
• Weak and nested class memory automata
• Automata vs. Logics on Data Words
• \(\mathbb {N}\)-memory automata over the alphabet \(\mathbb {N}\)
• Intractability of decision problems for finite-memory automata

Cites work

• Finite-memory automata
• Finite-memory automata with non-deterministic reassignment
• Fresh-register automata
• History-register automata
• scientific article; zbMATH DE number 1834677 (Why is no real title available?)
• On notions of regularity for data languages
• Pattern matching in link streams: timed-automata with finite memory
• Regular expressions for data words
• Two-variable logic on data words
• Usage Automata
• Variable automata over infinite alphabets

Cited in

(1)

• Complexity of membership and non-emptiness problems in unbounded memory automata

This page was built for publication: Layered memory automata: recognizers for quasi-regular languages with unbounded memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2165231)