Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
From MaRDI portal
Publication:3195698
DOI10.1007/978-3-319-20028-6_21zbMath1459.68101arXiv1411.4796OpenAlexW2902139457MaRDI QIDQ3195698
Reino Niskanen, Igor Potapov, Tero J.Harju, Vesa Halava
Publication date: 20 October 2015
Published in: Evolving Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.4796
Related Items (3)
Weighted Automata on Infinite Words in the Context of Attacker-Defender Games ⋮ Quantitative vs. weighted automata ⋮ On Robot Games of Degree Two
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision problems for semi-Thue systems with a few rules
- Pushdown processes: Games and model-checking
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- Two-letter group codes that preserve aperiodicity of inverse finite automata.
- Regular solutions of language inequalities and well quasi-orders
- The power of commuting with finite sets of words
- Undecidability of infinite post correspondence problem for instances of size 8
- Composition Problems for Braids
- A Categorical Presentation of Quantum Computation with Anyons
- Unprovability results involving braids
- ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
- What’s Decidable about Weighted Automata?
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
- Undecidability of infinite post correspondence problem for instances of Size 9
- Alternating-time temporal logic
- Reachability Games on Extended Vector Addition Systems with States
- Decidability of second-order theories and automata on infinite trees
- Computer Science Logic
- An automata-theoretic approach to branching-time model checking
- Braid Group Cryptography
- A variant of a recursively unsolvable problem
This page was built for publication: Weighted Automata on Infinite Words in the Context of Attacker-Defender Games
