Preview
Unable to display preview. Download preview PDF.
Bibliography
J.A. Brzozowski & I. Simon, Characterizations of locally testable events, Discrete Mathematics 4 (1973) 243–271.
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.
S. Eilenberg, "Automata, Languages and Machines", Volume B, Academic Press, New York, 1976.
A. Ginzburg, "Algebraic Theory of Automata", Academic Press, New York, 1968.
R. McNaughton, Algebraic decision procedures for local testability, Mathematical Systems Theory 8 (1974), 60–76.
M.P. Schützenberger, On finite monoids having only trivial subgroups, Information and Control 8 (1965), 190–194.
I. Simon, Piecewise testable events, in Lecture Notes in Computer Science 33, Springer-Verlag, New York, 1975.
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.
D. Thérien, Languages of Nilpotent and Solvable Groups, Research Report CS-78-44, Department of Computer Science, University of Waterloo, Ont., Canada 1978.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thérien, D. (1979). Languages of nilpotent and solvable groups (extended abstract). In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_49
Download citation
DOI: https://doi.org/10.1007/3-540-09510-1_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09510-1
Online ISBN: 978-3-540-35168-9
eBook Packages: Springer Book Archive