scientific article; zbMATH DE number 619536
From MaRDI portal
Publication:4302457
zbMath0797.68075MaRDI QIDQ4302457
Publication date: 13 September 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (2)
Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\) ⋮ Better complexity bounds for cost register automata
This page was built for publication: