Integer Weighted Automata on Infinite Words

DOI10.1142/s0129054122440014OpenAlexW4307688923MaRDI QIDQ6169963

Reino Niskanen, Tero J.Harju, Igor Potapov, Vesa Halava

Publication date: 15 August 2023

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054122440014

zbMATH Keywords

undecidabilityweighted automataautomata on infinite words

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some undecidable termination problems for semi-Thue systems
• Integer weighted automata on infinite words
• Handbook of weighted automata
• Small universal Turing machines
• Decision problems for semi-Thue systems with a few rules
• On decidability and complexity of low-dimensional robot games
• Weighted automata on infinite words in the context of attacker-defender games
• Quantitative vs. weighted automata
• Undecidability of infinite post correspondence problem for instances of size 8
• Quantitative languages
• Undecidability in Binary Tag Systems and the Post Correspondence Problem for Five Pairs of Words
• What’s Decidable about Weighted Automata?
• Undecidability of infinite post correspondence problem for instances of Size 9
• Small Semi-Thue System Universal with Respect to the Termination Problem
• On the Complexity of Equivalence and Minimisation for Q-weighted Automata
• A variant of a recursively unsolvable problem

This page was built for publication: Integer Weighted Automata on Infinite Words