On dot-depth two

 Access to full text

 Full (PDF)

1. 1. J. A. BRZOZOWSKI and R. KNAST, The Dot-Depth Hierarchy of Star-Free Languages if Infinite, J. Comp. Sys. Sci., 1978, 16, pp. 37-55. Zbl0368.68074MR471451
2. 2. F. BLANCHET-SADRI, Some Logical Characterizations of the Dot-Depth Hierarchy and Applications, Technical Report No. 88-03 of the Department of Mathematics and Statistics of McGill University, July 1988, pp. 1-44. MR2685431
3. 3. F. BLANCHET-SADRI, Games, Equations and the Dot-Depth Hierarchy, (preprint 1988 ), Computers and Mathematics with applications (à paraître). Zbl0682.03015MR1008808
4. 4. R. S. COHEN and J. A. BRZOZOWSKI, Dot-Depth of Star-Free Events, J. Comp. Sys. Sci., 1971, 5, pp. 1-16. Zbl0217.29602MR309676
5. 5. A. EHRENFEUCHT, An Application of Games to the Completeness Problem for Formalized Theories, Fund. Math., 1961, 49, pp. 129-141. Zbl0096.24303MR126370
6. 6. S. EILENBERG, Automata, Languages and Machines, B, Academic Press, New York, 1976. Zbl0359.94067MR530383
7. 7. H. B. ENDERTON, A Mathematical Introduction to Logic, Academic Press, New York, 1972. Zbl0298.02002MR337470
8. 8. R. FRAISSÉ, Cours de logique mathématique, tome 2, Gauthier-Vîllars, Paris, 1972. Zbl0247.02003MR446871
9. 9. G. LALLEMENT, Semigroups and Combinatorial Applications, Wiley, New York, 1979. Zbl0421.20025MR530552
10. 10. R. MCNAUGHTON and S. PAPERT, Counter-Free Automata, M.I.T. Press, Cambridge, Mass., 1971. Zbl0232.94024MR371538
11. 11. D. PERRIN and J. E. PIN, First-Order Logic and Star-Free Sets, J. Comp. Sys. Sci., 1986, 32, pp. 393-406. Zbl0618.03015MR858236
12. 12. J. E. PIN, Variétés de langages formels, Masson, Paris, 1984. Zbl0636.68093MR752695
13. 13. J. E. PIN, Hiérarchies de contaténation, R.A.I.R.O. Informatique Théorique, 1984, 18, pp. 23-46. Zbl0559.68062MR750449
14. 14. J. G. ROSENSTEIN, Linear Orderings, Academic Press, New York, 1982. Zbl0488.04002MR662564
15. 15. M. P. SCHÜTZENBERGER, On Finite Monoids having only Trivial Subgroups, Information and Control, 1965, 8, pp. 190-194. Zbl0131.02001MR176883
16. 16. I. SIMON, Piecewise Testable Events, Proc. 2nd GI Conference, Lectures Notes in Comput Sci., Springer Verlag, Berlin, 1975, 33, pp. 214-222. Zbl0316.68034MR427498
17. 17. H. STRAUBING, A Generalization of the Schützenberger Product of Finite Monoids, Theoretical Comput Sci., 1981, 13, pp. 137-150. Zbl0456.20048MR594057
18. 18. H. STRAUBING, Finite Semigroup Varieties of the Form V*D, J. of Pure and Applied Algebra, 1985, 36, pp. 53-94. Zbl0561.20042MR782639
19. 19. H. STRAUBING, Semigroups and Languages of Dot-Depth Two, Proc. 13th ICALP, Lecture Notes in Comput. Sci., Springer Verlag, New York, 1986, 226, pp. 416- 423. Zbl0596.68056MR864704
20. 20. W. THOMAS, Classifying Regular Events in Symbolic Logic, J. Comp. Sys. Sci., 1982, 25, pp. 360-376. Zbl0503.68055MR684265
21. 21. W. THOMAS, An Application of the Ehrenfeucht-Fraissé Game in Formal Language Theory, Bull. Soc. Math. de France, 2e série, Mémoire, 1984, No. 16, pp. 11-21. Zbl0558.68064MR792490
22. 22. B. TILSON, Categories as Algebra, J. of Pure and Applied Algebra, 1987, 48, pp. 83-198. Zbl0627.20031MR915990

1. F. Blanchet-Sadri, Equations on the semidirect product of a finite semilattice by a $𝒥$-trivial monoid of height $k$
2. F. Blanchet-Sadri, On semidirect and two-sided semidirect products of finite $𝒥$trivial monoids
3. Jean-Eric Pin, Pascal Weil, A conjecture on the concatenation product
4. Jean-Eric Pin, Pascal Weil, A conjecture on the concatenation product