Complexity of Regular Functions

DOI10.1007/978-3-319-15579-1_35MaRDI QIDQ2799196zbMATH OpenOpenAlexFDO

Authors Ian Mertz, Eric Allender

Publication date 8 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15579-1_35

zbMATH Keywords

computational complexitytransducersweighted automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cited in

(7)

• Better complexity bounds for cost register automata
• Streamable regular transductions
• Complexity of regular functions
• Cost register automata for nested words
• scientific article; zbMATH DE number 1979755 (Why is no real title available?)
• Better complexity bounds for cost register automata
• A unified method for placing problems in polylogarithmic depth

This page was built for publication: Complexity of Regular Functions

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