Integer weighted automata on infinite words
type: Item
instance of: scholarly article
title: Integer weighted automata on infinite words
DOI: 10.1007/978-3-030-81508-0_14
author: Vesa Halava
author: Reino Niskanen
author: Igor Potapov
author: Tero Harju
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 7498724
MaRDI profile type: Publication
full work available at URL: 978-3-030-81508-0 14
OpenAlex ID: W3189314826
cites work: What’s Decidable about Weighted Automata?
cites work: Q5009428
cites work: Quantitative languages
cites work: Undecidability of infinite Post correspondence problem for instances of size 8
cites work: Handbook of weighted automata
cites work: Q4265634
cites work: Undecidability of infinite post correspondence problem for instances of Size 9
cites work: Weighted automata on infinite words in the context of attacker-defender games
cites work: Small Semi-Thue System Universal with Respect to the Termination Problem
cites work: On the Complexity of Equivalence and Minimisation for Q-weighted Automata
cites work: Decision problems for semi-Thue systems with a few rules
cites work: Q5590814
cites work: Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
cites work: On decidability and complexity of low-dimensional robot games
cites work: Small universal Turing machines
cites work: Some undecidable termination problems for semi-Thue systems
cites work: Q4385530
description: scientific article; zbMATH DE number 7498724