The space complexity of the unique decipherability problem
Information Processing Letters
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Information Processing Letters
Handbook of formal languages, vol. 1
Automata, Languages, and Machines
Automata, Languages, and Machines
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
An Unambiguous Class Possessing a Complete Set
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Making nondeterminism unambiguous
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Arithmetic Complexity, Kleene Closure, and Formal Power Series
Arithmetic Complexity, Kleene Closure, and Formal Power Series
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We locate the complexities of evaluating, of inverting, and of testing membership in the image of, morphisms h: Σ* → Δ*. By and large, we show these problems complete for classes within NL. Then we develop new properties of finite codes and of finite sets of words, which yield image membership subproblems that are closely tied to the unambiguous space classes found between L and NL.