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

Celý popis

Podrobná bibliografia

Vydané v:	2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science s. 13 - 22
Hlavní autori:	Alur, Rajeev, D'Antoni, Loris, Deshmukh, Jyotirmoy, Raghothaman, Mukund, Yifei Yuan
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2013
Predmet:	Automata Commutation Computational modeling Cost function Grammar Registers Transducers
ISBN:	1479904139, 9781479904136
ISSN:	1043-6871
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!