Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata

DOI10.4230/LIPIcs.CSL.2015.144zbMath1434.03103OpenAlexW2263027537MaRDI QIDQ5351955

Filip Mazowiecki, Cristian Riveros

Publication date: 31 August 2017

Full work available at URL: https://dblp.uni-trier.de/db/conf/csl/csl2015.html#MazowieckiR15

zbMATH Keywords

finite automatasemiringsweighted automataweighted logicsMSOcost register automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)

Related Items (6)

Complexity of regular functions ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ Better complexity bounds for cost register automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A robust class of linear recurrence sequences

This page was built for publication: Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata