Cost Register Automata for Nested Words (Q2817901)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Cost Register Automata for Nested Words	scientific article

Statements

scholarly article

0 references

Cost Register Automata for Nested Words (English)

0 references

0 references

0 references

0 references

Lecture Notes in Computer Science

0 references

publication date

2 September 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-42634-1_47

0 references

0 references

Arithmetic complexity, Kleene closure, and formal power series

0 references

Complexity of Regular Functions

0 references

Regular Functions and Cost Register Automata

0 references

Visibly pushdown languages

0 references

Regular languages in \(NC\)

0 references

Extensions to Barrington's M-program model

0 references

An Optimal Parallel Algorithm for Formula Evaluation

0 references

Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness

0 references

Nondeterministic \(NC^1\) computation

0 references

A taxonomy of problems with fast parallel algorithms

0 references

Counting paths in VPA is complete for \(\#\mathrm{NC}^1\)

0 references

0 references

\(NC^ 1\): The automata-theoretic viewpoint

0 references

Properties that characterize LOGCFL

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-42634-1_47

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2817901

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2817901&oldid=36270729"