The Big-O Problem

Given two weighted automata, we consider the problem of whether one is big-O of the other, i.e., if the weight of every finite word in the first is not greater than some constant multiple of the weight in the second. We show that the problem is undecidable, even for the instantiation of weighted aut...

Celý popis

Podrobná bibliografia

Vydané v:	Logical methods in computer science Ročník 18, Issue 1
Hlavní autori:	Chistikov, Dmitry, Kiefer, Stefan, Murawski, Andrzej S., Purser, David
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Logical Methods in Computer Science e.V 01.01.2022
Predmet:	computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!