scientific article; zbMATH DE number 7561719

DOI10.4230/LIPIcs.MFCS.2019.75MaRDI QIDQ5092439

Benjamin Monmege, Jean-Marc Talbot, Théodore Lopez

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unambiguitycost-register automatadeterminisationlook-ahead removal

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Handbook of weighted automata
• Weak cost register automata are still powerful
• Alternating weighted automata over commutative semirings
• Copyless cost-register automata: structure, expressiveness, and closure properties
• Quantitative languages
• Regular Transformations of Infinite Strings
• Streaming Tree Transducers
• Alternating Weighted Automata
• A Generalised Twinning Property for Minimisation of Cost Register Automata
• DECIDABILITY OF THE EQUIVALENCE PROBLEM FOR FINITELY AMBIGUOUS FINANCE AUTOMATA
• Regular Functions and Cost Register Automata
• Decision Problems for Additive Regular Functions
• Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata

This page was built for publication: