Integer weighted automata on infinite words
From MaRDI portal
Publication:832935
DOI10.1007/978-3-030-81508-0_14OpenAlexW3189314826MaRDI QIDQ832935FDOQ832935
Authors: Vesa Halava, Reino Niskanen, Igor Potapov, Tero Harju 
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81508-0_14
Recommendations
Cites Work
- Title not available (Why is that?)
- Handbook of weighted automata
- 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
- Title not available (Why is that?)
Cited In (6)
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 Q832935)
