Integer Weighted Automata on Infinite Words
From MaRDI portal
Publication:6169963
Cites work
- scientific article; zbMATH DE number 1339970 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- A variant of a recursively unsolvable problem
- Affine extensions of integer vector addition systems with states
- Decision problems for semi-Thue systems with a few rules
- Handbook of weighted automata
- Integer weighted automata on infinite words
- On decidability and complexity of low-dimensional robot games
- On the Complexity of Equivalence and Minimisation for Q-weighted Automata
- Quantitative languages
- Quantitative vs. weighted automata
- Small Semi-Thue System Universal with Respect to the Termination Problem
- Small universal Turing machines
- Some undecidable termination problems for semi-Thue systems
- 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 8
- Undecidability of infinite post correspondence problem for instances of Size 9
- Weighted automata on infinite words in the context of attacker-defender games
- What's decidable about weighted automata?
Cited in
(2)
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)
