Weighted automata on infinite words in the context of attacker-defender games
From MaRDI portal
Publication:2013554
DOI10.1016/J.IC.2017.05.001zbMATH Open1371.68150OpenAlexW2963062266MaRDI QIDQ2013554FDOQ2013554
Authors: Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov 
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
Recommendations
undecidabilitybraid groupattacker-defender gamesvector reachabilityweighted automata on infinite words
Cites Work
- Alternating-time temporal logic
- Borel determinacy
- Title not available (Why is that?)
- Decidability of second-order theories and automata on infinite trees
- Automata, logics, and infinite games. A guide to current research
- A variant of a recursively unsolvable problem
- The power of commuting with finite sets of words
- Ordering braids.
- A survey of computational complexity results in systems and control
- Undecidability bounds for integer matrices using Claus instances
- Reachability problems in quaternion matrix and rotation semigroups
- Polynomial-time algorithm for the orbit problem
- An automata-theoretic approach to branching-time model checking
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- Pushdown processes: Games and model-checking
- Title not available (Why is that?)
- What's decidable about weighted automata?
- Braid Group Cryptography
- Computer Science Logic
- Infinite-state games with finitary conditions
- A categorical presentation of quantum computation with anyons
- Title not available (Why is that?)
- Composition problems for braids
- 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
- Undecidability of infinite post correspondence problem for instances of Size 9
- On the computational complexity of matrix semigroup problems
- Mathematical Foundations of Computer Science 2004
- Developments in Language Theory
- Regular solutions of language inequalities and well quasi-orders
- Unprovability results involving braids
- On undecidability bounds for matrix decision problems
- Subgroups of the braid group \(B_ 4\)
- Reachability games on extended vector addition systems with states
- Undecidability of two-dimensional robot games
- The complexity of robot games on the integer line
- 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\)
- Two-letter group codes that preserve aperiodicity of inverse finite automata.
- On the undecidability of the identity correspondence problem and its applications for word and matrix semigroups
Cited In (3)
This page was built for publication: Weighted automata on infinite words in the context of attacker-defender games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2013554)
