[1] K. Čulík I. Havel: On multiple finite automata. (In print.)

[2] N. Chomsky: Chapters 1.1 -1.3 in Handbook of Math. Psychology. John Wiley 1963. Zbl 0156.25303

[3] N. Chomsky M. P. Schützenberger: The algebraic theory of context-free languages. In Computer programming and Formal systems. North-Holland 1963. MR 0152391

[4] K. Čulík: Some notes on finite state languages and events represented by finite automata using labelled graphs. Časopis pro pěstování matematiky 86 (1961), 1, 43 - 55. MR 0130062

[5] S. Ginsburg J. S. Ullian: Ambiguity in contex free languages. J. of ACM 13 (1966), 1, 62-89. MR 0219363

[6] B. H. Глyшкoв: Cинтeз цифpoвыx aвтoмaтoв. Физмaтгиз, Mocквa 1962.

[7] E. F. Moore: Gedankenexperimente on sequential machines. In Automata studies, Princeton 1956.

[8] C. C. Elgot J. E. Mezei: On relations defined by generalized automata. IBM J. of Res. and Develop 9 (1965), 1, 47-68. MR 0216903