Critical classes for the α0-product
Theoretical Computer Science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
Regular languages defined with generalized quantifiers
Information and Computation
Automata, Languages, and Machines
Automata, Languages, and Machines
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy
Counter-Free Automata (M.I.T. research monograph no. 65)
Counter-Free Automata (M.I.T. research monograph no. 65)
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Actions, wreath products of C-varieties and concatenation product
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Characterizing CTL-like logics on finite trees
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Duality and Equational Theory of Regular Languages
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
C-varieties, actions and wreath product
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
We associate a modal operator with each language belonging to a given class of regular languages and use the (reverse) wreath product of monoids with distinguished generators to characterize the expressive power of the resulting logic.