Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata
CSL, pp. 144-159, 2015.
It is highly desirable for a computational model to have a logic characterization like in the seminal work from Buchi that connects MSO with finite automata. For example, weighted automata are the quantitative extension of finite automata for computing functions over words and they can be naturally characterized by a subframent of weighte...More
Full Text (Upload PDF)
PPT (Upload PPT)