Layered Memory Automata: Recognizers for Quasi-Regular Languages with Unbounded Memory
- 13 June 2022
- book chapter
- Published by Springer Nature
- p. 43-63
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- History-Register AutomataLogical Methods in Computer Science, 2016
- Regular expressions for data wordsJournal of Computer and System Sciences, 2015
- Two-variable logic on data wordsACM Transactions on Computational Logic, 2011
- Fresh-register automata2011
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENTInternational Journal of Foundations of Computer Science, 2010
- Variable Automata over Infinite Alphabets2010
- On notions of regularity for data languagesTheoretical Computer Science, 2010
- Usage AutomataLecture Notes in Computer Science, 2009
- Towards Regular Languages over Infinite Alphabets2001
- Finite-memory automataTheoretical Computer Science, 1994