Filters








1 Hit in 2.1 sec

Determinisation of Finitely-Ambiguous Copyless Cost Register Automata

Théodore Lopez, Benjamin Monmege, Jean-Marc Talbot, Michael Wagner
2019 International Symposium on Mathematical Foundations of Computer Science  
We show that finitely-ambiguous copyless non-deterministic CRAs (i.e. the ones that admit a bounded number of accepting runs on every input word) can be effectively transformed into an equivalent copyless  ...  Cost register automata (CRA) are machines reading an input word while computing values using write-only registers: values from registers are combined using the two operations, as well as the constants,  ...  the current contents of registers and values from the considered 75:2 Determinisation of Finitely-Ambiguous Copyless Cost Register Automata algebraic structure.  ... 
doi:10.4230/lipics.mfcs.2019.75 dblp:conf/mfcs/LopezMT19 fatcat:zbwejfkg4ncetl6uo7xxuxgqtu