{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T18:23:15Z","timestamp":1649096595209},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1007\/bf01840364","type":"journal-article","created":{"date-parts":[[2005,6,29]],"date-time":"2005-06-29T03:41:00Z","timestamp":1120016460000},"page":"283-314","source":"Crossref","is-referenced-by-count":0,"title":["Algorithms for the compilation of regular expressions into PLAs"],"prefix":"10.1007","volume":"2","author":[{"given":"Anna R.","family":"Karlin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Howard W.","family":"Trickey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey D.","family":"Ullman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840364_CR1","first-page":"963","volume":"25","author":"T. Agerwala","year":"1976","unstructured":"T. Agerwala, Microprogram optimization: a survey,IEEE Trans. Comput. 25 (1976), 963\u2013973.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840364_CR2","doi-asserted-by":"crossref","unstructured":"A. V. Aho, J. D. Ullman, and M. Yannakakis, Modeling communications protocols by automata,Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 267\u2013273.","DOI":"10.1109\/SFCS.1979.23"},{"key":"BF01840364_CR3","unstructured":"R. K. Brayton, G. D. Hachtel, L. A. Hemachandra, A. R. Newton, and A. L. M. Sangiovanni-Vincentelli, A comparison of logic minimization strategies using EXPRESSO: an APL program package for partitioned logic minimalization,Proceedings of the IEEE International Conference on Circuits and'Computers, 1982."},{"key":"BF01840364_CR4","volume-title":"Logic Design of Digital Systems","author":"D. Dietmeyer","year":"1971","unstructured":"D. Dietmeyer,Logic Design of Digital Systems, Allyn and Bacon, Reading, MA, 1971."},{"key":"BF01840364_CR5","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/322326.322327","volume":"29","author":"R. W. Floyd","year":"1982","unstructured":"R. W. Floyd and J. D. Ullman, The compilation of regular expressions into integrated circuits,J. Assoc. Comput. Mach.,29 (1982), 603\u2013622.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01840364_CR6","first-page":"75","volume-title":"VLSI-81","author":"M. J. Foster","year":"1981","unstructured":"M. J. Foster and H.-T. Kung, Recognize regular languages with programmable building blocks, inVLSI-81 (J. P. Gray, ed.), Academic Press, New York, 1981, pp. 75\u201384."},{"key":"BF01840364_CR7","volume-title":"Ph.D. Thesis","author":"R. L. Haskin","year":"1980","unstructured":"R. L. Haskin, Hardware for searching very large text databases, Ph.D. Thesis, Department of Computer Science, University of Illinois, Urbana, Il, 1980."},{"key":"BF01840364_CR8","volume-title":"GRY: a PLA minimizer","author":"L. A. Hemachandra","year":"1982","unstructured":"L. A. Hemachandra, GRY: a PLA minimizer, Unpublished Memorandum, Department of Computer Science, Stanford University, Stanford, CA, 1982."},{"key":"BF01840364_CR9","unstructured":"J. L. Hennessy, SLIM: a simulation and implementation language for VLSI microcode,LAMBDA, April, 1981, pp. 20\u201328."},{"key":"BF01840364_CR10","unstructured":"D. D. Hill, ADLIB: a modular, strongly-typed computer design language,Proceedings of the Fourth International Symposium on Computer Hardware Description Languages, 1979."},{"key":"BF01840364_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman,Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA, 1979."},{"key":"BF01840364_CR12","doi-asserted-by":"crossref","unstructured":"S. C. Johnson, Code generation for silicon,Proceedings of the Tenth ACM Symposium on Principles of Programming Languages, 1983.","DOI":"10.1145\/567067.567070"},{"key":"BF01840364_CR13","volume-title":"Introduction to VLSI Systems","author":"C. A. Mead","year":"1980","unstructured":"C. A. Mead and L. A. Conway,Introduction to VLSI Systems, Addison-Wesley, Reading, MA, 1980."},{"key":"BF01840364_CR14","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1109\/TCAD.1982.1270012","volume":"1","author":"A. W. Nagle","year":"1982","unstructured":"A. W. Nagle, R. Cloutier, and A. C. Parker, Synthesis of hardware for the control of digital systems,IEEE Trans. Computer-Aided Design Integrated Circuits and Systems,1 (1982), 201\u2013212.","journal-title":"IEEE Trans. Computer-Aided Design Integrated Circuits and Systems"},{"key":"BF01840364_CR15","first-page":"863","volume":"32","author":"C. D. V. P. Rao","year":"1983","unstructured":"C. D. V. P. Rao and N. N. Biswas, On the minimization of wordwidth in the control memory of a microprogrammed digital computer,IEEE Trans. Comput.,32 (1983), 863\u2013868.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840364_CR16","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TC.1982.1676033","volume":"31","author":"H. W. Trickey","year":"1982","unstructured":"H. W. Trickey, Good layouts for pattern recognizers,IEEE Trans. Comput.,31 (1982), 514\u2013520.","journal-title":"IEEE Trans. Comput."},{"key":"BF01840364_CR17","volume-title":"Using NFAs for hardware design","author":"H. W. Trickey","year":"1982","unstructured":"H. W. Trickey, Using NFAs for hardware design, Unpublished Memorandum, Stanford University, Stanford, CA, 1982."},{"key":"BF01840364_CR18","volume-title":"Combining state machines with regular expressions for automatic synthesis of VLSI circuits, STAN-CS-82-927","author":"J. D. Ullman","year":"1982","unstructured":"J. D. Ullman, Combining state machines with regular expressions for automatic synthesis of VLSI circuits, STAN-CS-82-927, Department of Computer Science, Stanford University, Stanford, CA, 1982."},{"key":"BF01840364_CR19","volume-title":"Computational Aspects of VLSI","author":"J. D. Ullman","year":"1984","unstructured":"J. D. Ullman,Computational Aspects of VLSI, Computer Science Press, Rockville, MD, 1984."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840364.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840364\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840364","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T19:35:30Z","timestamp":1557430530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840364"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":19,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["BF01840364"],"URL":"https:\/\/doi.org\/10.1007\/bf01840364","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}