Regular Functions and Cost Register Automata

We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a notion of regularity that provides a yardstick to measure expressiveness, and study decision problems and theoretical properties of resultin...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science S. 13 - 22
Hauptverfasser:	Alur, Rajeev, D'Antoni, Loris, Deshmukh, Jyotirmoy, Raghothaman, Mukund, Yifei Yuan
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2013
Schlagworte:	Automata Commutation Computational modeling Cost function Grammar Registers Transducers
ISBN:	1479904139, 9781479904136
ISSN:	1043-6871
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!