Janusz A. Brzozowski
- 1 KIENE, S.C. Representation of events in nerve nets and finite automat, In Autornata Studies, Ann, Math. Studies No. 34, Princeton U. Press, 1956, 3-41.Google Scholar
- 2 Coet, I. M.; ELGOT C, C.; AND WRIGT, J.B. Realization of events by logical nets. J. ACM 5 (Apr. 1958), 181--196. Google Scholar
- 3 McNAuGHrON, R. aND YaADA, H. Regular expressions aM state graphs for automats. IRE Trans. EC-9 (Mar. 1960), 39--47.Google Scholar
- 4 BRZOZOWSKI, J.A. A survey of regular expressions and their applications. IRE Trans. EC-11 (June 1962), 324-385. (Mso Teeh. Rep. 4, Princeton U., Digital Systems Lab., Apr. 1961).Google Scholar
- 5 BltzozowsKl, J. A. ANt McCIusKEY, E. J. Jn. Signal flow graph techniques for sequential circuit state diagrams. IEEE Trans. EC-I (Apr. 1963), 67-76. (Also Teeh. Iep. 5, Princeton U., Digital Systems Lab., Apr. 196l).Google Scholar
- 6 OTT, G. H.ND FEtNSTEIN, N.H. Design of sequential mtehines from their regular expressions, J. ACM 8 (Oct. 1961), 585--600. Google Scholar
- 7 LEE, C, Y. Automata and finite automat, Bell Sqstem Tech. J. 89 (Sept. 1960), 1267- 1295.Google Scholar
- 8 ARDEN, D.N. Delayed logic and finite state machines. In Theory of Compztting Ms. chine Desiqn, pp. 1-15. U. of Michigan Press, Ann Arbor. 1960.Google Scholar
- 9 MYHILL, J. Finite automata and representatAon of events. WADC, Teeh. Ilep. 57-624, 1957.Google Scholar
- 10 RABIN, M. O. aND SCOTT, D. Finite automata and their decision problems. IBM J. Reg. Develop. 3 (Apr. 1959), 114-125.Google Scholar
- 11 MOORE, E .F . Gedanken experiments on sequential machines. In Auloata Shtdies, Ann. of Math. Studies No. 34, Princeton U. Press, 1956, 129-.153.Google Scholar
- 12 MEALY, G.H. A method for synthesizing sequential circuits. Bell System. Tech. J 34 (Sept. 1955), 1045--1079.Google Scholar
- 13 HUFFMaN, D. A. The synthesis of sequential switching circuits. J. FranKclin Inst.2 57 (Mar., Apr. 1954), 161-190, 275-303.Google Scholar
- 14 RNEV, G.N. SequentiM functions. J. ACM 5 (Apr. 1958), 177.Google Scholar
- 15 ELGOa, C. C. aND RUrLEDa, J. D. Operations on finite automata. Proe. AIEE Second Ann. Symp. on Switching Circuit Theory and Logical Design, Detroit, Mich., Oct. 1961.Google Scholar
Index Terms
- Derivatives of Regular Expressions
Recommendations
Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions
The aim of this paper is to design a polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the ...
Derivatives and partial derivatives for regular shuffle expressions
AbstractThere is a rich variety of shuffling operations ranging from asynchronous interleaving to various forms of synchronizations. We introduce a general shuffling operation which subsumes earlier forms of shuffling. We further extend the ...
Comments