Restricted two-variable FO+MOD sentences, circuits and communication complexity

Lecture Notes in Computer Science

Volumn 3580, Issue , 2005, Pages 526-538

  Tesson, Pascal ^a   Thérien, Denis ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CHARACTERIZATION; COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC;

ITERATED BLOCK PRODUCTS; LOGICAL CHARACTERIZATION; SUBCLASSES;

FORMAL LANGUAGES;

EID: 26444479411     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_43     Document Type: Conference Paper

References (17)

1. J. Almeida and P. Weil. Profinite categories and semidirect products. J. Pure and Applied Algebra, 123:1-50, 1998.
2. G. Bilardi and F. Preparata. Characterization of associative operations with prefix circuits of constant depth and linear size. SIAM J. Comput., 19(2):246-255, 1990.
3. N. Immerman and D. Kozen. Definability with a bounded number of bound variables. Information and Computation, 83(2):121-13, 1989.
4. J. A. W. Kamp. Tense Logic and the Theory of Linear Order. PhD thesis, University of California, Berkeley, 1968.
5. M. Koucký, P. Pudlák, and D. Thérien. Bounded-depth circuits: separating wires from gates. In Symposium on Theory of Computing (STOC'05), 2005.
6. R. McNaughton and S. Papert. Counter-Free Automata, MIT Press, Cambridge, Mass., 1971.
7. J.-E. Pin. Syntactic semigroups. In G. R. et A. Salomaa, editor, Handbook of language theory, volume 1, chapter 10, pages 679-746. Springer Verlag, 1997.
8. M. P. Schützenberger. On finite monoids having only trivial subgroups. Information and Control, 8(2):190-194, Apr. 1965.
9. H. Straubing. Finite Automata, Formal Logic and Circuit Complexity. Boston: Birkhauser, 1994.
10. H. Straubing. On the logical description of regular languages. In Proc. of the 5th Latin American Theoretical Informatics Conf. (LATIN '02), 2002.
11. H. Straubing and D. Thérien. Weakly iterated block products of finite monoids. In Proc. of the 5th Latin American Theoretical Informatics Conf. (LATIN '02), 2002.
12. H. Straubing and D. Thérien. Regular languages defined by generalized first-order formulas with a bounded number of bound variables. Theory of Computing Systems, 36(1):29-69, 2003.
13. H. Straubing, D. Thérien, and W. Thomas. Regular languages defined by generalized quantifiers. Information and Computation, 118:289-301, 1995.
14. P. Tesson. Computational Complexity Questions Related to Finite Monoids and Semigroups. PhD thesis, McGill University, 2003.
15. P. Tesson and D. Thérien. Complete classifications for the communication complexity of regular languages. Theory of Comput. Syst., 2004. To appear.
16. D. Thérien and T. Wilke. Over words, two variables are as powerful as one quantifier alternation. In Proc. 30th ACM Symposium on the Theory of Computing, pages 256-263, 1998.
17. D. Thérien and T. Wilke. Nesting until and since in linear temporal logic. Theory Comput. Syst., 37(1):111-131, 2004.