A generalised twinning property for minimisation of cost register automata

DOI10.1145/2933575.2934549zbMATH Open1401.68160OpenAlexW2530095326MaRDI QIDQ4635950FDOQ4635950

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

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

Recommendations

• Regular functions and cost register automata (invited paper)
• Weak cost register automata are still powerful
• Better complexity bounds for cost register automata
• Better complexity bounds for cost register automata
• Weak cost register automata are still powerful

zbMATH Keywords

weighted automataminimisationcost register automatatwinning property

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (13)

• Better complexity bounds for cost register automata
• Better complexity bounds for cost register automata
• Over Which Monoids is the Transducer Determinization Procedure Applicable?
• Continuity of functional transducers: a profinite study of rational functions
• The many facets of string transducers (invited talk)
• Title not available (Why is that?)
• Pumping lemmas for weighted automata
• Streamable regular transductions
• Optimal run problem for weighted register automata
• Degree of sequentiality of weighted automata
• Sequentiality of string-to-context transducers
• Title not available (Why is that?)
• Determinisation of finitely-ambiguous copyless cost register automata

This page was built for publication: A generalised twinning property for minimisation of cost register automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635950)