Languages of nilpotent and solvable groups (extended abstract)

  • Denis Thérien
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)


Normal Subgroup Nilpotent Group Homomorphic Image Solvable Group Finite Index 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. J.A. Brzozowski & I. Simon, Characterizations of locally testable events, Discrete Mathematics 4 (1973) 243–271.Google Scholar
  2. J.A. Brzozowski & F.E. Fich, Languages of R-trivial monoids, Research Report CS-78-32, Department of Computer Science, University of Waterloo, Ont., Canada, 1978.Google Scholar
  3. S. Eilenberg, "Automata, Languages and Machines", Volume B, Academic Press, New York, 1976.Google Scholar
  4. A. Ginzburg, "Algebraic Theory of Automata", Academic Press, New York, 1968.Google Scholar
  5. R. McNaughton, Algebraic decision procedures for local testability, Mathematical Systems Theory 8 (1974), 60–76.Google Scholar
  6. M.P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control 8 (1965), 190–194.Google Scholar
  7. I. Simon, Piecewise testable events, in Lecture Notes in Computer Science 33, Springer-Verlag, New York, 1975.Google Scholar
  8. H. Straubing, Families of regular sets corresponding to certain varieties of finite monoids, Research Report from the Department of Mathematics, University of California, Berkeley, California, 1978.Google Scholar
  9. D. Thérien, Languages of Nilpotent and Solvable Groups, Research Report CS-78-44, Department of Computer Science, University of Waterloo, Ont., Canada 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Denis Thérien
    • 1
  1. 1.School of Computer ScienceMcGill UniversityMontreal

Personalised recommendations