Constructing a finite automaton for a given regular expression
Ernst L. Leiss · ACM SIGACT News · 1980
article Free Access Share on Constructing a finite automaton for a given regular expression Author: Ernst Leiss University of Houston, Houston, Texas University of Houston, Houston, TexasView Profile Authors Info & Claims ACM SIGACT NewsVolume 12Issue 3Fall 1980 pp 81–87https://doi.org/10.1145/1008861.1008870Published:01 September 1980Publication History 10citation707DownloadsMetricsTotal Citations10Total Downloads707Last 12 Months16Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF