Complexity of Regular Functions

DOI10.1007/978-3-319-15579-1_35zbMath1423.68238OpenAlexW588220481MaRDI QIDQ2799196

Ian Mertz, Eric W. 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)

Related Items (6)

Complexity of regular functions ⋮ Better complexity bounds for cost register automata ⋮ Streamable regular transductions ⋮ Cost Register Automata for Nested Words ⋮ Unnamed Item ⋮ Better complexity bounds for cost register automata

This page was built for publication: Complexity of Regular Functions