Weighted automata on infinite words in the context of attacker-defender games
type: Item
instance of: scholarly article
title: Weighted automata on infinite words in the context of attacker-defender games
zbMATH Open document ID: 1371.68150
author: Vesa Halava
author: Tero Harju
author: Reino Niskanen
author: Igor Potapov
published in: Information and Computation
publication date: 2017-08-08T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 6758663
zbMATH Keywords: weighted automata on infinite words
zbMATH Keywords: attacker-defender games
zbMATH Keywords: vector reachability
zbMATH Keywords: braid group
zbMATH Keywords: undecidability
MaRDI profile type: Publication
full work available at URL: j.ic.2017.05.001
OpenAlex ID: W2963062266
cites work: Q4992530
cites work: Computer Science Logic
cites work: Reachability Games on Extended Vector Addition Systems with States
cites work: Q2958522
cites work: An automata-theoretic approach to branching-time model checking
cites work: Pushdown processes: Games and model-checking
cites work: Alternating-time temporal logic
cites work: Decidability of second-order theories and automata on infinite trees
cites work: Regular solutions of language inequalities and well quasi-orders
cites work: The power of commuting with finite sets of words
cites work: On effective construction of the greatest solution of language inequality \(XA\subseteq BX\)
cites work: Unprovability results involving braids
cites work: Q3546269
cites work: Q4003861
cites work: Braid Group Cryptography
cites work: A Categorical Presentation of Quantum Computation with Anyons
cites work: Composition Problems for Braids
cites work: Q3741057
cites work: Q4265634
cites work: What’s Decidable about Weighted Automata?
cites work: A variant of a recursively unsolvable problem
cites work: Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
cites work: Undecidability of infinite post correspondence problem for instances of Size 9
cites work: Undecidability of infinite Post correspondence problem for instances of size 8
cites work: Undecidability of Two-dimensional Robot Games
cites work: Borel determinacy
cites work: Automata, logics, and infinite games. A guide to current research
cites work: Two-letter group codes that preserve aperiodicity of inverse finite automata.
cites work: On the computational complexity of matrix semigroup problems
cites work: ON THE UNDECIDABILITY OF THE IDENTITY CORRESPONDENCE PROBLEM AND ITS APPLICATIONS FOR WORD AND MATRIX SEMIGROUPS
cites work: Polynomial-time algorithm for the orbit problem
cites work: Reachability problems in quaternion matrix and rotation semigroups
cites work: On undecidability bounds for matrix decision problems
cites work: A survey of computational complexity results in systems and control
cites work: REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
cites work: UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES
cites work: Mathematical Foundations of Computer Science 2004
cites work: Developments in Language Theory
cites work: On the unsolvability of the conjugacy problem for subgroups of the group \(R_5\) of pure braids
cites work: Subgroups of the braid group \(B_ 4\)
DOI: 10.1016/J.IC.2017.05.001
description: scientific article; zbMATH DE number 6758663