Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Finite monoids and the fine structure of NC1
Journal of the ACM (JACM)
Characterization of associative operations with prefix circuits of constant depth and linear size
SIAM Journal on Computing
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
On learning counting functions with queries
COLT '94 Proceedings of the seventh annual conference on Computational learning theory
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
Over words, two variables are as powerful as one quantifier alternation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Automata, Languages, and Machines
Automata, Languages, and Machines
Varieties Of Formal Languages
Satisfiability of Systems of Equations over Finite Monoids
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Polynomial Closure and Unambiguous Product
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Learning Expressions over Monoids
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Algebraic Characterizations of Small Classes of Boolean Functions
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Complete Classifications for the Communication Complexity of Regular Languages
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Learning decision lists and trees with equivalence-queries
EuroCOLT '95 Proceedings of the Second European Conference on Computational Learning Theory
Partially-Ordered Two-Way Automata: A New Characterization of DA
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Finite automata and their decision problems
IBM Journal of Research and Development
| Hi-index | 0.00 |
Regular languages are central objects of study in computer science. Although they are quite “easy” in the traditional space-time framework of sequential computations, the situation is different when other models are considered.In this paper we consider the subclass of regular languages that can be defined via unambiguous concatenation. We show remarkable algorithmic properties of this class in the context of boolean circuits and in that of computational learning.