Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Derivatives of Regular Expressions

Published: 01 October 1964 Publication History
First page of PDF

References

[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.
[2]
Coet, I. M.; ELGOT C, C.; AND WRIGT, J.B. Realization of events by logical nets. J. ACM 5 (Apr. 1958), 181--196.
[3]
McNAuGHrON, R. aND YaADA, H. Regular expressions aM state graphs for automats. IRE Trans. EC-9 (Mar. 1960), 39--47.
[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).
[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).
[6]
OTT, G. H.ND FEtNSTEIN, N.H. Design of sequential mtehines from their regular expressions, J. ACM 8 (Oct. 1961), 585--600.
[7]
LEE, C, Y. Automata and finite automat, Bell Sqstem Tech. J. 89 (Sept. 1960), 1267- 1295.
[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.
[9]
MYHILL, J. Finite automata and representatAon of events. WADC, Teeh. Ilep. 57-624, 1957.
[10]
RABIN, M. O. aND SCOTT, D. Finite automata and their decision problems. IBM J. Reg. Develop. 3 (Apr. 1959), 114-125.
[11]
MOORE, E .F . Gedanken experiments on sequential machines. In Auloata Shtdies, Ann. of Math. Studies No. 34, Princeton U. Press, 1956, 129-.153.
[12]
MEALY, G.H. A method for synthesizing sequential circuits. Bell System. Tech. J 34 (Sept. 1955), 1045--1079.
[13]
HUFFMaN, D. A. The synthesis of sequential switching circuits. J. FranKclin Inst.2 57 (Mar., Apr. 1954), 161-190, 275-303.
[14]
RNEV, G.N. SequentiM functions. J. ACM 5 (Apr. 1958), 177.
[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.

Cited By

View all
  • (2024)A Coq Mechanization of JavaScript Regular Expression SemanticsProceedings of the ACM on Programming Languages10.1145/36746668:ICFP(1003-1031)Online publication date: 15-Aug-2024
  • (2024)A Completeness Theorem for Probabilistic Regular ExpressionsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662084(1-14)Online publication date: 8-Jul-2024
  • (2024)Stream TypesProceedings of the ACM on Programming Languages10.1145/36564348:PLDI(1412-1436)Online publication date: 20-Jun-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM
Journal of the ACM  Volume 11, Issue 4
Oct. 1964
130 pages
ISSN:0004-5411
EISSN:1557-735X
DOI:10.1145/321239
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 October 1964
Published in JACM Volume 11, Issue 4

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)958
  • Downloads (Last 6 weeks)117
Reflects downloads up to 30 Aug 2024

Other Metrics

Citations

Cited By

View all
  • (2024)A Coq Mechanization of JavaScript Regular Expression SemanticsProceedings of the ACM on Programming Languages10.1145/36746668:ICFP(1003-1031)Online publication date: 15-Aug-2024
  • (2024)A Completeness Theorem for Probabilistic Regular ExpressionsProceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science10.1145/3661814.3662084(1-14)Online publication date: 8-Jul-2024
  • (2024)Stream TypesProceedings of the ACM on Programming Languages10.1145/36564348:PLDI(1412-1436)Online publication date: 20-Jun-2024
  • (2024)Daedalus: Safer Document ParsingProceedings of the ACM on Programming Languages10.1145/36564108:PLDI(816-840)Online publication date: 20-Jun-2024
  • (2024)Lean Formalization of Extended Regular Expression Matching with LookaroundsProceedings of the 13th ACM SIGPLAN International Conference on Certified Programs and Proofs10.1145/3636501.3636959(118-131)Online publication date: 9-Jan-2024
  • (2024)Efficient Matching of Regular Expressions with Lookaround AssertionsProceedings of the ACM on Programming Languages10.1145/36329348:POPL(2761-2791)Online publication date: 5-Jan-2024
  • (2024)Bilaterally Colored Finite Automata and their Regular Expressions with Application to Context-Free Parsing2024 3rd International Conference on Computer Technologies (ICCTech)10.1109/ICCTech61708.2024.00018(39-47)Online publication date: 1-Feb-2024
  • (2024)Monadic Expressions and Their DerivativesRAIRO - Theoretical Informatics and Applications10.1051/ita/202301458(6)Online publication date: 15-Mar-2024
  • (2024)Knuth–Morris–Pratt illustratedJournal of Functional Programming10.1017/S095679682400001734Online publication date: 30-Jan-2024
  • (2024)Expressive completeness by separation for discrete time interval temporal logic with expanding modalitiesInformation Processing Letters10.1016/j.ipl.2024.106480186:COnline publication date: 1-Aug-2024
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media