Abstract
This is a survey of extensions of logics and automata which talk about boundedness. A typical property of interest is the set of ω-words which satisfy "there exists some
k
, such that every
a
letter is followed by a
b
letter in at most
k
steps". The main points of interest are the logic
mso+u
, its fragments and related automata models, as well as the regular cost functions of Colcombet.
Publisher
Association for Computing Machinery (ACM)