$$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$
From MaRDI portal
Publication:5738989
DOI10.1007/978-3-319-53733-7_6zbMath1485.68137OpenAlexW2588374747MaRDI QIDQ5738989
Patrick Landwehr, Wolfgang Thomas, Benedikt Brütsch
Publication date: 1 June 2017
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-53733-7_6
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)
Related Items (2)
Solving Infinite Games in the Baire Space ⋮ Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
Cites Work
- Finite-memory automata
- Automata theory in nominal sets
- Two-variable logic on data words
- An Automata Model for Trees with Ordered Data Values
- Satisfiability of ECTL* with Tree Constraints
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Extending two-variable logic on data trees with order on data values and its automata
- One-way stack automata
This page was built for publication: $$\mathbb {N}$$ -Memory Automata over the Alphabet $$\mathbb {N}$$
