Weak and Nested Class Memory Automata
From MaRDI portal
Publication:2799172
DOI10.1007/978-3-319-15579-1_14zbMath1451.68145arXiv1409.1136OpenAlexW1841408358MaRDI QIDQ2799172
No author found.
Publication date: 8 April 2016
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.1136
Related Items (3)
ML and Extended Branching VASS ⋮ Leafy automata for higher-order concurrency ⋮ A Note on C² Interpreted over Finite Data-Words
Cites Work
- On notions of regularity for data languages
- Some decision problems related to the reachability problem for Petri nets
- Verifying lossy channel systems has nonprimitive recursive complexity.
- Feasible Automata for Two-Variable Logic with Successor on Data Words
- Temporal Logics on Words with Multiple Data Values.
- LTL with the freeze quantifier and register automata
- Two-variable logic on data words
- Ordered Navigation on Multi-attributed Data Words
- Shuffle Expressions and Words with Nested Data
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Counting Multiplicity over Infinite Alphabets
- Subgraphs and well‐quasi‐ordering
- History-Register Automata
- Finite state machines for strings over infinite alphabets
- Fresh-register automata
- Well-structured transition systems everywhere!
This page was built for publication: Weak and Nested Class Memory Automata
