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...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 18, Issue 1
Main Authors:	Chistikov, Dmitry, Kiefer, Stefan, Murawski, Andrzej S., Purser, David
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2022
Subjects:	computer science - formal languages and automata theory computer science - logic in computer science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!