A note on the emptiness problem for alternating finite-memory automata
From MaRDI portal
Publication:2437765
DOI10.1016/j.tcs.2014.01.020zbMath1358.68168OpenAlexW2063138539MaRDI QIDQ2437765
Daniel Genkin, Michael Kaminski, Liat Peterfreund
Publication date: 13 March 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.01.020
infinite alphabetsemptiness problemalternating finite-memory automataalternating finite-memory tree automata
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-memory automata
- On pebble automata for data languages with decidable emptiness problem
- Parallel program schemata
- LTL with the freeze quantifier and register automata
- Alternating automata on data trees and XPath satisfiability
- On Pebble Automata for Data Languages with Decidable Emptiness Problem
- Alternation
- Finite state machines for strings over infinite alphabets
- Tree Automata over Infinite Alphabets
This page was built for publication: A note on the emptiness problem for alternating finite-memory automata