Value Automata with Filters
Formal Languages and Automata Theory
2015-10-09 v1
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.
Keywords
Cite
@article{arxiv.1510.02393,
title = {Value Automata with Filters},
author = {Michaël Cadilhac and Andreas Krebs and Nutan Limaye},
journal= {arXiv preprint arXiv:1510.02393},
year = {2015}
}
Comments
8 pages, presented in the short track of NCMA'15, work in progress