Cost Register Automata for Nested Words
From MaRDI portal
Publication:2817901
DOI10.1007/978-3-319-42634-1_47zbMath1477.68154OpenAlexW2478597933MaRDI QIDQ2817901
Nutan Limaye, Michael Ludwig, Andreas Krebs
Publication date: 2 September 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_47
Related Items
Complexity of regular functions ⋮ Better complexity bounds for cost register automata ⋮ Unnamed Item ⋮ Better complexity bounds for cost register automata
Cites Work
- Unnamed Item
- Unnamed Item
- \(NC^ 1\): The automata-theoretic viewpoint
- Properties that characterize LOGCFL
- Regular languages in \(NC\)
- Extensions to Barrington's M-program model
- Nondeterministic \(NC^1\) computation
- Arithmetic complexity, Kleene closure, and formal power series
- Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)
- Complexity of Regular Functions
- Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness
- Visibly pushdown languages
- A taxonomy of problems with fast parallel algorithms
- An Optimal Parallel Algorithm for Formula Evaluation
- Regular Functions and Cost Register Automata