Value Automata with Filters

TL;DR

This paper introduces value automata with filters, a generalized model encompassing weighted and Parikh automata, providing insights into their expressiveness and a framework for understanding various automata behaviors.

Contribution

It presents a new generalized automata model with filters, analyzing its expressiveness and mapping out the landscape of related automata restrictions.

Findings

Provides a unified framework for weighted and Parikh automata

Analyzes the expressiveness of value automata with filters

Maps out the landscape of automata restrictions

Abstract

We propose to study value automata with filters, a natural generalization of regular cost automata to nondeterminism. Models such as weighted automata and Parikh automata appear naturally as specializations. Results on the expressiveness of this model offer a general understanding of the behavior of the models that arise as special cases. A landscape of such restrictions is drawn.