Decision Problems for Additive Regular Functions

DOI10.1007/978-3-642-39212-2_7zbMath1335.68113arXiv1304.7029OpenAlexW1876483187MaRDI QIDQ5327421

Mukund Raghothaman, Rajeev Alur

Publication date: 7 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.7029

Mathematics Subject Classification ID

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

Related Items (12)

Unnamed Item ⋮ Complexity of regular functions ⋮ Unnamed Item ⋮ Degree of Sequentiality of Weighted Automata ⋮ Copyless cost-register automata: structure, expressiveness, and closure properties ⋮ Better complexity bounds for cost register automata ⋮ Decidable weighted expressions with Presburger combinators ⋮ Unnamed Item ⋮ Streamable regular transductions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Better complexity bounds for cost register automata

This page was built for publication: Decision Problems for Additive Regular Functions