This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brzozowski J.A., (1975)1, Run languages, Bericht Nr.87, Institut für Rechner-und Programstructuren, Gesellschaft für Matematik und Datenverarbeitung mbH, Bonn, Germany, 17 pp.
Brzozowski J.A., (1975)2, On aperiodic I-monoids, Technical Report, University of Waterloo, Waterloo, Ont., Canada.
Brzozowski J.A., (1976), Hiererchies of aperiodic Languages, Revue Francaise d'Automatique, Informatique, Recherche Operetionnelle Série Rouge (Informatique Théorique)—to appear in no. 3.
Brzozowski J.A., Knast R., (1976), The dot-depth hiererchy of star free languages is infinite, Technical Report, University of Waterloo, Waterloo, Canada.
Brzozowski J.A., Simon I., (1973), Characterizations of locally testable events, Discrete Mathematics, vol. 4, pp. 243–271.
Cohen R.S., Brzozowski J.A. (1971), Dot-depth of star-free events, J. Computer and System Sc., vol. 5, pp. 1–16.
Eilenberg S. (1974), Automata, languages, and machines, vol. A, New York, Academic Press, (1976) vol. B (in press)
Ginzburg A., (1966), About some properties of definite, reverse definite and related automata, IEEE Trans. Electronic Computers EC-15, pp. 806–810.
Knast R., (1975), Semigroups characterization of dot-depth one languages, unpublished manuscript.
Knast R., (1976), Periodic and strictly periodic local testability, Technical Report, Institute of Mathematics, Polish Academy of Sciences, Poznań, Poland.
McNaughton R., (1974), Algebraic decision procedures for local testability, Math. Systems Theory, vol. 8, pp. 60–76.
McNaughton R., Papert S., (1971), Counter-free automata, Cambridge, The MIT Press (MIT Research Monographs, 65).
Perrin D., (1971), Sur certains semigroupes syntaxiques, Séminaires de 'IRIA, Logiques et Automates, pp. 169–177.
Schutzenberger M.P., (1965), On finite monoids having only trivial subgroups, Inform. and Control, vol. 8. pp. 190–194.
Schützenberger M.P., (1966), On a family of sets related to McNaughton's L-language, “Automata Theory”, edited by E.R. Caianiello, New York, Academic Press. pp. 320–324.
Simon I., (1972), Hierarchies of events with dot-depth one, Ph.D. Thesis, Dept. of Applied Analysis and Computer Science, University of Waterloo, Waterloo, Ont., Canada.
Simon I., (1975), Piecewise testable events, 2nd GI-Professional Conference on Automata Theory and Formal Languages, Kaiserlautern, Germany. (To appear in Lecture Notes in Computer Science, Springer-Verlag, Berlin).
Zalcstein Y., (1972), Locally testable languages, J. Computer and System Sc., vol. 6. pp. 151–167.
Zalcstein Y., (1973)1, Locally testable semigroups, Semigroup Forum, vol. 5. pp. 216–227.
Zalcstein Y., (1973)2, Syntactic semigroups of some classes of star-free languages, "Automata, Languages and Programming", Proceedings of a Symposium, Rocquencourt, Amsterdam, North-Holland Publishing Company, pp. 135–144.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Knast, R. (1976). Semigroup characterizations of some language varieties. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_205
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_205
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive