Visibly counter languages and the structure of NC^1
From MaRDI portal
Publication:2946409
Recommendations
Cites Work
- scientific article; zbMATH DE number 3696500 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Extensional Uniformity for Boolean Circuits
- Finite monoids and the fine structure of NC 1
- Parity, circuits, and the polynomial-time hierarchy
- Regular languages in \(NC\)
- Regularity Problems for Visibly Pushdown Languages
- Visibly counter languages and constant depth circuits
- Visibly pushdown languages
Cited In (7)
- Visibly counter languages and constant depth circuits
- Refining the hierarchy of blind multicounter languages and twist-closed trios.
- The regular languages of wire linear \(\mathrm{AC}^0\)
- On distinguishing \(\mathbf {NC^1}\) and \(\mathbf {NL}\)
- Dual VP classes
- Input-driven multi-counter automata
- Title not available (Why is no real title available?)
This page was built for publication: Visibly counter languages and the structure of \(\mathrm {NC}^{1}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946409)