Layered memory automata: recognizers for quasi-regular languages with unbounded memory
From MaRDI portal
Publication:2165231
DOI10.1007/978-3-031-06653-5_3zbMath1499.68167OpenAlexW4285126084MaRDI QIDQ2165231
Frédéric Peschanski, Clément Bertrand, Hanna Klaudel
Publication date: 19 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-06653-5_3
Cites Work
- Unnamed Item
- On notions of regularity for data languages
- Finite-memory automata
- Regular expressions for data words
- History-Register Automata
- Two-variable logic on data words
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
- Usage Automata
- Variable Automata over Infinite Alphabets
- Pattern Matching in Link Streams: Timed-Automata with Finite Memory
- Fresh-register automata