A Generalised Twinning Property for Minimisation of Cost Register Automata

DOI10.1145/2933575.2934549zbMath1401.68160OpenAlexW2530095326MaRDI QIDQ4635950

Jean-Marc Talbot, Pierre-Alain Reynier, Laure Daviaud

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://openaccess.city.ac.uk/id/eprint/21298/1/A%20Generalised%20Twinning%20Property%20for%20Minimisation%20of%20Cost%20Register%20Automata.pdf

zbMATH Keywords

weighted automataminimisationcost register automatatwinning property

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (12)

Unnamed Item ⋮ Degree of Sequentiality of Weighted Automata ⋮ Better complexity bounds for cost register automata ⋮ Over Which Monoids is the Transducer Determinization Procedure Applicable? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Streamable regular transductions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Better complexity bounds for cost register automata

This page was built for publication: A Generalised Twinning Property for Minimisation of Cost Register Automata