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

DOI10.1007/978-3-031-06653-5_3zbMATH Open1499.68167OpenAlexW4285126084MaRDI QIDQ2165231FDOQ2165231

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

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

zbMATH Keywords

data languagesregister automataunbounded memorymemory automataquasi-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Two-variable logic on data words
• Finite-memory automata
• Finite-memory automata with non-deterministic reassignment
• Variable automata over infinite alphabets
• Title not available (Why is that?)
• On notions of regularity for data languages
• Usage Automata
• Fresh-register automata
• Regular expressions for data words
• History-register automata
• Pattern matching in link streams: timed-automata with finite memory

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)