Weighted automata on infinite words in the context of attacker-defender games
From MaRDI portal
Publication:2013554
DOI10.1016/j.ic.2017.05.001zbMath1371.68150OpenAlexW2963062266MaRDI QIDQ2013554
Vesa Halava, Tero J.Harju, Igor Potapov, Reino Niskanen
Publication date: 8 August 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2017.05.001
undecidabilitybraid groupattacker-defender gamesvector reachabilityweighted automata on infinite words
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reachability problems in quaternion matrix and rotation semigroups
- Subgroups of the braid group \(B_ 4\)
- Borel determinacy
- Pushdown processes: Games and model-checking
- Automata, logics, and infinite games. A guide to current research
- On the unsolvability of the conjugacy problem for subgroups of the group \(R_5\) of pure braids
- On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
- On undecidability bounds for matrix decision problems
- 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
- Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
- Composition Problems for Braids
- A Categorical Presentation of Quantum Computation with Anyons
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
- 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?
- Undecidability of infinite post correspondence problem for instances of Size 9
- Alternating-time temporal logic
- Polynomial-time algorithm for the orbit problem
- Reachability Games on Extended Vector Addition Systems with States
- Decidability of second-order theories and automata on infinite trees
- Undecidability of Two-dimensional Robot Games
- Computer Science Logic
- Mathematical Foundations of Computer Science 2004
- An automata-theoretic approach to branching-time model checking
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- Developments in Language Theory
- Braid Group Cryptography
- A variant of a recursively unsolvable problem
- A survey of computational complexity results in systems and control
This page was built for publication: Weighted automata on infinite words in the context of attacker-defender games
