Languages of dot-depth 3/2

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 555-566

  Glaßer, Christian ^a   Schmitz, Heinz ^a  

^a UNIVERSITY OF WÜRZBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

ALGEBRAIC INTERPRETATIONS; DETERMINISTIC FINITE AUTOMATA; DOT-DEPTH; DOT-DEPTH HIERARCHY; MEMBERSHIP PROBLEM; SYMBOLIC LOGIC; TRANSITION GRAPHS;

ARTIFICIAL INTELLIGENCE;

EID: 22844453595     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_46     Document Type: Conference Paper

References (24)

1. M. Arfi. Opérations polynomiales et hiérarchies de concaténation. Theoretical Computer Science, 91:71-84, 1991.
2. J. A. Brzozowski and R. Knast. The dot-depth hierarchy of star-free languages is infinite. Journal of Computer and System Sciences, 16:37-55, 1978.
3. J. A. Brzozowski. Hierarchies of aperiodic languages. RAIRO Inform. Theor., 10:33-49, 1976.
4. R. S. Cohen and J. A. Brzozowski. Dot-depth of star-free events. Journal of Computer and System Sciences, 5:1-16, 1971.
5. C. Choffrut and J. Karhumäki. Combinatorics of words. In G.Rozenberg and A.Salomaa, editors, Handbook of formal languages, volume I, pages 329-438. Springer, 1996.
6. C. Glaér. A normalform for classes of concatenation hierarchies. Technical Report 216, Inst. für Informatik, Univ. Würzburg, 1998.
7. C. Glaér and H. Schmitz. Languages of dot-depth 3/2. Technical Report 243, Inst. für Informatik, Univ. Würzburg, 1999.
8. K. Hashiguchi. Representation theorems on regular languages. Journal of Computer and System Sciences, 27:101-115, 1983.
9. G. Higman. Ordering by divisibility in abstract algebras. In Proc. London Math. Soc., volume 3, pages 326-336, 1952.
10. R. Knast. A semigroup characterization of dot-depth one languages. RAIRO Inform. Théor., 17:321-330, 1983.
11. R. McNaughton and S. Papert. Counterfree Automata. MIT Press, Cambridge, 1971.
12. J. E. Pin. A variety theorem without complementation. Russian Math., 39:74-83, 1995.
13. J. E. Pin. Syntactic semigroups. In G.Rozenberg and A.Salomaa, editors, Handbook of formal languages, volume I, pages 679-746. Springer, 1996.
14. D. Perrin and J. E. Pin. First-order logic and star-free sets. Journal of Computer and System Sciences, 32:393-406, 1986.
15. J. E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of computing systems, 30:383-422, 1997.
16. I. Simon. Hierarchies of events with dot-depth one. PhD thesis, University of Waterloo, 1972.
17. I. Simon. Factorization forests of finite height. Theoretical Computer Science, 72:65-94, 1990.
18. J. Sakarovitch and I. Simon. Subwords. In M. Lothaire, editor, Combinatorics on Words, Encyclopedia of mathematics and its applications, pages 105-142. Addison-Wesley, 1983.
19. J. Stern. Characterizations of some classes of regular events. Theoretical Computer Science, 35:17-42, 1985.
20. H. Straubing. A generalization of the Schützenberger product of finite monoids. Theoretical Computer Science, 13:137-150, 1981.
21. H. Straubing. Finite semigroups varieties of the form V * D. J.Pure Appl.Algebra, 36:53-94, 1985.
22. H. Straubing. Semigroups and languages of dot-depth two. Theoretical Computer Science, 58:361-378, 1988.
23. D. Thérien. Classification of finite monoids: the language approach. Theoretical Computer Science, 14:195-208, 1981.
24. W. Thomas. Classifying regular events in symbolic logic. Journal of Computer and System Sciences, 25:360-376, 1982.