Integer Weighted Automata on Infinite Words

DOI10.1142/S0129054122440014OpenAlexW4307688923MaRDI QIDQ6169963FDOQ6169963

Authors: Vesa Halava, Tero Harju, Reino Niskanen, Igor Potapov 

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

• Title not available (Why is that?)
• Handbook of weighted automata
• A variant of a recursively unsolvable problem
• Decision problems for semi-Thue systems with a few rules
• Title not available (Why is that?)
• Small universal Turing machines
• What's decidable about weighted automata?
• Quantitative languages
• Some undecidable termination problems for semi-Thue systems
• Small Semi-Thue System Universal with Respect to the Termination Problem
• Title not available (Why is that?)
• On the Complexity of Equivalence and Minimisation for Q-weighted Automata
• On decidability and complexity of low-dimensional robot games
• Weighted automata on infinite words in the context of attacker-defender games
• 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
• Affine extensions of integer vector addition systems with states
• Integer weighted automata on infinite words
• Quantitative vs. weighted automata

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169963)