Back to Search
Start Over
Integer Weighted Automata on Infinite Words.
- Source :
- International Journal of Foundations of Computer Science; Feb/Apr2023, Vol. 34 Issue 2/3, p163-182, 20p
- Publication Year :
- 2023
-
Abstract
- In this paper we combine two classical generalisations of finite automata (weighted automata and automata on infinite words) into a model of integer weighted automata on infinite words and study the universality and the emptiness problems under zero weight acceptance. We show that the universality problem is undecidable for three-state automata by a direct reduction from the infinite Post correspondence problem. We also consider other more general acceptance conditions as well as their complements with respect to the universality and the emptiness problems. Additionally, we build a universal integer weighted automaton with fixed transitions. This automaton has an additional integer input that allows it to simulate any semi-Thue system. [ABSTRACT FROM AUTHOR]
- Subjects :
- INTEGERS
FINITE state machines
VOCABULARY
ROBOTS
GENERALIZATION
MACHINE theory
Subjects
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 34
- Issue :
- 2/3
- Database :
- Complementary Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 162506266
- Full Text :
- https://doi.org/10.1142/S0129054122440014