%%% -*-BibTeX-*- %%% ==================================================================== %%% BibTeX-file{ %%% author = "Nelson H. F. Beebe", %%% version = "1.206", %%% date = "07 June 2024", %%% time = "18:27:20 MDT", %%% filename = "string-matching.bib", %%% address = "University of Utah %%% Department of Mathematics, 110 LCB %%% 155 S 1400 E RM 233 %%% Salt Lake City, UT 84112-0090 %%% USA", %%% telephone = "+1 801 581 5254", %%% FAX = "+1 801 581 4148", %%% URL = "https://www.math.utah.edu/~beebe", %%% checksum = "39721 79402 366042 3814000", %%% email = "beebe at math.utah.edu, beebe at acm.org, %%% beebe at computer.org (Internet)", %%% codetable = "ISO/ASCII", %%% keywords = "bibliography; BibTeX; pattern matching; %%% regular expressions; string matching", %%% license = "public domain", %%% supported = "yes", %%% docstring = "This is a bibliography of publications on %%% the subjects of pattern matching, regular %%% expressions, and string matching. %%% %%% At version 1.206, the year coverage looked %%% like this: %%% %%% 1956 ( 2) 1979 ( 18) 2002 ( 64) %%% 1957 ( 0) 1980 ( 11) 2003 ( 42) %%% 1958 ( 2) 1981 ( 18) 2004 ( 36) %%% 1959 ( 2) 1982 ( 16) 2005 ( 32) %%% 1960 ( 1) 1983 ( 21) 2006 ( 49) %%% 1961 ( 1) 1984 ( 16) 2007 ( 56) %%% 1962 ( 2) 1985 ( 28) 2008 ( 69) %%% 1963 ( 1) 1986 ( 30) 2009 ( 56) %%% 1964 ( 3) 1987 ( 29) 2010 ( 51) %%% 1965 ( 1) 1988 ( 32) 2011 ( 44) %%% 1966 ( 0) 1989 ( 46) 2012 ( 80) %%% 1967 ( 1) 1990 ( 55) 2013 ( 86) %%% 1968 ( 2) 1991 ( 50) 2014 ( 61) %%% 1969 ( 3) 1992 ( 89) 2015 ( 64) %%% 1970 ( 3) 1993 ( 89) 2016 ( 50) %%% 1971 ( 4) 1994 ( 108) 2017 ( 68) %%% 1972 ( 4) 1995 ( 78) 2018 ( 43) %%% 1973 ( 4) 1996 ( 69) 2019 ( 42) %%% 1974 ( 6) 1997 ( 62) 2020 ( 35) %%% 1975 ( 5) 1998 ( 51) 2021 ( 35) %%% 1976 ( 9) 1999 ( 54) 2022 ( 34) %%% 1977 ( 19) 2000 ( 41) 2023 ( 44) %%% 1978 ( 9) 2001 ( 64) 2024 ( 8) %%% 19xx ( 2) %%% 20xx ( 2) %%% %%% Article: 1879 %%% Book: 87 %%% InBook: 1 %%% InCollection: 11 %%% InProceedings: 151 %%% Manual: 1 %%% MastersThesis: 2 %%% Misc: 13 %%% PhdThesis: 3 %%% Proceedings: 122 %%% TechReport: 41 %%% Unpublished: 1 %%% %%% Total entries: 2312 %%% %%% The checksum field above contains a CRC-16 %%% checksum as the first value, followed by the %%% equivalent of the standard UNIX wc (word %%% count) utility output of lines, words, and %%% characters. This is produced by Robert %%% Solovay's checksum utility.", %%% } %%% ====================================================================

@Preamble{ "\ifx \undefined \booktitle \def \booktitle #1{{{\em #1}}} \fi" # "\ifx \undefined \k \let \k = \c \fi" # "\ifx \undefined \pkg \def \pkg #1{{{\tt #1}}} \fi" # "\ifx \undefined \polhk \let \polhk = \k \fi" # "\ifx \undefined \soft \def \soft{'} \fi" }

%%% ==================================================================== %%% Acknowledgement abbreviations:

@String{ack-nhfb= "Nelson H. F. Beebe, University of Utah, Department of Mathematics, 110 LCB, 155 S 1400 E RM 233, Salt Lake City, UT 84112-0090, USA, Tel: +1 801 581 5254, FAX: +1 801 581 4148, e-mail: \path|beebe@math.utah.edu|, \path|beebe@acm.org|, \path|beebe@computer.org| (Internet), URL: \path|https://www.math.utah.edu/~beebe/|"} @String{ack-r-project= "R Project Team"}

%%% ==================================================================== %%% Institution abbreviations:

@String{inst-ATT-BELL= "AT\&T Bell Laboratories"} @String{inst-ATT-BELL:adr= "Murray Hill, NJ, USA"} @String{inst-CLSC= "College of Science Computer, University of Utah"} @String{inst-CLSC:adr= "Salt Lake City, UT 84112, USA"} @String{inst-CSRC= "Computing Sciences Research Center, Bell Laboratories"} @String{inst-CSRC:adr= "Murray Hill, NJ, USA"} @String{inst-MUPAD= "MuPAD Research Group"} @String{inst-MUPAD:adr= "Universit{\"a}t Paderborn, Paderborn, Germany"} @String{inst-SRC-IDA= "Supercomputing Research Center: IDA"} @String{inst-SRC-IDA:adr= "Lanham, MD, USA"} @String{inst-STAN-CS= "Stanford University, Department of Computer Science"} @String{inst-STAN-CS:adr= "Stanford, CA, USA"} @String{inst-UIUC-CSRD= "University of Illinois at Urbana-Champaign, Center for Supercomputing Research and Development"} @String{inst-UIUC-CSRD:adr= "Urbana, IL 61801, USA"} @String{inst-UTAH-MATH= "University of Utah, Department of Mathematics"} @String{inst-UTAH-MATH:adr= "Salt Lake City, UT 84112-0090, USA"}

%%% ==================================================================== %%% Journal abbreviations:

@String{j-ACM-COMM-COMP-ALGEBRA= "ACM Communications in Computer Algebra"} @String{j-ACM-J-EXP-ALGORITHMICS= "ACM Journal of Experimental Algorithmics"} @String{j-ACTA-INFO= "Acta Informatica"} @String{j-ADV-APPL-PROB= "Advances in Applied Probability"} @String{j-ALGORITHMICA= "Algorithmica"} @String{j-ALGORITHMS-BASEL= "Algorithms ({Basel})"} @String{j-AMER-MATH-MONTHLY= "American Mathematical Monthly"} @String{j-ANN-APPL-PROBAB= "Annals of Applied Probability"} @String{j-ANN-INST-HENRI-POINCARE-PROBAB-STATIST= "Annales de l'Institut Henri Poincar{\'e}. Probabilit{\'e}s et Statistiques"} @String{j-ANN-MATH-STUDIES= "Annals of Mathematics Studies"} @String{j-ANN-PROBAB= "Annals of Probability"} @String{j-APPL-MATH-COMP= "Applied Mathematics and Computation"} @String{j-ATT-TECH-J= "AT\&T Technical Journal"} @String{j-BELL-SYST-TECH-J= "The Bell System Technical Journal"} @String{j-BULL-MATH-BIOL= "Bulletin of Mathematical Biology"} @String{j-BYTE= "Byte Magazine"} @String{j-CACM= "Communications of the Association for Computing Machinery"} @String{j-CCCUJ= "C/C++ Users Journal"} @String{j-CCPE= "Concurrency and Computation: Prac\-tice and Experience"} @String{j-CELL-SYST= "Cell Systems"} @String{j-CGF= "Computer Graphics Forum"} @String{j-COMBIN-PROBAB-COMPUT= "Combinatorics, Probability and Computing"} @String{j-COMP-ARCH-NEWS= "ACM SIGARCH Computer Architecture News"} @String{j-COMP-J= "The Computer Journal"} @String{j-COMP-LANG-MAG= "Computer Language Magazine"} @String{j-COMP-LANGS= "Computer Languages"} @String{j-COMP-NET-AMSTERDAM= "Computer Networks (Amsterdam, Netherlands: 1999)"} @String{j-COMP-SURV= "ACM Computing Surveys"} @String{j-COMP-VIS-IMAGE-UNDERSTANDING= "Computer Vision and Image Understanding: CVIU"} @String{j-COMPUT-MATH-APPL= "Computers and Mathematics with Applications"} @String{j-COMPUT-SECUR= "Computers \& Security"} @String{j-COMPUT-SYST-SCI-ENG= "Computer Systems Science and Engineering"} @String{j-COMPUTER= "Computer"} @String{j-COMPUTERS-AND-GRAPHICS= "Computers and Graphics"} @String{j-COMPUTING= "Computing: Archiv f{\"u}r informatik und numerik"} @String{j-CONG-NUM= "Congressus Numerantium"} @String{j-CRYPTOLOGIA= "Cryptologia"} @String{j-CUJ= "C Users Journal"} @String{j-CVGIP= "Computer Vision, Graphics, and Image Processing"} @String{j-CVGIP-IU= "Computer Vision, Graphics, and Image Processing. Image Understanding"} @String{j-DDJ= "Dr. Dobb's Journal of Software Tools"} @String{j-DEC-TECH-J= "Digital Technical Journal of Digital Equipment Corporation"} @String{j-DISCRETE-APPL-MATH= "Discrete Applied Mathematics"} @String{j-DTRAP= "Digital Threats: Research and Practice (DTRAP)"} @String{j-EMPIR-SOFTWARE-ENG= "Empirical Software Engineering"} @String{j-EPODD= "Electronic Publishing---Origination, Dissemination, and Design"} @String{j-FORM-ASP-COMPUT= "Formal Aspects of Computing"} @String{j-FORTH-DIMENSIONS= "Forth Dimensions"} @String{j-FRONTIERS-EDU-CONF= "Frontiers in Education Conference"} @String{j-FUND-INFO= "Fundamenta Informaticae"} @String{j-FUT-GEN-COMP-SYS= "Future Generation Computer Systems"} @String{j-FUTURE-INTERNET= "Future Internet"} @String{j-HIGHER-ORDER-SYMB-COMPUT= "Higher-Order and Symbolic Computation"} @String{j-IBM-JRD= "IBM Journal of Research and Development"} @String{j-IBM-SYS-J= "IBM Systems Journal"} @String{j-IBM-TDB= "IBM Technical Disclosure Bulletin"} @String{j-IEEE-ACCESS= "IEEE Access"} @String{j-IEEE-COMPUT-ARCHIT-LETT= "IEEE Computer Architecture Letters"} @String{j-IEEE-MICRO= "IEEE Micro"} @String{j-IEEE-SOFTWARE= "IEEE Software"} @String{j-IEEE-TRANS-BIG-DATA= "IEEE Transactions on Big Data"} @String{j-IEEE-TRANS-COMM= "IEEE Transactions on Communications"} @String{j-IEEE-TRANS-COMPUT= "IEEE Transactions on Computers"} @String{j-IEEE-TRANS-ELEC-COMPUT= "IEEE Transactions on Electronic Computers"} @String{j-IEEE-TRANS-EMERG-TOP-COMPUT= "IEEE Transactions on Emerging Topics in Computing"} @String{j-IEEE-TRANS-KNOWL-DATA-ENG= "IEEE Transactions on Knowledge and Data Engineering"} @String{j-IEEE-TRANS-NETWORKING= "IEEE\slash ACM Transactions on Networking"} @String{j-IEEE-TRANS-PAR-DIST-SYS= "IEEE Transactions on Parallel and Distributed Systems"} @String{j-IEEE-TRANS-SOFTW-ENG= "IEEE Transactions on Software Engineering"} @String{j-IEEE-TRANS-VIS-COMPUT-GRAPH= "IEEE Transactions on Visualization and Computer Graphics"} @String{j-INF-COMPUT= "Information and Computation"} @String{j-INF-CONTROL= "Information and Control"} @String{j-INFO-PROC-LETT= "Information Processing Letters"} @String{j-INFO-SCI= "Information Sciences"} @String{j-INT-J-COMP-PROC-ORIENTAL-LANG= "International Journal of Computer Processing of Oriental Languages (IJCPOL)"} @String{j-INT-J-COMPUT-APPL= "International Journal of Computer Applications"} @String{j-INT-J-COMPUT-INF-SCI= "International Journal of Computer and Information Sciences"} @String{j-INT-J-COMPUT-SYST-SCI-ENG= "International Journal of Computer Systems Science and Engineering"} @String{j-INT-J-DIGIT-LIBR= "International Journal on Digital Libraries"} @String{j-INT-J-FOUND-COMP-SCI= "International Journal of Foundations of Computer Science (IJFCS)"} @String{j-INT-J-IMAGE-GRAPHICS= "International Journal of Image and Graphics (IJIG)"} @String{j-INT-J-INFO-SEC= "International Journal of Information Security"} @String{j-INT-J-INTELL-SYSTEMS= "International Journal of Intelligent Systems"} @String{j-INT-J-PAR-EMER-DIST-SYS= "International Journal of Parallel, Emergent and Distributed Systems: IJPEDS"} @String{j-INT-J-PARALLEL-PROG= "International Journal of Parallel Programming"} @String{j-INT-J-SOFTW-TOOLS-TECHNOL-TRANSFER= "International Journal on Software Tools for Technology Transfer (STTT)"} @String{j-IRE-TRANS-ELEC-COMPUT= "IRE Transactions on Electronic Computers"} @String{j-ISIS= "Isis"} @String{j-J-ACM= "Journal of the Association for Computing Machinery"} @String{j-J-ALG= "Journal of Algorithms"} @String{j-J-AM-SOC-INF-SCI= "Journal of the American Society for Information Science"} @String{j-J-AM-SOC-INF-SCI-TECHNOL= "Journal of the American Society for Information Science and Technology: JASIST"} @String{j-J-APPL-STAT= "Journal of Applied Statistics"} @String{j-J-AUTOM-REASON= "Journal of Automated Reasoning"} @String{j-J-COMP-SECUR= "Journal of Computer Security"} @String{j-J-COMP-SYS-SCI= "Journal of Computer and System Sciences"} @String{j-J-COMPUT-APPL-MATH= "Journal of Computational and Applied Mathematics"} @String{j-J-COMPUT-BIOL= "Journal of Computational Biology"} @String{j-J-COMPUT-CHEM= "Journal of Computational Chemistry"} @String{j-J-CRYPTOLOGY= "Journal of Cryptology"} @String{j-J-DISCR-MATH-SCI-CRYPTO= "Journal of Discrete Mathematical Sciences and Cryptography"} @String{j-J-FUNCT-PROGRAM= "Journal of Functional Programming"} @String{j-J-GRID-COMP= "Journal of Grid Computing"} @String{j-J-INF-PROCESS= "Journal of Information Processing"} @String{j-J-INFO-PROC-SOC-JAPAN= "Journal of the Information Processing Society of Japan = Joho Shori"} @String{j-J-INFO-SEC-APPL= "Journal of Information Security and Applications (JISA)"} @String{j-J-MATH-BIOL= "Journal of Mathematical Biology"} @String{j-J-NETW-COMPUT-APPL= "Journal of Network and Computer Applications"} @String{j-J-OPEN-SOURCE-SOFT= "Journal of Open Source Software"} @String{j-J-PAR-DIST-COMP= "Journal of Parallel and Distributed Computing"} @String{j-J-SOFTW-EVOL-PROC= "Journal of Software: Evolution and Process"} @String{j-J-SOFTW-MAINT= "Journal of Software Maintenance: Research and Practice"} @String{j-J-SOFTW-MAINT-EVOL= "Journal of Software Maintenance and Evolution: Research and Practice"} @String{j-J-SOV-MATH= "Journal of Soviet Mathematics"} @String{j-J-STAT-PHYS= "Journal of Statistical Physics"} @String{j-J-SUPERCOMPUTING= "The Journal of Supercomputing"} @String{j-J-SYMBOLIC-COMP= "Journal of Symbolic Computation"} @String{j-J-SYST-SOFTW= "The Journal of Systems and Software"} @String{j-J-THEOR-BIOL= "Journal of Theoretical Biology"} @String{j-J-UCS= "J.UCS: Journal of Universal Computer Science"} @String{j-JDIQ= "Journal of Data and Information Quality (JDIQ)"} @String{j-JETC= "ACM Journal on Emerging Technologies in Computing Systems (JETC)"} @String{j-JOCCH= "Journal on Computing and Cultural Heritage (JOCCH)"} @String{j-LECT-NOTES-COMP-SCI= "Lecture Notes in Computer Science"} @String{j-LINUX-J= "Linux Journal"} @String{j-LOGIN= ";login:"} @String{j-LOPLAS= "ACM Letters on Programming Languages and Systems"} @String{j-MACH-TRANSL= "Machine Translation"} @String{j-MARKUP-LANG= "Markup languages: theory \& practice"} @String{j-MATH-COMPUT= "Mathematics of Computation"} @String{j-MATH-COMPUT-SCI= "Mathematics in Computer Science"} @String{j-MATHEMATICA-J= "Mathematica Journal"} @String{j-NETWORK-SECURITY= "Network Security"} @String{j-NORDIC-J-COMPUT= "Nordic Journal of Computing"} @String{j-OPER-SYS-REV= "Operating Systems Review"} @String{j-PACMPL= "Proceedings of the ACM on Programming Languages (PACMPL)"} @String{j-PARALLEL-ALGORITHMS-APPL= "Parallel Algorithms and Applications"} @String{j-PARALLEL-COMPUTING= "Parallel Computing"} @String{j-PARALLEL-PROCESS-LETT= "Parallel Processing Letters"} @String{j-PATTERN-RECOGN= "Pattern Recognition"} @String{j-PROBAB-ENGRG-INFORM-SCI= "Probability in the Engineering and Informational Sciences"} @String{j-PROC-VLDB-ENDOWMENT= "Proceedings of the VLDB Endowment"} @String{j-R-JOURNAL= "The R Journal"} @String{j-SCI-COMPUT-PROGRAM= "Science of Computer Programming"} @String{j-SCI-PROG= "Scientific Programming"} @String{j-SCPE= "Scalable Computing: Practice and Experience"} @String{j-SIAM-J-APPL-MATH= "SIAM Journal on Applied Mathematics"} @String{j-SIAM-J-COMPUT= "SIAM Journal on Computing"} @String{j-SIAM-J-DISCR-MATH= "SIAM Journal on Discrete Mathematics"} @String{j-SIAM-J-SCI-STAT-COMP= "SIAM Journal on Scientific and Statistical Computing"} @String{j-SIAM-REVIEW= "SIAM Review"} @String{j-SIGACT= "SIGACT News (ACM Special Interest Group on Automata and Computability Theory)"} @String{j-SIGADA-LETTERS= "ACM SIGADA Ada Letters"} @String{j-SIGAPP= "ACM SIGAPP Applied Computing Review"} @String{j-SIGCSE= "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)"} @String{j-SIGMETRICS= "ACM SIGMETRICS Performance Evaluation Review"} @String{j-SIGMICRO= "ACM SIGMICRO Newsletter"} @String{j-SIGMOD= "SIGMOD Record (ACM Special Interest Group on Management of Data)"} @String{j-SIGPLAN= "ACM SIGPLAN Notices"} @String{j-SIGSAM= "SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation)"} @String{j-SIGSOFT= "ACM SIGSOFT Software Engineering Notes"} @String{j-SOFTWAREX= "SoftwareX"} @String{j-SPE= "Software --- Practice and Experience"} @String{j-STRUCTURED-PROGRAMMING= "Structured programming"} @String{j-SUNEXPERT= "SunExpert Magazine"} @String{j-SUNWORLD-ONLINE= "Sunworld Online"} @String{j-SYS-ADMIN= "Sys Admin: The Journal for UNIX Systems Administrators"} @String{j-SYS-COMP-JAPAN= "Systems and Computers in Japan"} @String{j-TAAS= "ACM Transactions on Autonomous and Adaptive Systems (TAAS)"} @String{j-TACO= "ACM Transactions on Architecture and Code Optimization"} @String{j-TALG= "ACM Transactions on Algorithms"} @String{j-TALIP= "ACM Transactions on Asian Language Information Processing"} @String{j-TALLIP= "ACM Transactions on Asian and Low-Resource Language Information Processing (TALLIP)"} @String{j-TAP= "ACM Transactions on Applied Perception"} @String{j-TCBB= "IEEE\slash ACM Transactions on Computational Biology and Bioinformatics"} @String{j-TEAC= "ACM Transactions on Economics and Computation"} @String{j-TECS= "ACM Transactions on Embedded Computing Systems"} @String{j-THEOR-COMP-SCI= "Theoretical Computer Science"} @String{j-TISSEC= "ACM Transactions on Information and System Security"} @String{j-TIST= "ACM Transactions on Intelligent Systems and Technology (TIST)"} @String{j-TKDD= "ACM Transactions on Knowledge Discovery from Data (TKDD)"} @String{j-TOCHI= "ACM Transactions on Computer-Human Interaction"} @String{j-TOCL= "ACM Transactions on Computational Logic"} @String{j-TOCS= "ACM Transactions on Computer Systems"} @String{j-TOCT= "ACM Transactions on Computation Theory"} @String{j-TODAES= "ACM Transactions on Design Automation of Electronic Systems (TODAES)"} @String{j-TODS= "ACM Transactions on Database Systems"} @String{j-TOG= "ACM Transactions on Graphics"} @String{j-TOIS= "ACM Transactions on Information Systems"} @String{j-TOIT= "ACM Transactions on Internet Technology (TOIT)"} @String{j-TOMM= "ACM Transactions on Multimedia Computing, Communications, and Applications"} @String{j-TOMS= "ACM Transactions on Mathematical Software"} @String{j-TOPC= "ACM Transactions on Parallel Computing (TOPC)"} @String{j-TOPLAS= "ACM Transactions on Programming Languages and Systems"} @String{j-TOS= "ACM Transactions on Storage"} @String{j-TOSEM= "ACM Transactions on Software Engineering and Methodology"} @String{j-TOSN= "ACM Transactions on Sensor Networks"} @String{j-TQC= "ACM Transactions on Quantum Computing (TQC)"} @String{j-TRANS-INFO-PROCESSING-SOC-JAPAN= "Transactions of the Information Processing Society of Japan"} @String{j-TRETS= "ACM Transactions on Reconfigurable Technology and Systems"} @String{j-TSAS= "ACM Transactions on Spatial Algorithms and Systems (TSAS)"} @String{j-TUGboat= "TUGboat"} @String{j-TWEB= "ACM Transactions on the Web (TWEB)"} @String{j-UNIX-REVIEW= "UNIX Review"} @String{j-UNIX-WORLD= "UNIX\slash world"} @String{j-VLDB-J= "VLDB Journal: Very Large Data Bases"}

%%% ==================================================================== %%% Publishers and their addresses:

@String{pub-ACM= "ACM Press"} @String{pub-ACM:adr= "New York, NY 10036, USA"} @String{pub-APRESS= "Apress"} @String{pub-APRESS:adr= "Berkeley, CA, USA"} @String{pub-ASME= "American Society of Mechanical Engineers"} @String{pub-ASME:adr= "345 E. 47th St., New York, NY 10017, USA"} @String{pub-AW= "Ad{\-d}i{\-s}on-Wes{\-l}ey"} @String{pub-AW:adr= "Reading, MA, USA"} @String{pub-CAMBRIDGE= "Cambridge University Press"} @String{pub-CAMBRIDGE:adr= "Cambridge, UK"} @String{pub-CRC= "CRC Press"} @String{pub-CRC:adr= "Boca Raton, FL, USA"} @String{pub-EUROPEN= "EurOpen"} @String{pub-EUROPEN:adr= "Buntingford, Herts, UK"} @String{pub-IBM= "IBM Corporation"} @String{pub-IBM:adr= "Armonk, NY, USA / Poughkeepsie, NY, USA / San Jose, CA, USA / Yorktown Heights, NY, USA"} @String{pub-IEEE= "IEEE Computer Society Press"} @String{pub-IEEE:adr= "1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA"} @String{pub-IEEE-STD= "IEEE"} @String{pub-IEEE-STD:adr= "New York, NY, USA"} @String{pub-MANNING= "Manning Publications"} @String{pub-MANNING:adr= "Greenwich, CT, USA"} @String{pub-MCGRAW-HILL= "Mc{\-}Graw-Hill"} @String{pub-MCGRAW-HILL:adr= "New York, NY, USA"} @String{pub-MIT= "MIT Press"} @String{pub-MIT:adr= "Cambridge, MA, USA"} @String{pub-MORGAN-KAUFMANN= "Morgan Kaufmann Publishers"} @String{pub-MORGAN-KAUFMANN:adr= "San Francisco, CA, USA"} @String{pub-NO-STARCH= "No Starch Press"} @String{pub-NO-STARCH:adr= "San Francisco, CA, USA"} @String{pub-NORTH-HOLLAND= "North-Hol{\-}land"} @String{pub-NORTH-HOLLAND:adr= "Amsterdam, The Netherlands"} @String{pub-ORA= "O'Reilly \& Associates"} @String{pub-ORA:adr= "Sebastopol, CA, USA, and Cambridge, MA, USA"} @String{pub-ORA-MEDIA= "O'Reilly Media"} @String{pub-ORA-MEDIA:adr= "Sebastopol, CA, USA"} @String{pub-OXFORD= "Oxford University Press"} @String{pub-OXFORD:adr= "Walton Street, Oxford OX2 6DP, UK"} @String{pub-PACKT= "Packt Publishing"} @String{pub-PACKT:adr= "Birmingham, UK"} @String{pub-PH= "Pren{\-}tice-Hall"} @String{pub-PH:adr= "Upper Saddle River, NJ 07458, USA"} @String{pub-PHPTR= "Pren{\-}tice-Hall PTR"} @String{pub-PHPTR:adr= "Upper Saddle River, NJ 07458, USA"} @String{pub-PRINCETON= "Princeton University Press"} @String{pub-PRINCETON:adr= "Princeton, NJ, USA"} @String{pub-SV= "Springer-Verlag"} @String{pub-SV:adr= "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/ etc."} @String{pub-UNICODE= "The Unicode Consortium"} @String{pub-UNICODE:adr= "Mountain View, CA, USA"} @String{pub-UNICODE-SAN-JOSE:adr= "San Jose, CA 95170-0519, USA"} @String{pub-USENIX= "USENIX"} @String{pub-USENIX:adr= "Berkeley, CA, USA"} @String{pub-WILEY= "John Wiley"} @String{pub-WILEY:adr= "New York, NY, USA"} @String{pub-WORLD-SCI= "World Scientific Publishing Co. Pte. Ltd."} @String{pub-WORLD-SCI:adr= "P. O. Box 128, Farrer Road, Singapore 9128"}

%%% ==================================================================== %%% Series abbreviations:

@String{ser-LNAI= "Lecture Notes in Artificial Intelligence"} @String{ser-LNCS= "Lecture Notes in Computer Science"} @String{ser-SIGPLAN= "ACM SIG{\-}PLAN Notices"}

%%% ==================================================================== %%% Bibliography entries, sorted by year, and then by citation label, %%% with `bibsort -byyear':

@InCollection{Kleene:1956:REN, author = "Stephen C. Kleene", title = "Realization of events in nerve nets and finite automata", crossref = "Shannon:1956:AS", pages = "3--42", year = "1956", bibdate = "Wed Mar 13 09:42:30 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, remark = "This may be the earliest known publication on regular expressions.", } @Article{Chomsky:1958:FSL, author = "Noam Chomsky and George A. Miller", title = "Finite State Languages", journal = j-INF-CONTROL, volume = "1", number = "2", pages = "91--112", month = may, year = "1958", CODEN = "IFCNA4", DOI = "https://doi.org/10.1016/S0019-9958(58)90082-2", ISSN = "0019-9958 (print), 1878-2981 (electronic)", ISSN-L = "0019-9958", bibdate = "Wed Mar 13 11:26:15 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "This paper show the equivalence of regular languages and regular sets.", URL = "http://www.sciencedirect.com/science/article/pii/S0019995858900822", acknowledgement = ack-nhfb, fjournal = "Information and Control", journal-URL = "http://www.sciencedirect.com/science/journal/00199958", keywords = "formal language theory", } @Article{Copi:1958:REL, author = "Irving M. Copi and Calvin C. Elgot and Jesse B. Wright", title = "Realization of Events by Logical Nets", journal = j-J-ACM, volume = "5", number = "2", pages = "181--196", month = apr, year = "1958", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Dec 10 15:59:08 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", keywords = "regular expressions", } @Article{Rabin:1959:FAT, author = "M. O. Rabin and D. Scott", title = "Finite Automata and Their Decision Problems", journal = j-IBM-JRD, volume = "3", number = "2", pages = "114--125", month = apr, year = "1959", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/rd.32.0114", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", MRclass = "93.00 (02.00)", MRnumber = "21 \#2559", bibdate = "Tue Sep 11 15:35:50 MDT 2012", bibsource = "http://www.research.ibm.com/journal/; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "This paper shows the equivalence of deterministic and nondeterministic finite automata.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392601", acknowledgement = ack-nhfb, book-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", reviewer = "J. McCarthy", } @Article{Shepherdson:1959:RTW, author = "J. C. Shepherdson", title = "The Reduction of Two-Way Automata to One-Way Automata", journal = j-IBM-JRD, volume = "3", number = "2", pages = "198--200", month = apr, year = "1959", CODEN = "IBMJAE", DOI = "https://doi.org/10.1147/rd.32.0198", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", MRclass = "93.00 (02.00)", MRnumber = "21 \#2560", bibdate = "Tue Sep 11 15:35:50 MDT 2012", bibsource = "http://www.research.ibm.com/journal/; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5392614", acknowledgement = ack-nhfb, book-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", reviewer = "J. McCarthy", } @Article{McNaughton:1960:RES, author = "R. McNaughton and H. Yamada", title = "Regular Expressions and State Graphs for Automata", journal = j-IRE-TRANS-ELEC-COMPUT, volume = "EC-9", number = "1", pages = "39--47", month = mar, year = "1960", CODEN = "IRELAO", DOI = "https://doi.org/10.1109/TEC.1960.5221603", ISSN = "0367-9950", bibdate = "Thu Jul 14 15:34:11 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "Reprinted in \cite[157--174]{}", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5221603", acknowledgement = ack-nhfb, fjournal = "IRE Transactions on Electronic Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5407885", } @Article{Ott:1961:DSM, author = "Gene Ott and Neil H. Feinstein", title = "Design of Sequential Machines from Their Regular Expressions", journal = j-J-ACM, volume = "8", number = "4", pages = "585--600", month = oct, year = "1961", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Mon Dec 05 20:11:21 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", } @Article{Brzozowski:1962:SRE, author = "Janusz A. Brzozowski", title = "A Survey of Regular Expressions and Their Applications", journal = j-IRE-TRANS-ELEC-COMPUT, volume = "EC-11", number = "3", pages = "324--335", month = jun, year = "1962", CODEN = "IRELAO", ISSN = "0367-9950", bibdate = "Sat Jul 16 20:52:08 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "IRE Transactions on Electronic Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5407885", } @Article{Ghiron:1962:RMR, author = "Hugo Ghiron", title = "Rules to Manipulate Regular Expressions of Finite Automata", journal = j-IRE-TRANS-ELEC-COMPUT, volume = "EC-11", number = "4", pages = "574--575", month = aug, year = "1962", CODEN = "IRELAO", DOI = "https://doi.org/10.1109/TEC.1962.5219404", ISSN = "0367-9950", bibdate = "Thu Jul 14 09:11:51 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5219404", acknowledgement = ack-nhfb, fjournal = "IRE Transactions on Electronic Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5407885", } @Article{Brzozowski:1963:CSM, author = "J. A. Brzozowski and J. F. Poage", title = "On the Construction of Sequential Machines from Regular Expressions", journal = j-IEEE-TRANS-ELEC-COMPUT, volume = "EC-12", number = "4", pages = "402--403", month = aug, year = "1963", CODEN = "IEECA8", DOI = "https://doi.org/10.1109/PGEC.1963.263474", ISSN = "0367-7508", bibdate = "Thu Jul 14 08:10:40 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4037916", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Electronic Computers", } @Article{Brzozowski:1964:DRE, author = "Janusz A. Brzozowski", title = "Derivatives of Regular Expressions", journal = j-J-ACM, volume = "11", number = "4", pages = "481--494", month = oct, year = "1964", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Nov 03 22:53:10 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", } @Article{Brzozowski:1964:RES, author = "J. A. Brzozowski", title = "Regular Expressions from Sequential Circuits", journal = j-IEEE-TRANS-ELEC-COMPUT, volume = "EC-13", number = "6", pages = "741--744", month = dec, year = "1964", CODEN = "IEECA8", DOI = "https://doi.org/10.1109/PGEC.1964.263932", ISSN = "0367-7508", bibdate = "Thu Jul 14 06:57:05 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4038308", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Electronic Computers", } @Book{Moore:1964:SMS, author = "Edward F. Moore", title = "Sequential Machines: Selected Papers", publisher = pub-AW, address = pub-AW:adr, pages = "v + 266", year = "1964", LCCN = "QA76.5 .M57", bibdate = "Wed Mar 13 11:22:00 MDT 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; library.ox.ac.uk:210/ADVANCE", series = "Addison-Wesley series in computer science and information processing", acknowledgement = ack-nhfb, subject = "Sequential machine theory", } @Article{Brzozowski:1965:REL, author = "J. A. Brzozowski", title = "Regular Expressions for Linear Sequential Circuits", journal = j-IEEE-TRANS-ELEC-COMPUT, volume = "EC-14", number = "2", pages = "148--156", month = apr, year = "1965", CODEN = "IEECA8", DOI = "https://doi.org/10.1109/PGEC.1965.263959", ISSN = "0367-7508", bibdate = "Thu Jul 14 06:26:21 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4038393", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Electronic Computers", } @Article{Ginzburg:1967:PCE, author = "A. Ginzburg", title = "A Procedure for Checking Equality of Regular Expressions", journal = j-J-ACM, volume = "14", number = "2", pages = "355--362", month = apr, year = "1967", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Nov 04 00:10:20 1994", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", } @Article{Anonymous:1968:TCA, author = "Anonymous", title = "Two Complete Axiom Systems for the Extended Language of Regular Expressions", journal = j-IEEE-TRANS-COMPUT, volume = "C-17", number = "7", pages = "700--701", month = jul, year = "1968", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1968.227424", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jul 13 17:40:49 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1687431", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Thompson:1968:PTR, author = "Ken Thompson", title = "Programming Techniques: {Regular} expression search algorithm", journal = j-CACM, volume = "11", number = "6", pages = "419--422", month = jun, year = "1968", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/363347.363387", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Nov 25 18:20:20 MST 2005", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm11.html#Thompson68; http://www.acm.org/pubs/contents/journals/cacm/; https://www.math.utah.edu/pub/tex/bib/cacm1960.bib; https://www.math.utah.edu/pub/tex/bib/plan9.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Kernighan:1999:REL,Cox:2007:REM,Cox:2009:REM,Cox:2010:REM,Cox:2012:REM}", URL = "http://patft.uspto.gov/", abstract = "A method for locating specific character strings embedded in character text is described and an implementation of this method in the form of a compiler is discussed. The compiler accepts a regular expression as source language and produces an IBM 7094 program as object language. The object program then accepts the text to be searched as input and produces a signal every time an embedded string in the text matches the given regular expression. Examples, problems, and solutions are also presented.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "match; regular expression; search", oldlabel = "Thompson68", remark = "The on-the-fly compilation of regular expressions to IBM 7094 machine code is part of US Patent \#3568156, awarded 9 August 1967 to Kenneth L. Thompson. This may be the first instance of the use of regular-expression pattern matching in text-editor software.", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Thompson68", } @InProceedings{Johansen:1969:FGR, author = "Peter Johansen", title = "Free groups and regular expressions", crossref = "ACM:1969:CRA", pages = "113--128", year = "1969", bibdate = "Wed Feb 20 18:32:51 MST 2002", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Kaplan:1969:REE, author = "Donald M. Kaplan", title = "Regular expressions and the equivalence of programs", journal = j-J-COMP-SYS-SCI, volume = "3", number = "4", pages = "361--386", month = nov, year = "1969", CODEN = "JCSSBM", DOI = "https://doi.org/10.1016/S0022-0000(69)80027-9", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:25:16 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0022000069800279", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Gill:1970:SAR, author = "A. Gill", title = "Symmetric and Antisymmetric Regular Expressions", journal = j-SIAM-J-APPL-MATH, volume = "18", number = "3", pages = "539--557", month = may, year = "1970", CODEN = "SMJMAP", ISSN = "0036-1399 (print), 1095-712X (electronic)", ISSN-L = "0036-1399", bibdate = "Thu Oct 15 18:16:06 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/siamjapplmath.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; JSTOR database", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Applied Mathematics", journal-URL = "http://epubs.siam.org/siap", } @Article{Vere:1970:TE, author = "Steven Vere", title = "Translation equations", journal = j-CACM, volume = "13", number = "2", pages = "83--89", month = feb, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A30", MRnumber = "45 4925", MRreviewer = "H. Maurer", bibdate = "Tue Mar 25 13:26:09 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See errata \cite{Vere:1970:TEE}.", abstract = "Input limited transduction expressions, or translation equations, are used to describe the syntax and left-context sensitive semantics for context-free languages. A formal procedure is given for deriving from a set of translation equations the specifications for a pushdown translator. The translator consists of Mealy form finite-state automata interacting by means of a pushdown stack. Within the framework described string recognition and parsing may be treated as special cases of the translation problem.", acknowledgement = ack-nhfb, classcodes = "C4210 (Formal logic)", corpsource = "Univ. California, Los Angeles, CA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "automata; computational linguistics; context-free languages; finite state automata; formal languages; meta-compilers; parsing; pushdown transducer; recognizers; regular expression; syntax directed compilers; transduction expression; translation; Turing machines", } @Article{Vere:1970:TEE, author = "S. Vere", title = "Translation Equations (Errata)", journal = j-CACM, volume = "13", number = "5", pages = "286--286", month = may, year = "1970", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Fri Jan 17 18:28:27 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Vere:1970:TE}.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Ferguson:1971:GAL, author = "W. A. Ferguson and G. J. Lipovski", title = "A generalized assembly language using regular expressions", journal = j-SIGPLAN, volume = "6", number = "2", pages = "217--236", month = feb, year = "1971", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Thu May 25 06:40:58 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Harrison:1971:IST, author = "Malcolm C. Harrison", title = "Implementation of the Substring Test by Hashing", journal = j-CACM, volume = "14", number = "12", pages = "777--779", month = dec, year = "1971", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:48:43 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm14.html#Harrison71; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See also \cite{Tharp:1982:PTS}.", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "New York Univ., NY, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "compression; data handling; hashing; information; information retrieval; programming; searching; signature; subset; substring test", oldlabel = "Harrison71", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Harrison71", } @InProceedings{Hearn:1971:CSA, author = "Anthony C. Hearn", booktitle = "Proceedings of the Second Colloquium on Advanced Computing Methods in Theoretical Physics, {CNRS}, Marseilles", title = "The Computer Solution of Algebraic Problems by Pattern Matching", publisher = "????", address = "????", pages = "I-45--I-57", year = "1971", bibdate = "Fri Sep 22 14:22:15 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/red-g-l.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "This paper discusses computer techniques for the solution of algebraic problems in theoretical physics and related areas by pattern matching.", } @Article{Patel:1971:GRL, author = "A. R. Patel", title = "Generation of Right-Linear Grammars from Regular Expressions", journal = j-IEEE-TRANS-COMPUT, volume = "C-20", number = "4", pages = "472--473", month = apr, year = "1971", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/T-C.1971.223271", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Wed Jul 13 06:38:14 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1671864", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Book{Aho:1972:TPT, author = "Alfred V. Aho and Jeffrey D. Ullman", title = "The Theory of Parsing, Translation, and Compiling. {I}: Parsing", volume = "I", publisher = pub-PH, address = pub-PH:adr, pages = "xviii + 542", year = "1972", ISBN = "0-13-914556-7", ISBN-13 = "978-0-13-914556-8", LCCN = "QA76.6 .A286 1972-73", bibdate = "Wed Dec 15 15:01:28 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @InProceedings{Cook:1972:LTS, author = "Stephen A. Cook", title = "Linear Time Simulation of Deterministic Two-Way Pushdown Automata", crossref = "Freiman:1972:IPP", pages = "75--80", year = "1972", bibdate = "Mon Sep 4 06:55:37 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "https://books.google.com/books?id=PifeQwAACAAJ", acknowledgement = ack-nhfb, remark = "This complicated theoretical paper led to the work in \cite{Knuth:1977:FPM}. No machine readable copy, nor a DOI, has yet been found.", } @Article{Smith:1972:GRE, author = "L. W. Smith and S. S. Yau", title = "Generation of regular expressions for automata by the integral of regular expressions", journal = j-COMP-J, volume = "15", number = "3", pages = "222--228", month = aug, year = "1972", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/15.3.222", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:47:50 MST 2012", bibsource = "http://comjnl.oxfordjournals.org/content/15/3.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/15/3/222.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/150222.sgm.abs.html; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/222.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/223.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/224.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/225.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/226.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/227.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_15/Issue_03/tiff/228.tif", acknowledgement = ack-nhfb, classcodes = "C4220 (Automata theory)", corpsource = "Northwestern Univ., Evanston, IL, USA", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "algorithm; expressions; finite automata; generation or regular expressions; integral of regular", treatment = "T Theoretical or Mathematical", } @Book{Aho:1973:TPT, author = "Alfred V. Aho and Jeffrey D. Ullman", title = "The Theory of Parsing, Translation, and Compiling. {II}. Compiling", volume = "II", publisher = pub-PH, address = pub-PH:adr, pages = "xiii + 460", year = "1973", ISBN = "0-13-914564-8", ISBN-13 = "978-0-13-914564-3", LCCN = "QA76.6 .A286 1972-73", bibdate = "Wed Dec 15 15:01:25 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Davison:1973:RSC, author = "G. A. Davison", title = "Rapidly Searching for Character String Matches Using Hash Coding", journal = j-IBM-TDB, volume = "16", number = "1", pages = "??--??", month = jun, year = "1973", CODEN = "IBMTAA", ISSN = "0018-8689", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "723", fjournal = "IBM Technical Disclosure Bulletin", journalabr = "IBM Tech Disclosure Bull", keywords = "computer programming", } @Article{Gimpel:1973:TDP, author = "James F. Gimpel", title = "A Theory of Discrete Patterns and Their Implementation in {SNOBOL4}", journal = j-CACM, volume = "16", number = "2", pages = "91--100", month = feb, year = "1973", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A15 (68A45)", MRnumber = "52 7198", MRreviewer = "John K. Debenham", bibdate = "Mon Jan 22 06:44:26 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#Gimpel73; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The notion of a discrete pattern is formalized and certain properties deduced. A pattern is shown to be a generalization of a formal language. Algorithms for implementing the kinds of patterns in SNOBOL4 are given. The general approach is to create, in-so-far as possible, a bottom-up parse from a top-down specification.", acknowledgement = ack-nhfb, classcodes = "C4210 (Formal logic); C6140 (Programming languages)", classification = "723", corpsource = "Bell Telephone Labs., Holmdel, NJ, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "computer programming languages; data processing --- Data Structures; discrete patterns; formal language; formal languages; parsing; pattern implementation; pattern matching; pattern recognition systems; pattern theory; patterns; programming languages; SNOBOL4; string processing", oldlabel = "Gimpel73", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Gimpel73", } @Article{James:1973:ACP, author = "E. B. James and Derek P. Partridge", title = "Adaptive Correction of Program Statements", journal = j-CACM, volume = "16", number = "1", pages = "27--37", month = jan, year = "1973", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:52:38 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm16.html#JamesP73; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A method of analyzing statements in a programming language which can tolerate a considerable inaccuracy in their specification is proposed. This method involves principles at present mainly confined to studies in the area of artificial intelligence such as feature extraction, approximate tree matching, and strategy improvement by feedback from the matching process. A pilot program incorporating the principles is described and preliminary operating results are presented. A final section surveys further principles which are currently being investigated.", acknowledgement = ack-nhfb, classcodes = "C4240 (Programming and algorithm theory)", classification = "723", corpsource = "Imperial Coll. Sci. and Technol., London, UK", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "adaptive correction; artificial intelligence; automatic parsing; compiler; computer metatheory; computer programming languages; linguistic pattern matching; program statements; programming; programming languages; syntax analysis; theory", oldlabel = "JamesP73", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/JamesP73", } @Book{Aho:1974:DAC, author = "Alfred V. Aho and John E. Hopcroft and Jeffrey D. Ullman", title = "The Design and Analysis of Computer Algorithms", publisher = pub-AW, address = pub-AW:adr, pages = "x + 470", year = "1974", ISBN = "0-201-00029-6", ISBN-13 = "978-0-201-00029-0", LCCN = "QA76.6 .A284 1974", bibdate = "Tue Dec 14 22:34:07 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, tableofcontents = "1. Models of computation \\ 2. Design of efficient algorithms \\ 3. Sorting and order statistics \\ 4. Data structures for set manipulation problems \\ 5. Algorithms on graphs \\ 6. Matrix multiplication and related operations \\ 7. The Fast Fourier Transform and its applications \\ 8. Integer and polynomial arithmetic \\ 9. Pattern-matching algorithms \\ 10. NP-complete problems \\ 11. Some provably intractable problems \\ 12. Lower bounds on numbers of arithmetic operations", } @Article{Earley:1974:HLO, author = "J. Earley", title = "High level operations in automatic programming", journal = j-SIGPLAN, volume = "9", number = "4", pages = "34--42", month = apr, year = "1974", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sat Apr 25 11:46:37 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigplan1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", conflocation = "Santa Monica, CA, USA; 28-29 March 1974", conftitle = "ACM SIGPLAN Symposium on Very High Level Languages", corpsource = "Univ. California, Berkeley, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "automatic programming; constrained data structures; high level operations; implicitly specified data structures; iterators; nonprocedural languages; pattern languages; pattern matching facilities; problem oriented languages; programming language VERS2", sponsororg = "ACM", treatment = "A Application; T Theoretical or Mathematical", } @InProceedings{Ehrenfeucht:1974:CMR, author = "Andrzej Ehrenfeucht and Paul Zeiger", title = "Complexity measures for regular expressions", crossref = "ACM:1974:CRS", pages = "75--79", year = "1974", bibdate = "Wed Feb 20 18:33:29 MST 2002", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Wagner:1974:OCR, author = "Robert A. Wagner", title = "Order-$n$ Correction for Regular Languages", journal = j-CACM, volume = "17", number = "5", pages = "265--268", month = may, year = "1974", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:27:44 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Wagner74; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A method is presented for calculating a string B, belonging to a given regular language L, which is ``nearest'' (in number of edit operations) to a given input string $a$. {$B$} is viewed as a reasonable ``correction'' for the possibly erroneous string $a$, where a was originally intended to be a string of {$L$}. \par The calculation of {$B$} by the method presented requires time proportional to $ |a| $, the number of characters in $a$. The method should find applications in information retrieval, artificial intelligence, and spelling correction systems.", acknowledgement = ack-nhfb, classcodes = "C4210 (Formal logic); C6130 (Data handling techniques)", classification = "723", corpsource = "Vanderbilt Univ., Nashville, TN, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "artificial intelligence; compiler error recovery; computer programming languages; context free languages; context-free languages; correction; corrector; edit operations; error correction; error correction codes; error correction, regular languages, regular events, finite state automata, compiler error recovery, spelling correction, string best match problem, correction, corrector, errors, nondeterministic finite-state automata; errors; finite state automata; information; nondeterministic finite state automata; nondeterministic finite-state automata; order $n$ correction; regular events; regular languages; retrieval; spelling correction; string best match problem", oldlabel = "Wagner74", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Wagner74", } @Article{Aho:1975:ESM, author = "Alfred V. Aho and Margaret J. Corasick", title = "Efficient String Matching: an Aid to Bibliographic Search", journal = j-CACM, volume = "18", number = "6", pages = "333--340", month = jun, year = "1975", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A50", MRnumber = "51 7393", MRreviewer = "K. H. V. Booth", bibdate = "Mon Jan 22 06:20:48 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; ftp://ftp.ira.uka.de/pub/bibliography/Object/Nierstrasz.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#AhoC75; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "This paper describes a simple, efficient algorithm to locate all occurrences of any of a finite number of keywords in a string of text. The algorithm consists of constructing a finite state pattern matching machine from the keywords and then using the pattern matching machine to process the text string in a single pass. Construction of the pattern matching machine takes time proportional to the sum of the lengths of the keywords. The number of state transitions made by the pattern matching machine in processing the text string is independent of the number of keywords. The algorithm has been used to improve the speed of a library bibliographic search program by a factor of 5 to 10.", acknowledgement = ack-nhfb, classcodes = "C6120 (File organisation); C7250 (Information storage and retrieval)", classification = "721; 723", corpsource = "Bell Labs., Murray Hill, NJ, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "algorithm; automata theory --- Finite Automata; bibliographic search; computational complexity.; efficient; finite state machines; finite state pattern matching; information retrieval; information retrieval systems; keywords; keywords and phrases; patterns UNIX searching; string matching; string pattern matching; text; text editing; text-editing", oldlabel = "AhoC75", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/AhoC75", } @Article{Berkling:1975:CDH, author = "K. Berkling and W. Kluge", title = "Conceptual Design of a Hardwired Main Storage Management Unit", journal = j-COMP-J, volume = "18", number = "4", pages = "360--365", month = nov, year = "1975", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/18.4.360", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:47:56 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/18/4.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/18/4/360.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/360.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/361.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/362.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/363.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/364.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_18/Issue_04/tiff/365.tif", acknowledgement = ack-nhfb, classcodes = "C6120 (File organisation); C6150J (Operating systems)", classification = "722; 723", corpsource = "Gesellschaft Math. und Datenverarbeitung GmbH, Bonn, West Germany", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "bit planes; computer operating systems; data storage, digital; hardwired main storage management unit; operating system; special processor; storage cells; storage management; string search algorithm", treatment = "T Theoretical or Mathematical", } @Article{Galil:1975:CLA, author = "Zvi Galil", title = "On converting on-line algorithms into real-time and on real-time algorithms for string-matching and palindrome recognition", journal = j-SIGACT, volume = "7", number = "4", pages = "26--30", month = nov, year = "1975", CODEN = "SIGNDM", DOI = "https://doi.org/10.1145/990502.990505", ISSN = "0163-5700 (print), 1943-5827 (electronic)", ISSN-L = "0163-5700", bibdate = "Wed Mar 21 06:52:58 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigact.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "We give a sufficient condition when an on-line algorithm can be transformed into a real-time algorithm. We use this condition to construct real-time algorithms for string-matching and palindrome recognition problems by random access machines and by Turing machines.", acknowledgement = ack-nhfb, fjournal = "ACM SIGACT News", journal-URL = "http://dl.acm.org/citation.cfm?id=J697", } @Article{Manacher:1975:NLT, author = "Glenn Manacher", title = "A New Linear-Time {``On-Line''} Algorithm for Finding the Smallest Initial Palindrome of a String", journal = j-J-ACM, volume = "22", number = "3", pages = "346--351", month = jul, year = "1975", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Despite significant advances in linear-time scanning algorithms, particularly those based wholly or in part on either Cook's linear-time simulation of two-way deterministic pushdown automata or Weiner's algorithm, the problem of recognizing the initial leftmost nonvoid palindrome of a string in time proportional to the length $N$ of the palindrome, examining no symbols other than those in the palindrome, has remained open. The algorithm presented solves this problem, assuming that addition of two integers less than or equal to $N$ may be performed in a single operation. Like the Knuth--Morris--Pratt algorithm, it runs in time independent of the size of the input alphabet. The algorithm as presented finds only even palindromes. However, an extension allows one to recognize the initial odd or even palindrome of length 2 or greater.", acknowledgement = ack-nhfb, classification = "722; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming; computer systems, digital --- On Line Operation; linear-time algorithm; palindromes", } @Article{Salton:1975:VSM, author = "Gerard Salton and A. Wong and C. S. Yang", title = "A Vector Space Model for Automatic Indexing", journal = j-CACM, volume = "18", number = "11", pages = "613--620", month = nov, year = "1975", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:18:07 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm18.html#SaltonWY75; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "In a document retrieval, or other pattern matching environment where stored entities (documents) are compared with each other or with incoming patterns (search requests), it appears that the best indexing (property) space is one where each entity lies as far away from the others as possible; in these circumstances the value of an indexing system may be expressible as a function of the density of the object space; in particular, retrieval performance may correlate inversely with space density. An approach based on space density computations is used to choose an optimum indexing vocabulary for a collection of documents. Typical evaluation results are shown, demonstrating the usefulness of the model.", acknowledgement = ack-nhfb, annote = "Optimizing of relationship strength based data access.", classcodes = "C6130 (Data handling techniques); C7240 (Information analysis and indexing)", classification = "723; 901", corpsource = "Cornell Univ., Ithaca, NY, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "automatic indexing; content analysis; density; document retrieval; incoming patterns; indexing; information science; library mechanisation; pattern matching environment; space; vector space model", oldlabel = "SaltonWY75", treatment = "A Application; P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/SaltonWY75", } @InBook{Dijkstra:1976:PMP, author = "Edsger W. Dijkstra", booktitle = "A Discipline of Programming", title = "The pattern matching problem", chapter = "18", publisher = pub-PH, address = pub-PH:adr, year = "1976", bibdate = "Mon Mar 16 08:14:00 2015", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, oldlabel = "EWD:EWD459pub", } @Article{Ehrenfeucht:1976:CMR, author = "Andrzej Ehrenfeucht and Paul Zeiger", title = "Complexity measures for regular expressions", journal = j-J-COMP-SYS-SCI, volume = "12", number = "2", pages = "134--146", month = apr, year = "1976", CODEN = "JCSSBM", DOI = "https://doi.org/10.1016/S0022-0000(76)80034-7", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:25:32 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0022000076800347", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Fosdick:1976:DFA, author = "Lloyd D. Fosdick and Leon J. Osterweil", title = "Data Flow Analysis in Software Reliability", journal = j-COMP-SURV, volume = "8", number = "3", pages = "305--330", month = sep, year = "1976", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356674.356676", ISSN = "0010-4892", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:20:22 MDT 2008", bibsource = "Compendex database; http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The ways that the methods of data flow analysis can be applied to improve software reliability are described. There is also a review of the basic terminology from graph theory and from data flow analysis in global program optimization. The notation of regular expressions is used to describe actions on data for sets of paths. These expressions provide the basis of a classification scheme for data flow which represents patterns of data flow along paths within subprograms and along paths which cross subprogram boundaries. Fast algorithms, originally introduced for global optimization, are described and it is shown how they can be used to implement the classification scheme. It is then shown how these same algorithms can also be used to detect the presence of data flow anomalies which are symptomatic of programming errors. Finally, some characteristics of and experience with DAVE, a data flow analysis system embodying some of these ideas, are described.", acknowledgement = ack-nhfb, classification = "723", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "computer programming; computer software reliability; data flow analysis", } @InProceedings{Galil:1976:RTA, author = "Zvi Galil", title = "Real-time algorithms for string-matching and palindrome recognition", crossref = "ACM:1976:CRE", pages = "161--173", year = "1976", bibdate = "Wed Feb 20 18:33:30 MST 2002", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Galil:1976:TFS, author = "Zvi Galil", title = "Two Fast Simulations Which Imply Some Fast String Matching and Palindrome-Recognition Algorithms", journal = j-INFO-PROC-LETT, volume = "4", number = "4", pages = "85--87", day = "??", month = jan, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Computer Sci., IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; deterministic multitape Turing machine; fast string matching; palindrome recognition; random access machine; simulations; Turing machines", treatment = "T Theoretical or Mathematical", } @Article{Manacher:1976:APM, author = "G. K. Manacher", title = "An application of pattern matching to a problem in geometrical complexity", journal = j-INFO-PROC-LETT, volume = "5", number = "1", pages = "6--7", day = "??", month = may, year = "1976", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition); C5530 (Pattern recognition and computer vision equipment)", corpsource = "Dept. of Information Engng., Univ. of Illinois, Chicago, IL, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "combinatorial problems; geometrical complexity; pattern matching; pattern recognition; polygons", treatment = "P Practical", } @Article{McCreight:1976:SES, author = "Edward M. McCreight", title = "A Space-Economical Suffix Tree Construction Algorithm", journal = j-J-ACM, volume = "23", number = "2", pages = "262--272", month = apr, year = "1976", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/321941.321946", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously published algorithms, but is more economical in space. Some implementation considerations are discussed, and new work on the modification of these search trees in response to incremental changes in the strings they index (the update problem) is presented.", acknowledgement = ack-ds # " and " # ack-nhfb, classification = "723; 901", comment = "Algorithms to build, use, and modify suffix tree are presented. The advantage of this algorithm over other linear time algorithms to perform similar tasks is that this algorithm uses less space. This seems to the primary reference for suffix trees.", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming; information science --- Information Retrieval", rawdata = "McCreight, E. M (1976) ``A Space Economical Suffix Tree Construction Algorithm,'' {\it Journal of the ACM}, {\bf32}(2):262--272, April.", } @TechReport{Sabsevitz:1976:REM, author = "A. L. Sabsevitz", title = "A Regular Expression Matcher For The {C} Language", type = "Technical Memorandum", number = "1101 (TM 76-9141-5)", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", day = "2", month = jun, year = "1976", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "This memorandum describes a primitive regular expression matching facility written for language C. Routines have been provided to compile regular expressions and to apply such compiled expressions to string subjects.", acknowledgement = ack-nhfb, } @Article{Abbott:1977:DIY, author = "R. J. Abbott", title = "A do-it-yourself instant compiler.kit", journal = j-SIGCSE, volume = "9", number = "1", pages = "53--58", month = feb, year = "1977", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/382063.803358", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sun Nov 18 08:53:56 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigcse1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "Special issue for the Seventh Technical Symposium on Computer Science Education.", abstract = "The theory of compiler-compilers is well known. Here we present a small collection of SNOBOL subroutines which make the SNOBOL pattern matcher a self-documenting instant compiler. All one need add are the syntax productions (as simple SNOBOL patterns mimicking BNF) and the associated (synthesizing) semartic transformation in the form of arbitrarily simple SNOBOL programs. The resulting compiler produces a complete (or partial at the us{\'e}r's discretion) trace of the parse showing how the syntax matches or fails to match the input. After a match is achieved, the semantic rules are executed on the resulting parse tree. The execution of these rules too are optionally traced so that one has a full picture of just which transformations were performed at each node of the tree. Finally the parse tree is printed.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Bird:1977:IPI, author = "Richard S. Bird", title = "Improving Programs by the Introduction of Recursion", journal = j-CACM, volume = "20", number = "11", pages = "856--863", month = nov, year = "1977", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68A05", MRnumber = "56 17179", MRreviewer = "V. Cazanescu", bibdate = "Mon Jan 22 06:26:29 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/Functional.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#Bird77a; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A new technique of program transformation, called ``recursion introduction,'' is described and applied to two algorithms which solve pattern matching problems. By using a recursion introduction, algorithms which manipulate a stack are first translated into recursive algorithms in which no stack operations occur. These algorithms are then subjected to a second transformation, a method of recursion elimination called ``tabulation,'' to produce programs with a very efficient running time. In particular, it is shown how the fast linear pattern matching algorithm of Knuth, Morris, and Pratt can be derived in a few steps from a simple nonlinear stack algorithm.", acknowledgement = ack-nhfb, classcodes = "C4240 (Programming and algorithm theory)", classification = "723", corpsource = "Univ. of Reading, Reading, UK", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "computer programming; functional program transformation optimization recursion elimination pattern matching computational induction; program transformation; programming theory; recursion introduction; stack", oldlabel = "Bird77a", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Bird77a", } @Article{Bird:1977:TDP, author = "R. S. Bird", title = "Two dimensional pattern matching", journal = j-INFO-PROC-LETT, volume = "6", number = "5", pages = "168--170", day = "??", month = oct, year = "1977", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Dept. of Computer Sci., Univ. of Reading, Reading, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "pattern matching; pattern recognition; string matching; text editing; two dimensional", treatment = "T Theoretical or Mathematical", } @Article{Boyer:1977:FSS, author = "Robert S. Boyer and J. Strother Moore", title = "A Fast String Searching Algorithm", journal = j-CACM, volume = "20", number = "10", pages = "762--772", month = oct, year = "1977", CODEN = "CACMA2", DOI = "https://doi.org/10.1145/359842.359859", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:27:49 MST 2001", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/protein.pattern.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#BoyerM77; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See also \cite{Knuth:1977:FPM,Sunday:1990:VFS,Baeza-Yates:1992:NAT}.", abstract = "An algorithm is presented that searches for the location, ``i,'' of the first occurrence of a character string, ``pat,'' in another string, ``string.'' During the search operation, the characters of pat are matched starting with the last character of pat. The information gained by starting the match at the end of the pattern often allows the algorithm to proceed in large jumps through the text being searched. Thus the algorithm has the unusual property that, in most cases, not all of the first i characters of string are inspected. The number of characters actually inspected (on the average) decreases as a function of the length of pat. For a random English pattern of length 5, the algorithm will typically inspect i/4 characters of string before finding a match at i. Furthermore, the algorithm has been implemented so that (on the average) fewer than i plus patlen machine instructions are executed. These conclusions are supported with empirical evidence and a theoretical analysis of the average behavior of the algorithm. The worst case behavior of the algorithm is linear in i plus patlen, assuming the availability of array space for tables linear in patlen plus the size of the alphabet.", acknowledgement = ack-nhfb, classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", classification = "723; 901", comment = "The Boyer--Moore string matching algorithm is, in the worst case, linear in the length of the text + length of the pattern. The average case behavior is sublinear. Practical efficient implementations of this algorithm exist. By starting the comparisons at the right of the pattern instead of the left of the pattern, large jumps can be made in the text.", corpsource = "Stanford Res. Inst., Stanford, CA, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "algorithm; Boyer--Moore; character string; computer operating systems; computer programming; fast; information science --- Information Retrieval; list processing; pattern matching; string matching; string searching; text; text editing", oldlabel = "BoyerM77", received = "June 1975", revised = "April 1976", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/BoyerM77", } @Article{Brownlee:1977:ABI, author = "J. Nevil Brownlee", title = "An {Algol}-based implementation of {SNOBOL 4} patterns", journal = j-CACM, volume = "20", number = "7", pages = "527--529", month = jul, year = "1977", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:28:32 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#Brownlee77; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "When a string appears as the subject of a SNOBOL4 statement, it may be scanned to see whether or not it contains a specified pattern. However, since the scanner is fundamentally an interpreter (using pattern graphs as its input code), pattern matching appears to be a time-consuming process. This paper describes an alternative approach in which SNOBOL4 patterns are compiled into Algol functions, which can be combined into larger (more complicated) patterns, and which are directly executed. It was developed as part of the implementation of ``Snobal\slash 67'', a Burroughs B6700 compiler for a SNOBAL4-like language.", acknowledgement = ack-nhfb, classcodes = "C6140D (High level languages)", classification = "723", corpsource = "Univ. of Auckland, Private Bag, Auckland, New Zealand", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "ALGOL; compiled; computer operating systems --- Program Compilers; computer programming languages; implementation; pattern recognition systems; patterns; procedure oriented languages; SNOBOL 4", oldlabel = "Brownlee77", treatment = "P Practical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Brownlee77", } @TechReport{Carr:1977:CSM, author = "R. G. Carr", title = "Character String Manipulation in the {C} Language", type = "Technical Memorandum", number = "1208", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", day = "31", month = oct, year = "1977", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "This document describes the C language features and the available subroutines. It is intended to complement the C tutorial UNPL(1001) with emphasis on strings.", acknowledgement = ack-nhfb, } @Article{Davis:1977:ARE, author = "D. E. Davis and R. D. Moore and M. C. Williams and O. C. Woodard", title = "Automatic Registration in an Electron-Beam Lithographic System", journal = j-IBM-JRD, volume = "21", number = "6", pages = "498--505", month = nov, year = "1977", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A description is given of pattern registration, a process by which the circuit patterns required at a particular level of device fabrication are mapped to those of the preceding level. The considerations taken as basic in designing an accurate, high-speed registration process for a production-type electron-beam exposure system are discussed. This automatic registration system operates in 150 milliseconds per integrated circuit chip, allowing the system to achieve a throughput of 2000 5-mm chips per hour with overlay error of less than 0.75 $ \mu $ m (3 sigma). The operation of this system, its performance characteristics, and measurements of its pattern-matching accuracy are presented.", acknowledgement = ack-nhfb, classcodes = "B2220C (General integrated circuit fabrication techniques); B2550G (Lithography); B2570 (Semiconductor integrated circuits); C3355 (Control applications in manufacturing processes)", classification = "713; 745; 932", corpsource = "IBM Systems Products Div. Lab., East Fishkill, Hopewell Junction, NY, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", journalabr = "IBM J Res Dev", keywords = "automatic registration system; circuit technology; electron beam applications; electron beams --- Applications; electron resists; integrated; integrated circuit manufacture; lithography --- Applications; manufacturing processes; pattern registration process; photolithography", treatment = "P Practical", } @Article{Dirilten:1977:PMU, author = "H. Dirilten and T. G. Newman", title = "Pattern Matching Under Affine Transformations", journal = j-IEEE-TRANS-COMPUT, volume = "C-26", number = "3", pages = "314--317", month = mar, year = "1977", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1977.1674832", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 11 21:56:53 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1674832", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Francez:1977:BRC, author = "Nissim Francez and Boris Klebansky and Amir Pnueli", title = "Backtracking in Recursive Computations", journal = j-ACTA-INFO, volume = "8", number = "2", pages = "125--144", day = "24", month = may, year = "1977", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", ISSN-L = "0001-5903", bibdate = "Fri Sep 22 14:22:31 2023", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Compiler/bevan.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/allison.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; https://www.math.utah.edu/pub/tex/bib/actainfo.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A mathematical (denotational) semantics is constructed for a formalism of recursive equations with the {\em Alternative} operator. This formalism enables the combination of recursion and backtracking. The semantics is defined by applying fixpoint theory to set valued functions. We introduce the notion of strategy to produce subset of the result. Two implementations are suggested using an auxiliary stack. the concept of a sub-fixpoint is introduced, and the implementations are shown to be incomplete even w.r.t. sub-fixpoint values. One special strategy, the leftmost strategy, which stems from problems such as pattern matching and parsing, is discussed.", annote = "denotational semantics of recursive equations with the alternative operator. Can use recursion and backtracking. Uses set valued functions in semantics.", checked = "19940503", fjournal = "Acta Informatica", journal-URL = "http://www.springerlink.com/content/0001-5903", keywords = "alternative operator; backtracking; choice; denotational semantics; fixpoint; nondeterministic; recursion; semantics", refs = "15", } @Article{Goto:1977:PHA, author = "E. Goto and T. Ida and T. Gunji", key = "Goto \& Ida", title = "Parallel Hashing Algorithms", journal = j-INFO-PROC-LETT, volume = "6", number = "1", pages = "8--13", day = "??", month = feb, year = "1977", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6120 (File organisation)", corpsource = "Inst. for Phys. and Chem. Res., Wako-shi, Saitama, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "fast pattern matching; memory accesses; parallel hashing algorithms; retrieve; software systems; storage management", treatment = "T Theoretical or Mathematical", } @TechReport{Hoalst:1977:SMC, author = "B. C. Hoalst", title = "String Manipulation and Conversion for Switching Control Center", type = "Technical Memorandum", number = "1211 (TM 77-5222-2)", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", day = "20", month = oct, year = "1977", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "This library provides a number of basic mechanisms for implementation of complex string formatting tasks from C programs.", acknowledgement = ack-nhfb, } @Article{Housden:1977:CSP, author = "R. J. W. Housden and N. Kotarski", title = "Character string pattern matching in {Algol 68}", journal = j-SIGPLAN, volume = "12", number = "6", pages = "144--152", month = jun, year = "1977", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:05 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6150E (General utility programs)", conflocation = "Glasgow, UK; 29-31 March 1977", conftitle = "Proceedings of the Strathclyde ALGOL 68 Conference", corpsource = "Univ. of East Anglia, Norwich, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "ALGOL; ALGOL 68; character string pattern matching; data handling; modes; operators; pattern recognition; procedures; SNOBOL 4", sponsororg = "ACM", treatment = "P Practical", } @Article{Knuth:1977:FPM, author = "Donald E. Knuth and James H. {Morris, Jr.} and Vaughan R. Pratt", title = "Fast Pattern Matching in Strings", journal = j-SIAM-J-COMPUT, volume = "6", number = "2", pages = "323--350", month = jun, year = "1977", CODEN = "SMJCAT", DOI = "https://doi.org/10.1137/0206024", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68A45", MRnumber = "56 #10198", MRreviewer = "B. Chandrasekaran", bibdate = "Fri Mar 22 18:03:29 MST 2002", bibsource = "Compiler/math.prog.construction.bib; http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/6/2; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; MathSciNet database; Misc/traces.bib", note = "Errata, see \cite{Rytter:1980:CPA}. See also \cite{Boyer:1977:FSS,Rytter:1980:CPA,Sunday:1990:VFS,Hume:1991:FSS,Baeza-Yates:1992:NAT}.", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", received = "29 August 1974", remark = "This paper builds on work in \cite{Cook:1972:LTS}.", revised = "7 April 1976", } @TechReport{Luderer:1977:CPT, author = "G. W. R. Luderer", title = "Cut and Paste --- Two {UNIX} Word Processing Commands", type = "Technical Memorandum", number = "1205 (MF 77-8234-086)", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", day = "30", month = sep, year = "1977", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "{\tt Cut} and {\tt Paste} are two new UNIX word processing commands that complement {\tt grep} and {\tt cat}. {\tt Cut} dissects a file vertically, and {\tt Paste} is the reverse operation of {\tt Cut}.", acknowledgement = ack-nhfb, } @TechReport{Reiser:1977:EDO, author = "John F. Reiser", title = "{EDTV} --- a Display-Oriented Text Editor For {UNIX}", type = "Technical Memorandum", number = "1177 (TM 77-1353-6)", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", day = "1", month = aug, year = "1977", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "This memorandum is a description of the features and commands of {\tt edtv}, a display-oriented editor which runs under the UNIX operating system. It allows the regular expressions editing of {\tt ed}, the standard UNIX editor.", acknowledgement = ack-nhfb, } @Article{Silverston:1977:NPM, author = "Stefan M. Silverston", title = "A note on pattern matching under {Quickscan} in {SNOBOL4}", journal = j-SIGPLAN, volume = "12", number = "10", pages = "70--74", month = oct, year = "1977", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:10 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Computer Sci. Dept., Iowa State Univ., Ames, IA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "data handling; heuristics; pattern matching; procedure oriented languages; Quickscan; SNOBOL4", treatment = "P Practical", } @Article{Stockman:1977:EHC, author = "G. C. Stockman and Ashok K. Agrawala", title = "Equivalence of {Hough} curve detection to template matching", journal = j-CACM, volume = "20", number = "11", pages = "820--822", month = nov, year = "1977", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:24:30 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm20.html#StockmanA77; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "B6140C (Optical information, image and video signal processing); C1250 (Pattern recognition)", corpsource = "LNK Corp., Silver Spring, MD, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "Hough; Hough curve detection; pattern recognition; template matching; transformation", oldlabel = "StockmanA77", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/StockmanA77", } @Article{Vineberg:1977:ICSa, author = "Maniel Vineberg", title = "Implementation of character string pattern matching on a multiprocessor", journal = j-COMP-ARCH-NEWS, volume = "6", number = "2", pages = "1--7", month = may, year = "1977", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", ISSN-L = "0163-5964", bibdate = "Fri May 12 09:40:45 MDT 2006", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Vineberg:1977:ICSb, author = "Maniel Vineberg", title = "Implementation of character string pattern matching on a multiprocessor", journal = j-SIGMOD, volume = "9", number = "2", pages = "1--7", month = may, year = "1977", CODEN = "SRECD8", DOI = "https://doi.org/10.1145/965645.810246", ISSN = "0163-5808 (print), 1943-5835 (electronic)", ISSN-L = "0163-5808", bibdate = "Tue Jun 17 17:07:14 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigmod.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "An algorithm to do pattern matching, a basic character string operation, is presented. The Programmable Algorithm Machine (PAM), a proposed special-purpose computer which will feature multiple processing elements and operate efficiently over a wide class of applications, is described. It is shown that the multiple processing elements of the PAM allow concurrent execution of independent operations both in a special case of the pattern matching algorithm, where the string sizes (lengths) are known at compile time, and in the general case, where the sizes are not known.", acknowledgement = ack-nhfb, fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689", } @Article{Akl:1978:CGM, author = "S. G. Akl", title = "Comments on: {G. Manacher}, {``An application of pattern matching to a problem in geometrical complexity''}", journal = j-INFO-PROC-LETT, volume = "7", number = "2", pages = "86--??", day = "28", month = feb, year = "1978", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "School of Computer Sci., McGill Univ., Montreal, Que., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; geometrical complexity; pattern matching; polygon comparison", treatment = "T Theoretical or Mathematical", } @Article{Baker:1978:TER, author = "Theodore P. Baker", title = "A technique for extending rapid exact-match string matching to arrays of more than one dimension", journal = j-SIAM-J-COMPUT, volume = "7", number = "4", pages = "533--541", month = "????", year = "1978", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68G10", MRnumber = "81h:68085", bibdate = "Mon Nov 29 10:58:52 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/7/4; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Choueka:1978:FAD, author = "Yaacov Choueka", title = "Finite automata, definable sets, and regular expressions over $ \omega^n$-tapes", journal = j-J-COMP-SYS-SCI, volume = "17", number = "1", pages = "81--97", month = aug, year = "1978", CODEN = "JCSSBM", DOI = "https://doi.org/10.1016/0022-0000(78)90036-3", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:25:38 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0022000078900363", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Ditzel:1978:PMH, author = "D. R. Ditzel", title = "Pattern matching for high level languages", journal = j-SIGPLAN, volume = "13", number = "5", pages = "46--55", month = may, year = "1978", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:17 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques); C6140D (High level languages)", corpsource = "Computer Sci. Dept., Iowa State Univ., Ames, IA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "characters; data handling; high level languages; pattern matching; procedure oriented languages; searching; string; text editor", treatment = "T Theoretical or Mathematical", } @TechReport{Freeman:1978:PCL, author = "R. B. Freeman", title = "{Parse()} --- A {C} Language Routine to Parse a String into Words", type = "Technical Memorandum", number = "1271", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", day = "15", month = jun, year = "1978", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "These notes document {\tt parse()}, a C language routine that parses an input string and returns the \ldots{} words and the number of words in the string.", acknowledgement = ack-nhfb, } @Article{Pagan:1978:FSS, author = "F. G. Pagan", title = "Formal Semantics of a {Snobol4} Subset", journal = j-COMP-LANGS, volume = "3", number = "1", pages = "13--30", month = "????", year = "1978", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Thu Apr 10 09:52:25 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C4210 (Formal logic); C6140D (High level languages)", classification = "723", corpsource = "Dept. of Math., Statistics and Computer Sci., Memorial Univ. of Newfoundland, St. John's, Nfld., Canada", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "abstract interpreter; abstract syntax; computer programming languages; concrete syntax; formal languages; function invocation; pattern matching; programming languages; semantics; Snobol4; SNOBOL4 subset; statement sequencing; Vienna Definition Language", treatment = "G General Review", } @Article{Parker:1978:SCO, author = "K. P. Parker and E. J. McCluskey", title = "Sequential Circuit Output Probabilities From Regular Expressions", journal = j-IEEE-TRANS-COMPUT, volume = "C-27", number = "3", pages = "222--231", month = mar, year = "1978", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1978.1675075", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Mon Jul 11 08:13:27 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1675075", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @InProceedings{Slissenko:1978:SMR, author = "A. Slissenko", title = "String-Matching in Real-Time: Some Properties of the Data Structure", crossref = "Winkowski:1978:MFC", pages = "493--496", year = "1978", bibdate = "Sat Jul 3 07:43:10 MDT 1999", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/slissenko-anatol.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", } @Article{Beyer:1979:LAI, author = "T. Beyer and W. Jones and S. Mitchell", title = "Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs", journal = j-J-ACM, volume = "26", number = "4", pages = "603--610", month = oct, year = "1979", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Two linear algorithms are presented for solving the isomorphism problem for maximal outerplanar graphs (mops). These algorithms present improvements over corresponding linear algorithms for planar graph isomorphism when applied to mops. The algorithms are based on a code for a mop {$G$} which is obtained from a unique Hamiltonian cycle in {$G$}. The first involves a string-matching automation and the second involves the removal of vertices of degree two in layers until either an edge or triangular face remains.", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques --- Graph Theory", } @InProceedings{Cowan:1979:HKRa, author = "Richard M. Cowan and Martin L. Griss", title = "Hashing --- The Key to Rapid Pattern Matching", crossref = "Ng:1979:SAC", volume = "72", pages = "266--278", year = "1979", bibdate = "Sun Jul 17 10:04:39 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @InProceedings{Cowan:1979:HKRb, author = "Richard M. Cowan and Martin L. Griss", booktitle = "Proc. {EUROSAM} 1979, Lecture Notes in Computer Science", title = "Hashing --- The Key to Rapid Pattern Matching", volume = "72", publisher = pub-SV, address = pub-SV:adr, pages = "266--278", year = "1979", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/red-a-f.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Galil:1979:IWC, author = "Zvi Galil", title = "On Improving the Worse Case Running Time of the {Boyer--Moore} String Matching Algorithm", journal = j-CACM, volume = "22", number = "9", pages = "505--508", month = sep, year = "1979", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", MRclass = "68H05 (68C25)", MRnumber = "80m:68083", MRreviewer = "Andrew Yao", bibdate = "Mon Jan 22 06:42:55 MST 2001", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://dblp.uni-trier.de/db/journals/cacm/cacm22.html#Galil79; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, annote = "It compares the pattern with the text from the right end of the pattern. Whenever a mismatch occurs, it shifts the pattern according to a precomputed table. In the case that the text character positioned against the last character in the pattern does not appear in the pattern, we can immediately shift the pattern right a distance equal to the size of the pattern. Thus, we need to inspect only about $ n / m $ characters of the text (where $n$ and $m$ are the sizes of the text pattern).", classcodes = "C4240 (Programming and algorithm theory); C6130 (Data handling techniques)", corpsource = "Tel-Aviv Univ., Tel-Aviv, Israel", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithm; computational complexity; data handling; running time; string matching; worst case", oldlabel = "Galil79", treatment = "T Theoretical or Mathematical", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Galil79", } @TechReport{Griss:1979:HKR, author = "M. L. Griss", title = "Hashing---the Key to Rapid Pattern Matching", number = "UUCS-79-108", institution = "Computer Science Department, University of Utah", pages = "??", year = "1979", bibdate = "Thu Jul 21 09:35:11 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Harrington:1979:NSI, author = "Steven J. Harrington", title = "A New Symbolic Integration System in {REDUCE}", journal = j-COMP-J, volume = "22", number = "2", pages = "127--131", month = may, year = "1979", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/22.2.127", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:05 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/22/2.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_02/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Theory/Comp.Alg.1.bib; Theory/reduce.bib", URL = "http://comjnl.oxfordjournals.org/content/22/2/127.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_02/tiff/127.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_02/tiff/128.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_02/tiff/129.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_02/tiff/130.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_22/Issue_02/tiff/131.tif", abstract = "A new integration system, employing both algorithmic and pattern match integration schemes is presented. The organization of the system differs from that of earlier programs in its emphasis on the algorithmic approach to integration, its modularity, and its ease of revision. The new {Norman-Risch} algorithm and its implementation at the University of Cambridge are employed, supplemented by a powerful collection of simplification and transformation rules. The facility for user defined integrals and functions is also included. The program is both fast and powerful, and can be easily modified to incorporate anticipated developments in symbolic integration.", acknowledgement = ack-nhfb, annote = "A new integration system, employing both algorithmic and pattern match integration schemes is presented. The organization of the system differs from that of earlier programs in its emphasis on the algorithmic approach to integration, its modularity, and its ease of revision. The new Norman-Risch algorithm and its implementation at the University of Cambridge are employed, supplemented by a powerful collection of simplification and transformation rules. The facility for user defined integrals and functions is also included. The program is both fast and powerful, and can be easily modified to incorporate anticipated developments in symbolic integration.", classcodes = "C4160 (Numerical integration and differentiation)", classification = "723", corpsource = "Univ. of Utah, Salt Lake City, UT, USA", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "algorithmic integration schemes; computer programming; integration; integration schemes; Norman Risch algorithm; pattern match; Reduce; reduce; rules; simplification rules; symbolic integration system; transformation", remark = "A new integration system, employing both algorithmic and pattern match integration schemes is presented. The organization of the system differs from that of earlier programs in its emphasis on the algorithmic approach to integration, its modularity, and its ease of revision. The new Norman-Risch algorithm and its implementation at the University of Cambridge are employed, supplemented by a powerful collection of simplification and transformation rules. The facility for user defined integrals and functions is also included. The program is both fast and powerful, and can be easily modified to incorporate anticipated developments in symbolic integration.", treatment = "G General Review; N New Development", } @Book{Hopcroft:1979:IAT, author = "John E. Hopcroft and Jeffrey D. Ullman", title = "Introduction to Automata Theory, Languages, and Computation", publisher = pub-AW, address = pub-AW:adr, pages = "418", year = "1979", ISBN = "0-201-02988-X", ISBN-13 = "978-0-201-02988-8", LCCN = "QA267 .H56", bibdate = "Wed Sep 9 09:30:16 MDT 2020", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", series = "Addison-Wesley Series in Computer Science", acknowledgement = ack-nhfb, tableofcontents = "Preliminaries \\ Finite automata and regular expressions \\ Properties of regular sets \\ Context-free grammars \\ Pushdown automata \\ Properties of context-free languages \\ Turing machines \\ Undecidability \\ The Chomsky hierarchy \\ Deterministic context-free languages \\ Closure properties of families of languages \\ Computational complexity theory \\ Intractable problems \\ Highlights of other important language classes", } @Article{Hunt:1979:OCR, author = "H. B. Hunt", title = "Observations on the complexity of regular expression problems", journal = j-J-COMP-SYS-SCI, volume = "19", number = "3", pages = "222--236", month = dec, year = "1979", CODEN = "JCSSBM", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:25:41 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0022000079900023", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @TechReport{Kessler:1979:PPM, author = "R. Kessler", title = "{PMETA} --- Pattern Matching {META}/{REDUCE}", type = "Report", number = "USCG Op. Note No. 40", institution = "Univ. of Utah, CS Dept.", address = "Salt Lake City, UT, USA", month = jan, year = "1979", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "Ai/lisp.bib; https://www.math.utah.edu/pub/tex/bib/redextra.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, keywords = "LISP", } @Article{Kodratoff:1979:CFS, author = "Yves Kodratoff", title = "A class of functions synthesized from a finite number of examples and a {LISP} program scheme", journal = j-INT-J-COMPUT-INF-SCI, volume = "8", number = "6", pages = "489--521", month = dec, year = "1979", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68G10 (68B10)", MRnumber = "80i:68074", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Inst. de Programmation, CNRS, Paris, France", fjournal = "International Journal of Computer and Information Sciences", journal-URL = "http://link.springer.com/journal/10766", keywords = "finite number of examples; functions; LISP program scheme; pattern matching; programming theory", treatment = "T Theoretical or Mathematical", } @Article{Lesk:1979:DTD, author = "Arthur M. Lesk", title = "Detection of Three-Dimensional Patterns of Atoms in Chemical Structures", journal = j-CACM, volume = "22", number = "4", pages = "219--224", month = apr, year = "1979", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 06:58:32 MST 2001", bibsource = "Compendex database; http://dblp.uni-trier.de/db/journals/cacm/cacm22.html#Lesk79; https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "An algorithm for detecting occurrences of a three-dimensional pattern of objects within a larger structure is presented. The search technique presented used the geometric structure of the pattern to define characteristics demanded of candidates for matching. This is useful in cases where the properties of each atom, considered individually, do not adequately limit the number of sets of possible matchings. Several applications of this technique in the field of chemistry are: (1) in pharmacology: Searching for a common constellation of atoms in molecules possessing similar biological activities; (2) in X-ray crystallography: fitting a structure or a structural fragment to a set of peaks in the electron-density distribution of a Fourier map; (3) in chemical documentation: retrieving from a file the structures containing specified substructures.", acknowledgement = ack-nhfb, classcodes = "C7320 (Physics and chemistry computing)", classification = "462; 482; 501; 723; 804; 901", corpsource = "Fairleigh Dickinson Univ., Teaneck, NJ, USA", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", journalabr = "Commun ACM", keywords = "atoms; chemical documentation; chemical structures; chemistry computing; crystallography; crystallography --- X-Ray Analysis; drug products; information science --- Information Retrieval; pattern recognition; pattern recognition systems; pharmacology; search; three dimensional; X-ray", oldlabel = "Lesk79", treatment = "A Application", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/Lesk79", } @TechReport{Lesk:1979:LLAa, author = "Michael E. Lesk and E. Schmidt", title = "{Lex} --- A Lexical Analyzer Generator", type = "Technical Memorandum", number = "1061", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "13??", month = jan, year = "1979", bibdate = "Tue Jun 06 08:07:45 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "Lex helps write programs whose control flow is directed by instances of regular expressions in the input stream. It is well suited for editor-script type transformations and for segmenting input in preparation for a parsing routine.\par Lex source is a table of regular expressions and corresponding program fragments. The table is translated to a program which reads an input stream, copying it to an output stream and partitioning the input into strings which match the given expressions. As each such string is recognized the corresponding program fragment is executed. The recognition of the expressions is performed by a deterministic finite automaton generated by Lex. The program fragments written by the user are executed in the order in which the corresponding regular expressions occur in the input stream.\par The lexical analysis programs written with Lex accept ambiguous specifications and choose the longest match possible at each input point. If necessary. substantial lookahead is performed on the input, but the input stream will be backed up to the end of the current partition, so that the user has general freedom to manipulate it.\par Lex can be used to generate analyzers in either C or Ratfor, a language which can be translated automatically to portable Fortran. It is available on the PDP-11 UNIX. Honeywell GCOS. and IBM OS systems. Lex is designed to simplify interfacing with Yacc, for those with access to this compiler-compiler system.", abstract-2 = "Lex helps write programs whose control flow is directed by instances of regular expressions \ldots{} input stream.", acknowledgement = ack-nhfb, remark = "Available in PDF file of \cite[pp. 439--451]{Dolotta:1977:DPU}.", tableofcontents = "1. Introduction / 1 \\ 2. Lex Source / 3 \\ 3. Lex Regular Expressions / 3 \\ 4. Lex Actions / 5 \\ 5. Ambiguous Source Rules / 7 \\ 6. Lex Source Definitions / 8 \\ 7. Usage / 8 \\ 8. Lex and Yacc / 9 \\ 9. Examples / 10 \\ 10. Left Context Sensitivity / 11 \\ 11. Character Set / 12 \\ 12. Summary of Source Format / 12 \\ 13. Caveats and Bugs / 13 \\ 14. Acknowledgments / 13 \\ 15. References / 13", } @Article{Reuhkala:1979:RHA, author = "Erkki Reuhkala and Matti Jalanko and Teuvo Kohonen", title = "Redundant Hash Addressing Method Adapted for the Postprocessing and Error-Correction of Computer-Recognized Speech", journal = "Record --- IEEE International Conference on Acoustics, Speech \& Signal Processing", volume = "??", number = "??", pages = "591--594", month = "????", year = "1979", CODEN = "RIIPDR", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "In the recognition of spoken words, a frequently applied method is to first convert the acoustic waveforms into phonemic strings which are then compared with prototype strings stored in a dictionary, using some metric. A standard method is to use dynamic programming for comparison of strings with variable length. This procedure, however, is rather slow. A recently introduced principle of string comparison is based on redundant hash addressing, and it is computationally at least an order of magnitude lighter. This method is here applied, using multiple prototypes of phonemic strings for each word in the dictionary. The matching criterion thereby applied in fact corresponds to a distance-weighted k-nearest-neighbor classifier which allows length variations in strings.", acknowledgement = ack-nhfb, classification = "751", conference = "Rec IEEE Int Conf Acoust Speech Signal Process 4th (ICASSP '79)", keywords = "speech", meetingaddress = "Washington, DC, USA", meetingdate = "Apr 2--4 1979", meetingdate2 = "04/02--04/79", } @Article{Richards:1979:CFR, author = "Martin Richards", title = "A Compact Function for Regular Expression Pattern Matching", journal = j-SPE, volume = "9", number = "7", pages = "527--534", month = jul, year = "1979", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Tue Mar 13 05:17:46 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, annote = "A pattern matcher based on this algorithm is included in Joerg Schilling's star (fast tar) utility, available at ftp://ftp.fokus.gmd.de/pub/unix/star/star-1.2.tar.gz.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Robson:1979:ECP, author = "J. M. Robson", title = "The emptiness of complement problem for semi extended regular expressions requires $ c^n $ space", journal = j-INFO-PROC-LETT, volume = "9", number = "5", pages = "220--222", day = "16", month = dec, year = "1979", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Computer Sci., Australian Nat. Univ., Canberra, ACT, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "complement problem; emptiness; formal logic; semi extended regular expressions; set intersection", treatment = "T Theoretical or Mathematical", } @Article{Sassa:1979:PMM, author = "Masataka Sassa", title = "A pattern matching macro processor", journal = j-SPE, volume = "9", number = "6", pages = "439--456", month = jun, year = "1979", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380090604", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Sep 10 12:36:39 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "27 Oct 2006", } @Article{Yao:1979:CPM, author = "Andrew Chi Chih Yao", title = "The complexity of pattern matching for a random string", journal = j-SIAM-J-COMPUT, volume = "8", number = "3", pages = "368--387", month = "????", year = "1979", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68C25", MRnumber = "80g:68064", bibdate = "Mon Nov 29 10:59:03 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/8/3; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Bailey:1980:FSS, author = "T. A. Bailey and R. G. Dromey", title = "Fast string searching by finding subkeys in subtext", journal = j-INFO-PROC-LETT, volume = "11", number = "3", pages = "130--133", day = "18", month = nov, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6130 (Data handling techniques)", corpsource = "Dept. of Computing Sci., Univ. of Wollongong, Wollongong, NSW, Australia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", keywords = "characters; data handling; sequences; string search; subkeys; subtext", treatment = "A Application; T Theoretical or Mathematical", } @Article{Booth:1980:LLC, author = "Kellogg S. Booth", title = "Lexicographically least circular substrings", journal = j-INFO-PROC-LETT, volume = "10", number = "4--5", pages = "240--242", day = "5", month = jul, year = "1980", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68E99", MRnumber = "81g:68100", bibdate = "Tue Nov 17 10:49:43 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1970.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Computer Sci., Univ. of Waterloo, Waterloo, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "algorithm theory; canonical form; graph isomorphism algorithms; Knuth Morris Pratt algorithm; least circular substrings; lexicographically least circular shift; linear time pattern matching algorithm", treatment = "T Theoretical or Mathematical", } @Article{Galil:1980:SSF, author = "Zvi Galil and Joel Seiferas", title = "Saving Space in Fast String-Matching", journal = j-SIAM-J-COMPUT, volume = "9", number = "2", pages = "417--438", month = "????", year = "1980", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68C20 (68C25)", MRnumber = "81i:68052", MRreviewer = "Stanley H. Benton, Jr.", bibdate = "Mon Nov 29 10:59:14 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/9/2; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Guibas:1980:NPL, author = "Leo J. Guibas and Andrew M. Odlyzko", title = "A new proof of the linearity of the {Boyer--Moore} string searching algorithm", journal = j-SIAM-J-COMPUT, volume = "9", number = "4", pages = "672--682", month = "????", year = "1980", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68C05 (68C25 68E99)", MRnumber = "82d:68024", MRreviewer = "Armin Cremers", bibdate = "Mon Nov 29 10:59:19 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/9/4; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Hall:1980:ASM, author = "Patrick A. V. Hall and Geoff R. Dowling", title = "Approximate String Matching", journal = j-COMP-SURV, volume = "12", number = "4", pages = "381--402", month = dec, year = "1980", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356827.356830", ISSN = "0010-4892", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:28:11 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Horspool:1980:PFS, author = "R. Nigel Horspool", title = "Practical Fast Searching in Strings", journal = j-SPE, volume = "10", number = "6", pages = "501--506", month = jun, year = "1980", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380100608", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "Boyer--Moore; Knuth--Morris--Pratt; string matrix", onlinedate = "27 Oct 2006", } @Article{Iyengar:1980:SSA, author = "S. Sitharama Iyengar and Vincent Alia", title = "A string searching algorithm", journal = j-APPL-MATH-COMP, volume = "6", number = "2", pages = "123--131", month = mar, year = "1980", CODEN = "AMHCBQ", DOI = "https://doi.org/10.1016/0096-3003(80)90037-5", ISSN = "0096-3003 (print), 1873-5649 (electronic)", ISSN-L = "0096-3003", bibdate = "Tue Nov 20 21:00:45 MST 2012", bibsource = "http://www.elsevier.com/locate/issn/00963003; https://www.math.utah.edu/pub/tex/bib/applmathcomput.bib; https://www.math.utah.edu/pub/tex/bib/applmathcomput1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0096300380900375", acknowledgement = ack-nhfb, fjournal = "Applied Mathematics and Computation", journal-URL = "http://www.sciencedirect.com/science/journal/00963003/", } @Article{Leiss:1980:CFA, author = "Ernst Leiss", title = "Constructing a finite automaton for a given regular expression", journal = j-SIGACT, volume = "12", number = "3", pages = "81--87", month = "Fall", year = "1980", CODEN = "SIGNDM", DOI = "https://doi.org/10.1145/1008861.1008870", ISSN = "0163-5700 (print), 1943-5827 (electronic)", ISSN-L = "0163-5700", bibdate = "Wed Mar 21 08:21:20 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigact.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGACT News", journal-URL = "http://dl.acm.org/citation.cfm?id=J697", } @Article{Rytter:1980:CPA, author = "Wojciech Rytter", title = "A correct preprocessing algorithm for {Boyer--Moore} string-searching", journal = j-SIAM-J-COMPUT, volume = "9", number = "3", pages = "509--512", month = "????", year = "1980", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68H05 (68C05)", MRnumber = "81g:68129", bibdate = "Mon Nov 29 10:59:17 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/9/3; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Salter:1980:CLC, author = "Richard M. Salter and Terence J. Brennan and Daniel P. Friedman", title = "{Concur}: a Language for Continuous, Concurrent Processes", journal = j-COMP-LANGS, volume = "5", number = "3-4", pages = "163--189", month = "????", year = "1980", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C6140D (High level languages)", classification = "723", corpsource = "Drexel Univ., Philadelphia, PA, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "computer programming languages; CONCUR; continuous, concurrent processes; data-driven mode; generalized pattern-matcher; Hendrix's robot; high level languages; industrial robots --- Computer Applications; LISP; modeling system; simulation method", treatment = "P Practical", } @Article{Zvegintzov:1980:PMR, author = "N. Zvegintzov", title = "Partial-Match Retrieval in an Index Sequential Directory", journal = j-COMP-J, volume = "23", number = "1", pages = "37--40", month = feb, year = "1980", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/23.1.37", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", MRclass = "68H05 (68C05)", MRnumber = "80m:68084", bibdate = "Tue Dec 4 14:48:07 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/23/1.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_01/; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/23/1/37.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_01/tiff/37.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_01/tiff/38.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_01/tiff/39.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_23/Issue_01/tiff/40.tif", acknowledgement = ack-nhfb, classcodes = "C6120 (File organisation)", classification = "723; 901", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "file organisation; fixed length strings; index sequential directory; information retrieval systems; partial match retrieval; partially specified templates; table lookup", treatment = "P Practical", } @Article{Barth:1981:AIK, author = "Gerhard Barth", title = "An Alternative for the Implementation of the {Knuth--Morris--Pratt} Algorithm", journal = j-INFO-PROC-LETT, volume = "13", number = "4--5", pages = "134--137", day = "??", month = "End", year = "1981", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(81)90042-9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, annote = "This issue was labelled End 1981, instead of Day Month 1981.", classification = "C6120 (File organisation); C7250L (Non-bibliographic retrieval systems)", corpsource = "Computer Sci. Dept., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "information retrieval; Knuth--Morris--Pratt algorithm; PASCAL; string matching", treatment = "P Practical", } @TechReport{Beebe:1981:IPM, author = "Nelson H. F. Beebe", title = "Ideas for Pattern Matching Software", institution = inst-CLSC, address = inst-CLSC:adr, pages = "3", day = "12", month = may, year = "1981", bibdate = "Thu Sep 07 06:04:40 2006", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/b/beebe-nelson-h-f.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Galil:1981:LTS, author = "Z. Galil and J. Seireras", title = "Linear-time string-matching using only a fixed number of local storage locations", journal = j-THEOR-COMP-SCI, volume = "13", number = "3", pages = "331--336", month = mar, year = "1981", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Math. Sci., Tel-Aviv Univ., Tel-Aviv, Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "automata-theoretic terms; dynamic storage allocation; finite automata; FORTRAN; linear-time string-matching algorithm; local storage locations; programming theory; random-access machine; restricted writing alphabet; writing multihead finite automaton", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Galil:1981:SMR, author = "Z. Galil", title = "String Matching in Real Time", journal = j-J-ACM, volume = "28", number = "1", pages = "134--149", month = jan, year = "1981", CODEN = "JACOAH", DOI = "https://doi.org/10.1145/322234.322244", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Tue Oct 25 22:10:20 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A sufficient condition for an on-line algorithm to be transformed into a real-time algorithm is given. This condition is used to construct real-time algorithms for various string-matching problems by random access machines and by Turing machines.", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", } @InProceedings{Galil:1981:TSO, author = "Zvi Galil and Joel Seiferas", title = "Time-space-optimal string matching (Preliminary Report)", crossref = "ACM:1981:CPT", pages = "106--113", year = "1981", bibdate = "Wed Feb 20 18:33:45 MST 2002", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @TechReport{Karp:1981:ERPa, author = "R. M. Karp and M. O. Rabin", title = "Efficient Randomized Pattern-Matching Algorithms", type = "Technical report", number = "TR-31-81", institution = "Harvard University", address = "Cambridge, MA, USA", pages = "??", month = "??", year = "1981", bibdate = "Sun May 02 07:50:09 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1970.bib; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "An incremental hash function is described for application to the string search problem. See \cite{Baeza-Yates:1992:NAT}.", acknowledgement = ack-nhfb, } @TechReport{Karp:1981:ERPb, author = "R. M. Karp and M. O. Rabin", title = "Efficient Randomized Pattern-Matching Algorithms", number = "TR-31-81", institution = "Harvard University", address = "Cambridge, MA, USA", year = "1981", bibdate = "Sun May 02 07:50:09 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Baeza-Yates:1992:NAT}.", acknowledgement = ack-nhfb, } @Article{Leiss:1981:CRR, author = "Ernst Leiss", title = "The complexity of restricted regular expressions and the synthesis problem for finite automata", journal = j-J-COMP-SYS-SCI, volume = "23", number = "3", pages = "348--354", month = dec, year = "1981", CODEN = "JCSSBM", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:25:46 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0022000081900702", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Liu:1981:SPM, author = "Ken Chih Liu", title = "On string pattern matching: a new model with a polynomial time algorithm", journal = j-SIAM-J-COMPUT, volume = "10", number = "1", pages = "118--140", month = "????", year = "1981", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68C25 (68G10)", MRnumber = "83c:68050", bibdate = "Mon Nov 29 10:59:25 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/10/1; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Magel:1981:REP, author = "Kenneth Magel", title = "Regular expressions in a program complexity metric", journal = j-SIGPLAN, volume = "16", number = "7", pages = "61--65", month = jul, year = "1981", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 28 16:17:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Univ. of Missouri, Rolla, MO, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "computational complexity; execution sequences; program complexity metric; program control flow complexity; regular expressions", treatment = "T Theoretical or Mathematical", } @Article{Reid:1981:ABB, author = "Brian K. Reid and David Hanson", title = "An annotated bibliography of background material on text manipulation", journal = j-SIGPLAN, volume = "16", number = "6", pages = "157--160", month = jun, year = "1981", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:34 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C0310 (EDP management); C6130 (Data handling techniques)", conflocation = "Portland, OR, USA; 8-10 June 1981", conftitle = "Proceedings of the ACM SIGPLAN SIGOA Symposium on Text Manipulation", corpsource = "Stanford Univ., Stanford, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "document formatting; graphic communication; pattern matching; string communication; string matching; text editing; text manipulation; typography; writing style", treatment = "G General Review", } @Article{Rodeh:1981:LAD, author = "Michael Rodeh and Vaughan R. Pratt and Shimon Even", title = "Linear Algorithm for Data Compression via String Matching", journal = j-J-ACM, volume = "28", number = "1", pages = "16--24", month = jan, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-ds # " and " # ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", rawdata = "Rodeh, Michael, Vaughan R. Pratt and Shimon Even (1981) ``Linear Algorithm for Data Compression via String Matching,'' Journal of the ACM, {\bf28}(1):16--24, January.", } @Article{Schilit:1981:SGB, author = "Bill N. Schilit", title = "A solution to the great big substitution problem: subject modification during pattern matching in {SNOBOL4}", journal = j-SIGPLAN, volume = "16", number = "8", pages = "41--49", month = aug, year = "1981", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Tue Oct 28 16:17:00 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Center for Computing Activities, Columbia Univ., New York, NY, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "data handling; high level languages; pattern matching; programming language; SNOBOL4; substitution problem; substrings", treatment = "P Practical", } @Article{Talcott:1981:BRC, author = "Carolyn Talcott", title = "Book Review: {{\booktitle{A Computational Logic}} (Robert S. Boyer and J. Strother Moore)}", journal = j-SIAM-REVIEW, volume = "23", number = "2", pages = "264--266", month = "????", year = "1981", CODEN = "SIREAD", DOI = "https://doi.org/10.1137/1023053", ISSN = "0036-1445 (print), 1095-7200 (electronic)", ISSN-L = "0036-1445", bibdate = "Sat Mar 29 09:53:18 MDT 2014", bibsource = "http://epubs.siam.org/toc/siread/23/2; https://www.math.utah.edu/pub/tex/bib/siamreview.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Review", journal-URL = "http://epubs.siam.org/sirev", onlinedate = "April 1981", } @Article{Tarjan:1981:FAS, author = "Robert Endre Tarjan", title = "Fast Algorithms for Solving Path Problems", journal = j-J-ACM, volume = "28", number = "3", pages = "594--614", month = jul, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Let {$ G = (V, E) $} be a directed graph with a distinguished source vertex $s$. The single-source path expression problem is to find, for each vertex $v$, a regular expression {$ P(s, v) $} which represents the set of all paths in {$G$} from $s$ to $v$. A solution to this problem can be used to solve shortest path problems, solve sparse systems of linear equations, and carry out global flow analysis. A method is described for computing path expressions by dividing {$G$} into components, computing path expressions on the components by Gaussian elimination, and combining the solutions. This method requires {$ O(m \alpha (m, n)) $} time on a reducible flow graph, where $n$ is the number of vertices in {$G$}, $m$ is the number of edges in {$G$}, and $ \alpha $ is a functional inverse of Ackermann's function. The method makes use of an algorithm for evaluating functions defined on paths in trees. A simplified version of the algorithm, which runs in {$ O(m \log n) $} time on reducible flow graphs, is quite easy to implement and efficient in practice.", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques --- Graph Theory", } @Article{Tarjan:1981:UAP, author = "Robert Endre Tarjan", title = "A Unified Approach to Path Problems", journal = j-J-ACM, volume = "28", number = "3", pages = "577--593", month = jul, year = "1981", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Compiler/Compiler.Lins.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A general method is described for solving path problems on directed graphs. Such path problems include finding shortest paths, solving sparse systems of linear equations, and carrying out global flow analysis of computer programs. The method consists of two steps. First, a collection of regular expressions representing sets of paths in the graph is constructed. This can be done by using any standard algorithm, such as Gaussian or Gauss--Jordan elimination. Next, a natural mapping from regular expressions into the given problem domain is applied. The mappings required to find shortest paths are exhibited, sparse systems of linear equations are solved, and global flow analysis is carried out. The results provide a general-purpose algorithm for solving any path problem and show that the problem of constructing path expressions is in some sense the most general path problem.", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming; mathematical techniques", } @Article{Thomas:1981:RSH, author = "W. Thomas", title = "Remark on the star-height-problem", journal = j-THEOR-COMP-SCI, volume = "13", number = "2", pages = "231--237", month = feb, year = "1981", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Math. Inst., Freiburg, West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "automata theory; general regular expressions; regular events; star height problem", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Allen:1982:FID, author = "F. W. Allen", title = "A file index for document storage and retrieval utilizing descriptor fragments", journal = j-COMP-J, volume = "25", number = "1", pages = "2--6", month = feb, year = "1982", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/25.1.2", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:12 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/25/1.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/25/1/2.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/2.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/3.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/4.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/5.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_25/Issue_01/tiff/6.tif", acknowledgement = ack-nhfb, classcodes = "C7240 (Information analysis and indexing); C7250C (Bibliographic retrieval systems)", classification = "723; 901", corpsource = "Dept. of Management Information Systems, Univ. of Arizona, Tucson, AZ, USA", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "algorithm; author names; bit index; character substrings; descriptor; document retrieval; document storage; document texts; file index; file subset addresses; fragments; indexing; information retrieval; information science; information storage; keywords; mapping; partial match; probabilities; queries; search strategy; titles; word fragments", treatment = "P Practical", } @Article{Burkowski:1982:HHS, author = "Forbes J. Burkowski", title = "A hardware hashing scheme in the design of a multiterm string comparator", journal = j-IEEE-TRANS-COMPUT, volume = "C-31", number = "9", pages = "825--834", month = sep, year = "1982", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1982.1676098", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Jul 10 10:33:15 MDT 2011", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See correction \cite{Burkowski:1984:CHH}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676098", abstract = "A discussion is provided of the off-the-shelf'' design of a term detection unit which may be used in the scanning of text emanating from a serial source such as disk or bubble memory. The main objective of this design is the implementation of a high performance unit which can detect any one of many terms (e. g., 1024 terms) while accepting source text at disk transfer rates. The unit incorporates off-the-shelf'' off-the-shelf'' currently available chips. The design involves a hardware-based hashing scheme that allows incoming text to be compared to selected terms in a RAM which contains all of the strings to be detected. The organization of data in the RAM of the term detector is dependent on a graph-theoretic algorithm which computes maximal matchings on bipartite graphs. The capability of the unit depends on various parameters in the design, and this dependence is demonstrated by means of various tables that report on the results of various simulation studies.", acknowledgement = ack-nhfb, classification = "722; 723; 901", fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", journalabr = "IEEE Trans Comput", keywords = "information retrieval systems", } @Article{Davies:1982:SST, author = "D. Julian M. Davies", title = "String Searching in Text Editors", journal = j-SPE, volume = "12", number = "8", pages = "709--717", month = aug, year = "1982", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380120803", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "algorithms", onlinedate = "27 Oct 2006", review = "ACM CR 40357", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching \\ I.7 Computing Methodologies, TEXT PROCESSING, Text Editing", } @Article{deVSmit:1982:CTS, author = "G. {de V. Smit}", title = "A Comparison of Three String Matching Algorithms", journal = j-SPE, volume = "12", number = "1", pages = "57--66", month = jan, year = "1982", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380120106", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "27 Oct 2006", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", xxauthor = "G. D. V. Smith", } @Article{Duff:1982:CBS, author = "Steven G. Duff", title = "The case for {BUFFERS} in {SNOBOL4}", journal = j-SIGPLAN, volume = "17", number = "11", pages = "24--30", month = nov, year = "1982", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/988152.988157", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:16:35 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Two articles have appeared recently in SIGPLAN Notices describing the 'Great Big Substitution Problem' of SNOBOL4 pattern matching [BLAT80, SCHI81]. Although the proposals in these papers are different, they both suggest the addition of new operators to the language to solve the problem. The purpose of this paper is to show that the Great Big Substitution Problem is embedded in a problem of a more pervasive nature, and to suggest a correspondingly more general solution.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Dept. of Computer Sci., California State Univ., Fullerton, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "BUFFERS; high level languages; pattern matching; SNOBOL4; Substitution Problem", treatment = "P Practical", } @Article{Floyd:1982:CRE, author = "Robert W. Floyd and Jeffrey D. Ullman", title = "The Compilation of Regular Expressions into Integrated Circuits", journal = j-J-ACM, volume = "29", number = "3", pages = "603--622", month = jul, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The design of integrated circuits to implement arbitrary regular expressions is considered. In general, a regular expression with $n$ operands may be converted into a nondeterministic finite automaton with at most $n$ states and $n$ transitions. Instead of converting the nondeterministic device to a deterministic one, two ways of implementing the nondeterministic device directly are proposed. One approach is to produce a PLA (programmable logic array) of approximate dimensions $n$ rows and $ 2 n $ columns by representing the states of the nondeterministic finite automaton directly by columns. Another approach is to use the hierarchical structure of the automaton produced from the regular expression by the McNaughton--Yamada algorithm to guide a hierarchical layout of the circuit. The advantages of each approach are discussed.", acknowledgement = ack-nhfb, classification = "713; 723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "automatic layout; integrated circuits", } @Article{Ganapathi:1982:RCC, author = "Mahadevan Ganapathi and Charles N. Fischer and John L. Hennessy", key = "Ganapathi et al.", title = "Retargetable Compiler Code Generation", journal = j-COMP-SURV, volume = "14", number = "4", pages = "573--592", month = dec, year = "1982", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356893.356897", ISSN = "0010-4892", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:31:39 MDT 2008", bibsource = "Compendex database; http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/virtual-machines.bib", note = "See also \cite{Wulf:1983:SFR,Ganapathi:1983:SFRa,Fraser:1983:SFR,Ganapathi:1983:SFRb}.", abstract = "A classification of automated retargetable code generation techniques and a survey of the work on these techniques is presented. Retargetable code generation research is classified into three categories: interpretive code generation, pattern-matched code generation, and table-driven code generation. Interpretive code generation approaches generate code for a virtual machine and then expand into real target code. Pattern-matched code generation approaches separate the machine description from the code generation algorithm. Table-driven code generation approaches employ a formal machine description and use a code-generator generator to produce code generators automatically. An analysis of these techniques and a critique of automatic code generation algorithms are presented.", acknowledgement = ack-nhfb, classification = "723", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "Code-generator generator; compiler compiler; computer programming languages; intermediate representation; machine description; machine-dependent optimization", owner = "manning", } @Article{Graham:1982:ETD, author = "Susan L. Graham and Robert R. Henry and Robert A. Schulman", title = "An experiment in table driven code generation", journal = j-SIGPLAN, volume = "17", number = "6", pages = "32--43", month = jun, year = "1982", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:38 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Boston, MA, USA; 23-25 June 1982", conftitle = "Proceedings of the SIGPLAN '82 Symposium on Compiler Construction", corpsource = "Computer Sci. Div., Dept. of Electrical Engng. and Computer Sci., Univ. of California, Berkeley, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "grammar; grammars; local code generator; machine description; OS; parser-like instruction pattern matcher; program compilers; table driven code generation; UNIX Portable 'C' compiler; VAX- 11", sponsororg = "ACM", treatment = "P Practical", } @TechReport{Guoan:1982:USM, author = "Gu Guoan and John Hobby", title = "Using String Matching to Compress {Chinese} Characters", type = "Report", number = "STAN-CS-82-914", institution = inst-STAN-CS, address = inst-STAN-CS:adr, year = "1982", bibdate = "Tue Mar 1 12:50:20 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib", acknowledgement = ack-hk, } @Article{Hoffmann:1982:PMT, author = "Christoph M. Hoffmann and Michael J. O'Donnell", title = "Pattern Matching in Trees", journal = j-J-ACM, volume = "29", number = "1", pages = "68--95", month = jan, year = "1982", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Theory/algebraic.spec.1.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Five new techniques for tree pattern matching are presented, analyzed for time and space complexity, and compared with previously known methods. Particularly important are applications where the same patterns are matched against many subjects and where a subject may be modified incrementally. Therefore, methods which spend some time preprocessing patterns in order to improve the actual matching time are included.", acknowledgement = ack-nhfb, classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "computer programming; functional; mathematical techniques --- Trees; pattern matching", } @Article{Karpinski:1982:DSM, author = "M. Karpinski", title = "Decidability of `{Skolem} matrix emptiness problem' entails constructability of exact regular expression", journal = j-THEOR-COMP-SCI, volume = "17", number = "1", pages = "99--102", month = jan, year = "1982", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1980.bib", acknowledgement = ack-nhfb, classification = "B0290B (Error analysis in numerical methods); C4220 (Automata theory)", corpsource = "Math. Sci. Dept., IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "algorithm; constructability; finite automata; finite state machine; Kleene regular expression; matrix algebra; matrix equivalence; Skolem matrix emptiness", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Lee:1982:EAF, author = "Edward T. Lee", title = "An efficient algorithm for finding {Kleene} closure of regular expression matrices", journal = j-INT-J-COMPUT-INF-SCI, volume = "11", number = "6", pages = "409--415", month = dec, year = "1982", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68F10", MRnumber = "84i:68140", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1110 (Algebra); C1250 (Pattern recognition); C4220 (Automata theory)", corpsource = "Dept. of Math. Sci., Memphis State Univ., Memphis, TN, USA", fjournal = "International Journal of Computer and Information Sciences", journal-URL = "http://link.springer.com/journal/10766", keywords = "automata theory; efficient algorithm; fuzzy regular expression matrices; Kleene closure; matrix algebra; pattern recognition; pictorial information systems; regular expression matrices", treatment = "T Theoretical or Mathematical", } @Article{Morgan:1982:AEI, author = "Thomas M. Morgan and Lawrence A. Rowe", title = "Analyzing exotic instructions for a retargetable code generator", journal = j-SIGPLAN, volume = "17", number = "6", pages = "197--204", month = jun, year = "1982", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:38 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Boston, MA, USA; 23-25 June 1982", conftitle = "Proceedings of the SIGPLAN '82 Symposium on Compiler Construction", corpsource = "Dept. of Electrical Engng. and Computer Sci., Univ. of California, Berkeley, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "block move; compilers; exotic instructions; high-level language operators; instruction set analysis systems; program compilers; retargetable code generator; source-to-source transformations; string edit; string search", sponsororg = "ACM", treatment = "P Practical", } @Article{Sommerville:1982:PMS, author = "Ian Sommerville", title = "A Pattern Matching System", journal = j-SPE, volume = "12", number = "6", pages = "517--530", month = jun, year = "1982", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "design; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types", } @Article{Tharp:1982:PTS, author = "Alan L. Tharp and Kuo-Chung Tai", title = "The Practicality of Text Signatures for Accelerating String Searching", journal = j-SPE, volume = "12", number = "1", pages = "35--44", month = jan, year = "1982", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "Expands Harrison's work \cite{Harrison:1971:IST}.", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "design; experimentation", review = "ACM CR 39738", subject = "D.1 Software, PROGRAMMING TECHNIQUES, Miscellaneous \\ E.2 Data, DATA STORAGE REPRESENTATIONS, Hash-table representations \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ I.7 Computing Methodologies, TEXT PROCESSING, Text Editing", } @Article{Wong:1982:DAS, author = "K. Y. Wong and R. G. Casey and F. M. Wahl", title = "{Document Analysis System}", journal = j-IBM-JRD, volume = "26", number = "6", pages = "647--656", month = nov, year = "1982", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "http://www.research.ibm.com/journal/; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C7240 (Information analysis and indexing)", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", keywords = "classification; clustering; computer; Document Analysis System; encoding; font sizes; front styles; information analysis; linear adaptive classification scheme; pattern-matching method; processing; run-length; segmentation; smoothing algorithm", treatment = "P Practical", } @Article{Barrero:1983:RLT, author = "A. Barrero and M. G. Thomason and R. C. Gonzalez", title = "Regular-like tree expressions", journal = j-INT-J-COMPUT-INF-SCI, volume = "12", number = "1", pages = "1--11", month = feb, year = "1983", CODEN = "IJCIAH", DOI = "https://doi.org/10.1007/BF00996800", ISSN = "0091-7036", ISSN-L = "0091-7036", bibdate = "Sat Apr 26 12:20:22 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Electrical Engng., Univ. of Tennessee, Knoxville, TN, USA", fjournal = "International Journal of Computer and Information Sciences", journal-URL = "http://link.springer.com/journal/10766", keywords = "chemistry grammars; context-free languages; expansive tree grammar; expansive tree languages; one-to-one correspondence; regular-like tree; regularity-preserving transformations; trees (mathematics)", treatment = "P Practical", } @Article{Fraser:1983:SFR, author = "Christopher W. Fraser", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "281--283", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356922", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Ganapathi:1983:SFRa,Ganapathi:1983:SFRb}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Galil:1983:TSO, author = "Zvi Galil and Joel Seiferas", title = "Time-space-optimal string matching", journal = j-J-COMP-SYS-SCI, volume = "26", number = "3", pages = "280--294", month = jun, year = "1983", CODEN = "JCSSBM", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:25:49 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0022000083900028", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @Article{Ganapathi:1983:SFRa, author = "M. Ganapathi and J. L. Hennessy and C. N. Fischer", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "280--281", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356921", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Fraser:1983:SFR,Ganapathi:1983:SFRb}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Ganapathi:1983:SFRb, author = "M. Ganapathi and J. L. Hennessy and C. N. Fischer", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "283--284", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356923", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Ganapathi:1982:RCC,Wulf:1983:SFR,Ganapathi:1983:SFRa,Fraser:1983:SFR}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @InProceedings{Gonnet:1983:UDB, author = "Gaston H. Gonnet", title = "Unstructured Data Bases or Very Efficient Text Searching", crossref = "ACM:1983:PSA", pages = "117--124", year = "1983", bibdate = "Sat Jan 25 17:38:12 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "ACM (order n 475830). Baltimore, MD, USA.", abstract = "Several algorithms are presented for searching data bases that consist of text. The algorithms apply mostly to very large data bases that are difficult to structure. Algorithms are described which search the original data base without transformation and hence could be used as general text searching algorithms. Also described are algorithms requiring pre-processing, the best of them achieving a logarithmic behaviour. These efficient algorithms solve the `plagiarism' problem among n papers. The problem of misspellings, ambiguous spellings, simple errors, endings, positional information, etc. is treated using signature functions.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Waterloo, Dep of Computer Science, Waterloo, Ont, Can", classification = "722; 723; 901", conference = "Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems.", keywords = "computer programming --- Algorithms; computer systems, digital --- On Line Operation; data processing --- Data Handling; database systems; Design; full text search; hashing; information retrieval systems --- Online Searching; pattern matching; string searching; text searching algorithms; unstructured data bases", meetingaddress = "Atlanta, GA, USA", sponsor = "ACM, Special Interest Group for Automata \& Computability Theory, New York, NY, USA; ACM, Special Interest Group for the Management of Data, New York, NY, USA", } @Article{Griswold:1983:ISP, author = "Ralph E. Griswold", title = "Implementing {Snobol4} Pattern Matching in {Icon}", journal = j-COMP-LANGS, volume = "8", number = "2", pages = "77--92", month = "????", year = "1983", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", classification = "723", corpsource = "Dept. of Computer Sci., Univ. of Arizona, Tucson, AZ, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "computer software; cursor model; data handling; Icon; pattern matching; pattern recognition; SNOBOL4 pattern matching; string; substring model", treatment = "P Practical", } @Article{Haskin:1983:OCH, author = "Roger L. Haskin and Lee A. Hollaar", title = "Operational Characteristics of a Hardware-Based Pattern Matcher", journal = j-TODS, volume = "8", number = "1", pages = "15--40", month = mar, year = "1983", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "Compendex database; Database/Graefe.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tods.bib", URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-1/p15-haskin/p15-haskin.pdf; http://www.acm.org/pubs/citations/journals/tods/1983-8-1/p15-haskin/", abstract = "The design and operation of a new class of hardware-based pattern matchers, such as would be used in a backended database processor in a full-text or other retrieval system, is presented. This recognizer is based on a unique implementation technique for finite state automata consisting of partitioning the state table among a number of simple digital machines. It avoids the problems generally associated with implementing finite state machines, such as large state table memories, complex control mechanisms, and state encodings. Because it consists primarily of memory, with its high regularity and density, needs only limited static interconnections, and operates at a relatively low speed, it can be easily constructed using integrated circuit techniques.\par After a brief discussion of other pattern-matching hardware, the structure and operation of the partitioned finite state automaton is given, along with a simplified discussion of how the state tables are partitioned. The expected performance of the resulting system and the state table partitioning programs is then discussed.", acknowledgement = ack-nhfb, classification = "723; 901", fjournal = "ACM Transactions on Database Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777", keywords = "backend processors; computer system architecture; database systems; finite state automata; full text retrieval systems; information science; text searching", subject = "Hardware --- Logic Design --- Design Styles (B.6.1): {\bf Cellular arrays and automata}; Hardware --- Integrated Circuits --- Types and Design Styles (B.7.1): {\bf Algorithms implemented in hardware}; Information Systems --- Database Management --- Database Machines (H.2.6); Information Systems --- Information Storage and Retrieval --- Information Search and Retrieval (H.3.3): {\bf Search process}", } @Article{Ito:1983:HFO, author = "Tetsuro Ito and Makoto Kizawa", title = "Hierarchical File Organization and its Application to Similar-String Matching", journal = j-TODS, volume = "8", number = "3", pages = "410--433", month = sep, year = "1983", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "Compendex database; Database/Graefe.bib; Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tods.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-3/p410-ito/p410-ito.pdf; http://www.acm.org/pubs/citations/journals/tods/1983-8-3/p410-ito/", abstract = "The automatic correction of misspelled inputs is discussed from a viewpoint of similar-string matching. First a hierarchical file organization based on a linear ordering of records is presented for retrieving records highly similar to any input query. Then the spelling problem is attacked by constructing a hierarchical file for a set of strings in a dictionary of English words. The spelling correction steps proceed as follows: (1) find one of the best-match strings which are most similar to a query, (2) expand the search area for obtaining the good-match strings, and (3) interrupt the file search as soon as the required string is displayed. Computational experiments verify the performance of the proposed methods for similar-string matching under the UNIX time-sharing system.", acknowledgement = ack-nhfb, annote = "A spelling checker to provide possible correct spellings for all possible words. Results are quite sketchy", classification = "723", fjournal = "ACM Transactions on Database Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777", keywords = "best match; data processing, algorithms; experimentation; file organization; good match; hierarchical clustering; linear ordering; measurement; office automation; performance; similar-string; similarity; spelling correction; text editor; theory; verification", review = "ACM CR 8408-0665", subject = "I.2 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Natural Language Processing \\ I.5.4 Computing Methodologies, PATTERN RECOGNITION, Applications, Text processing \\ E.5 Data, FILES, Organization/structure \\ H.3.2 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Storage, File organization \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Selection process \\ H.4 Information Systems, INFORMATION SYSTEMS APPLICATIONS, Office Automation", } @Article{Johnsen:1983:CTL, author = "O. Johnsen and J. Segen and G. L. Cash", title = "Coding of Two-Level Pictures by Pattern Matching and Substitution", journal = j-BELL-SYST-TECH-J, volume = "62", number = "8", pages = "2513--2545", month = oct, year = "1983", CODEN = "BSTJAN", ISSN = "0005-8580", bibdate = "Tue Nov 9 11:15:56 MST 2010", bibsource = "http://bstj.bell-labs.com/oldfiles/year.1983/BSTJ.1983.6208.html; http://www.alcatel-lucent.com/bstj/vol62-1983/bstj-vol62-issue08.html; https://www.math.utah.edu/pub/tex/bib/bstj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://bstj.bell-labs.com/BSTJ/images/Vol62/bstj62-8-2513.pdf; http://www.alcatel-lucent.com/bstj/vol62-1983/articles/bstj62-8-2513.pdf", acknowledgement = ack-nhfb, fjournal = "The Bell System Technical Journal", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/", } @Article{Kashyap:1983:NSM, author = "R. L. Kashyap and B. J. Oommen", title = "The Noisy Substring Matching Problem", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-9", number = "3", pages = "365--370", month = may # "\slash " # jun, year = "1983", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1983.237018", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1703065", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Kornman:1983:PMP, author = "Brent D. Kornman", title = "Pattern Matching and Pattern-Directed Invocation in Systems Programming Languages", journal = j-J-SYST-SOFTW, volume = "3", number = "1", pages = "95--102", month = mar, year = "1983", CODEN = "JSSODM", ISSN = "0164-1212 (print), 1873-1228 (electronic)", ISSN-L = "0164-1212", bibdate = "Wed Dec 16 15:40:53 MST 1998", bibsource = "Compendex database; http://www.sciencedirect.com/science/journal/01641212; https://www.math.utah.edu/pub/tex/bib/jsystsoftw.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "PAR Technology Corp, New Hartford, NY, USA", classification = "723; 912", fjournal = "The Journal of systems and software", journal-URL = "http://www.sciencedirect.com/science/journal/01641212", journalabr = "J Syst Software", keywords = "computer programming languages; pattern matching; pattern recognition; pattern-directed invocation; systems science and cybernetics --- Artificial Intelligence", } @Article{Moran:1983:CDO, author = "Shlomo Moran", title = "On the Complexity of Designing Optimal Partial-Match Retrieval Systems", journal = j-TODS, volume = "8", number = "4", pages = "543--551", month = dec, year = "1983", CODEN = "ATDSD3", ISSN = "0362-5915 (print), 1557-4644 (electronic)", ISSN-L = "0362-5915", MRclass = "68P20 (68P10)", MRnumber = "86j:68024", bibdate = "Sat Apr 14 10:34:48 MDT 2001", bibsource = "Compendex database; Database/Graefe.bib; Database/Wiederhold.bib; Graphics/siggraph/83.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tods.bib", URL = "http://www.acm.org/pubs/articles/journals/tods/1983-8-4/p543-moran/p543-moran.pdf; http://www.acm.org/pubs/citations/journals/tods/1983-8-4/p543-moran/", abstract = "We consider the problem of designing an information retrieval system on which partial match queries have to be answered. Each record in the system consists of a list of {\em attributes}, and a partial match query specifies the values of some of the attributes. The records are stored in {\em buckets\/} in a secondary memory, and in order to answer a partial match query all the buckets that may contain a record satisfying the specifications of that query must be retrieved. The bucket in which a given record is stored is found by a multiple key hashing function, which maps each attribute to a string of a fixed number of bits. The address of that bucket is then represented by the string obtained by concatenating the strings on which the various attributes were mapped. A partial match query may specify only part of the bits in the string representing the address, and the larger the number of bits specified, the smaller the number of buckets that have to be retrieved in order to answer the query. \par The optimization problem considered in this paper is that of deciding to how many bits each attribute should be mapped by the bashing function above, so that the expected number of buckets retrieved per query is minimized. Efficient solutions for special cases of this problem have been obtained in [1], [12], and [14]. It is shown that in general the problem is NP-hard, and that if {$P$} NP, it is also not fully approximable. Two heuristic algorithms for the problem are also given and compared.", acknowledgement = ack-nhfb, annote = "Optimal variable bit lengths of hashstrings, it is NP-hard.", classification = "723; 901; 922", fjournal = "ACM Transactions on Database Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J777", keywords = "approximation algorithms; computer programming --- algorithms; file organization; hashing; information science; NP-hard problems; optimization, TODS hashing, searching; partial match retrieval; searching", oldlabel = "geom-947", review = "ACM CR 8411-0954", subject = "Theory of Computation --- Analysis of Algorithms and Problem Complexity --- Nonnumerical Algorithms and Problems (F.2.2); Information Systems --- Information Storage and Retrieval --- Information Search and Retrieval (H.3.3)", } @Book{Sedgewick:1983:A, author = "Robert Sedgewick", title = "Algorithms", publisher = pub-AW, address = pub-AW:adr, pages = "viii + 551", year = "1983", ISBN = "0-201-06672-6", ISBN-13 = "978-0-201-06672-2", LCCN = "QA76.6 .S435 1983", bibdate = "Wed Dec 15 18:23:21 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, tableofcontents = "Introduction \\ 1. Preview \\ Mathematical Algorithms \\ 2. Arithmetic \\ 3. Random numbers \\ 4. Polynomials \\ 5. Gaussian Elimination \\ 6. Curve fitting \\ 7. Integration \\ Sorting \\ 8. Elementary sorting methods \\ 9. Quicksort \\ 10. Radix sorting \\ 11. Priority Queues \\ 12. Selection and merging \\ 13. External sorting \\ Searching \\ 14. Elementary searching methods \\ 15. Balanced trees \\ 16. Hashing \\ 17. Radix searching \\ 18. External searching \\ String Processing \\ 19. String searching \\ 20. Pattern matching \\ 21. Parsing \\ 22. File compression \\ 23. Cryptology \\ Geometric Algorithms \\ 24. Elementary geometric methods \\ 25. Finding the convex hull \\ 26. Range searching \\ 27. Geometric intersection \\ 28. Closest point problems \\ Graph Algorithms \\ 29. Elementary graph algorithms \\ 30. Connectivity \\ 31. Weighted graphs \\ 32. Directed graphs \\ 33. Network flow \\ 34. Matching \\ Advanced Topics \\ 35. Algorithm machines \\ 36. The Fast Fourier Transform \\ 37. Dynamic programming \\ 38. Linear programming \\ 39. Exhaustive search \\ 40. NP-complete problems", } @Article{Simon:1983:PMT, author = "Hans-Ulrich U. Simon", title = "Pattern Matching in Trees and Nets", journal = j-ACTA-INFO, volume = "20", number = "3", institution = "U Saarlandes", pages = "227--248", month = dec, year = "1983", CODEN = "AINFA2", ISSN = "0001-5903 (print), 1432-0525 (electronic)", ISSN-L = "0001-5903", MRclass = "68Q45", MRnumber = "85a:68096", bibdate = "Sat Oct 9 09:56:22 MDT 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Graphics/rosenfeld/1984.bib; ftp://ftp.ira.uka.de/pub/bibliography/Misc/HBP/ACTAI.bib; https://www.math.utah.edu/pub/tex/bib/actainfo.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; MathSciNet database", acknowledgement = ack-nhfb, fjournal = "Acta Informatica", journal-URL = "http://www.springerlink.com/content/0001-5903", keywords = "image multiplicity comparison", } @Article{Slissenko:1983:DPS, author = "A. Slissenko", title = "Detection of Periodicities and String-Matching in Real Time", journal = j-J-SOV-MATH, volume = "22", number = "3", pages = "1316--1386", year = "1983", CODEN = "JSOMAR", ISSN = "0090-4104 (print), 2376-5798 (electronic)", ISSN-L = "0090-4104", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/s/slissenko-anatol.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "Russian original in: {\em Zapiski Nauchnykh Seminarov LOMI}, 105:62--173, 1981.", acknowledgement = ack-nhfb, fjournal = "Journal of Soviet Mathematics", journal-URL = "http://link.springer.com/journal/10958", } @Article{Toda:1983:TDP, author = "M. Toda and K. Inoue and I. Takanami", title = "Two-dimensional pattern matching by two-dimensional on-line tessellation acceptors", journal = j-THEOR-COMP-SCI, volume = "24", number = "2", pages = "179--194", month = jul, year = "1983", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:36:07 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1980.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Electronics, Yamaguchi Univ., Ube, Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "array matching problem; finite automata; finite state pattern matching machines; finite state string matching machines; online detection; string matching algorithms; string matching problem; two-dimensional online tessellation acceptor; two-dimensional pattern matching", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Weiser:1983:RSB, author = "Mark Weiser", title = "Reconstructing Sequential Behavior from Parallel Behavior Projections", journal = j-INFO-PROC-LETT, volume = "17", number = "3", pages = "129--135", day = "5", month = oct, year = "1983", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "722; 723; C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Univ. of Maryland, College Park, MD, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "computer programming; computer systems, digital --- Parallel Processing; data flow; data flow slices; formal languages; parallel processing; parallelism; regular expressions; slicing; vectorization", treatment = "T Theoretical or Mathematical", } @Article{Weste:1983:DTW, author = "N. Weste and D. J. Burr and B. D. Ackland", title = "Dynamic Time {Warp} Pattern Matching Using an Integrated Multiprocessing Array", journal = j-IEEE-TRANS-COMPUT, volume = "C-32", number = "8", pages = "731--744", month = aug, year = "1983", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1983.1676311", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Jul 10 10:01:11 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676311", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Wulf:1983:SFR, author = "William A. Wulf and Joe Newcomer and Bruce Leverett and Rick Cattell and Paul Knueven", title = "Surveyor's Forum: {Retargetable} Code Generators", journal = j-COMP-SURV, volume = "15", number = "3", pages = "279--280", month = sep, year = "1983", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/356914.356920", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:32:37 MDT 2008", bibsource = "http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Ganapathi:1982:RCC,Ganapathi:1983:SFRa,Fraser:1983:SFR,Ganapathi:1983:SFRb}.", acknowledgement = ack-nhfb, fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", } @Article{Aoe:1984:MIS, author = "J. Aoe and Y. Yamamoto and R. Shimada", title = "A Method for Improving String Pattern Matching Machines", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "SE-10", number = "1", pages = "116--120", month = jan # "\slash " # feb, year = "1984", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/TSE.1984.5010205", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5010205", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Apostolico:1984:PMM, author = "A. Apostolico and R. Giancarlo", title = "Pattern matching machine implementation of a fast test for unique decipherability", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "155--158", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/cryptography.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "B6140C (Optical information, image and video signal processing); C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C1260 (Information theory)", corpsource = "ISI, Univ. of Salerno, Salerno, Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "codes; fast implementation; graph theory; pattern matching machine; pattern recognition; Sardinas- Patterson-Even test; unique decipherability", treatment = "N New Development; T Theoretical or Mathematical", } @Article{Barth:1984:ACT, author = "Gerhard Barth", title = "An analytical comparison of two string searching algorithms", journal = j-INFO-PROC-LETT, volume = "18", number = "5", pages = "249--256", day = "18", month = jun, year = "1984", CODEN = "IFPLAT", DOI = "https://doi.org/10.1016/0020-0190(84)90003-6", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "85m:68012", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Informatik, Univ. Kaiserslautern, Kaiserslautern, West Germany", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; average case analysis; average case complexities; combinatorial algorithms; comparisons; complexity; computer programming; heuristics; KMP algorithm; Knuth--Morris--Pratt algorithm; Markov chain theory; pattern matching algorithms; string searching algorithms; trial-and-error", treatment = "T Theoretical or Mathematical", } @Article{Barton:1984:SSF, author = "Paul C. Barton", title = "String search function in {C} [letter]", journal = j-DDJ, volume = "9", number = "8", pages = "8--??", month = aug, year = "1984", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Mon Sep 2 09:09:39 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/dr-dobbs-1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Burkowski:1984:CHH, author = "F. J. Burkowski", title = "Correction to {``A Hardware Hashing Scheme in the Design of a Multiterm String Comparator''}", journal = j-IEEE-TRANS-COMPUT, volume = "C-33", number = "4", pages = "375--375", month = apr, year = "1984", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/TC.1984.1676447", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Sun Jul 10 09:22:51 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Burkowski:1982:HHS}.", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1676447", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Cleary:1984:DCU, author = "John G. Cleary and I. H. Witten", title = "Data Compression Using Adaptive Coding and Partial String Matching", journal = j-IEEE-TRANS-COMM, volume = "COM-32", number = "4", pages = "396--402", month = apr, year = "1984", CODEN = "IECMBT", ISSN = "0090-6778 (print), 1558-0857 (electronic)", ISSN-L = "0090-6778", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-ds, fjournal = "IEEE Transactions on Communications", rawdata-1 = "Cleary, John G., and I. H. Witten (1984) ``Data Compression Using Adaptive Coding and Partial String Matching,'' {\it IEEE Transactions on Communications}, {\bf COM-32}(4):396--402, April.", rawdata-2 = "Cleary, J. G., and I. H. Witten (1984) ``Data Compression Using Adaptive Coding and Partial String Matching,'' {\it IEEE Transactions on Communications} COM-32(4):396--402, April.", } @InProceedings{Galil:1984:OPA, author = "Zvi Galil", title = "Optimal parallel algorithms for string matching", crossref = "ACM:1984:PSA", pages = "240--248", year = "1984", bibdate = "Thu Feb 21 06:51:34 MST 2002", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Holub:1984:GCU, author = "Allen I. Holub", title = "{Grep C} --- a {Unix}-Like, Generalized, Regular Expression Parser in {C}", journal = j-DDJ, volume = "9", number = "10", pages = "50--??", month = oct, year = "1984", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Thu Jan 9 09:35:43 MST 1997", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "723", fjournal = "Dr. Dobb's Journal of Software Tools", journalabr = "Dr Dobb's J", keywords = "C language; computer programming languages; computer programs; parser; pattern recognition; regular expressions; text pattern finder; UNIX", pagecount = "29p between p 50 and 83", } @Article{Hurson:1984:VDP, author = "A. R. Hurson", title = "A {VLSI} design for the parallel finite state automaton and its performance evaluation as a hardware scanner", journal = j-INT-J-COMPUT-INF-SCI, volume = "13", number = "6", pages = "491--508", month = dec, year = "1984", CODEN = "IJCIAH", ISSN = "0091-7036", MRclass = "68Q35", MRnumber = "792 724", bibdate = "Sat Apr 26 14:03:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C5220 (Computer architecture)", corpsource = "Sch. of Electr. Eng. and Comptu. Sci., Oklahoma Univ., Norman, OK, USA", fjournal = "International Journal of Computer and Information Sciences", journal-URL = "http://link.springer.com/journal/10766", keywords = "computer architecture; computerised pattern recognition; finite automata; hardware architecture; hardware scanner; parallel finite state automaton; pattern matching; performance evaluation; text retrieval; VLSI; VLSI design", treatment = "T Theoretical or Mathematical", } @InProceedings{Kowalski:1984:NMT, author = "G. Kowalski and A. Meltzer", editor = "{IEEE}", booktitle = "First International Conference on Computer Applications ({June 20--22, 1984})", title = "New multi-term high speed text search algorithms", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "514--522", year = "1984", bibdate = "Sat Sep 02 14:37:42 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, remark = "Not found in IEEE Xplore database.", } @PhdThesis{Liang:1984:WHP, author = "Franklin Mark Liang", title = "Word Hy-phen-a-tion by Com-pu-ter", type = "{Ph.D.} dissertation", school = "Computer Science Department, Stanford University", address = "Stanford, CA, USA", pages = "92", month = mar, year = "1984", bibdate = "Fri Jul 08 14:48:58 2005", bibsource = "https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib", URL = "http://www.tug.org/docs/liang/; http://wwwlib.umi.com/dissertations/fullcit/8329742", abstract = "This thesis describes research leading to an improved word hyphenation algorithm for the T(,E)X82 typesetting system. Hyphenation is viewed primarily as a data compression problem, where we are given a dictionary of words with allowable division points, and try to devise methods that take advantage of the large amount of redundancy present. The new hyphenation algorithm is based on the idea of hyphenating and inhibiting patterns. These are simply strings of letters that, when they match in a word, give us information about hyphenation at some point in the pattern. For example, `-tion' and `c-c' are good hyphenating patterns. An important feature of this method is that a suitable set of patterns can be extracted automatically from the dictionary. In order to represent the set of patterns in a compact form that is also reasonably efficient for searching, the author has developed a new data structure called a packed trie. This data structure allows the very fast search times characteristic of indexed tries, but in many cases it entirely eliminates the wasted space for null links usually present in such tries. We demonstrate the versatility and practical advantages of this data structure by using a variant of it as the critical component of the program that generates the patterns from the dictionary. The resulting hyphenation algorithm uses about 4500 patterns that compile into a packed trie occupying 25K bytes of storage. These patterns find 89\% of the hyphens in a pocket dictionary word list, with essentially no error. By comparison, the uncompressed dictionary occupies over 500K bytes.", acknowledgement = ack-nhfb, } @Article{Moller-Nielsen:1984:EFS, author = "Peter Moller-Nielsen and Jorgen Staunstrup", title = "Experiments with a Fast String Searching Algorithm", journal = j-INFO-PROC-LETT, volume = "18", number = "3", pages = "129--135", day = "30", month = mar, year = "1984", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Computer Sci. Dept., Aarhus Univ., Aarhus, Denmark", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; computer programming; fast string searching algorithm; MultiMaren multiprocessor; multiprocessing systems; multiprocessor; string searching", treatment = "T Theoretical or Mathematical", } @Article{Sellers:1984:PRG, author = "Peter H. Sellers", title = "Pattern recognition in genetic sequences by mismatch density", journal = j-BULL-MATH-BIOL, volume = "46", number = "4", pages = "501--514", month = jul, year = "1984", CODEN = "BMTBAP", DOI = "https://doi.org/10.1007/BF02459499", ISSN = "0092-8240 (print), 1522-9602 (electronic)", ISSN-L = "0092-8240", bibdate = "Wed Jun 28 16:16:02 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/bullmathbiol.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://link.springer.com/article/10.1007/BF02459499", acknowledgement = ack-nhfb, fjournal = "Bulletin of Mathematical Biology", journal-URL = "http://link.springer.com/journal/11538", } @Article{Weiner:1984:LRK, author = "J. L. Weiner", title = "The Logical Record Keeper: {PROLOG} On The {IBM}", journal = j-BYTE, volume = "9", number = "9", pages = "125--31", month = sep, year = "1984", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "/usr/local/src/bib/bibliography/Ai/log.prog.85.bib; https://www.math.utah.edu/pub/tex/bib/byte1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "QA76.5B98", abstract = "This very high-level language makes it easy to program knowledge-intensive tasks. Owners of a personal computer need a language such as PROLOG that allows them to solve common but interesting problems without having to devote an inordinate amount of time to programming. One might think that a language like LISP, which is widely used in the artificial intelligence community, might be as effective as PROLOG for common real-world problems, but that's not the case. LISP is a much lower-level language. The main advantage that PROLOG has over LISP is the fact that patterns and pattern matching are so fundamental to PROLOG. The problem of representing knowledge in LISP is casting that knowledge into lists that LISP can process.", acknowledgement = ack-nhfb, fjournal = "BYTE Magazine", keywords = "high level languages", } @Article{You:1984:PES, author = "Zhisheng You and Anil K. Jain", title = "Performance Evaluation of Shape Matching Via Chord Length Distribution", journal = j-CVGIP, volume = "28", number = "2", pages = "185--198", month = nov, year = "1984", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Thu Feb 6 18:44:11 MST 1997", bibsource = "Compendex database; Graphics/rosenfeld/1984.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Sichuan U/Mich St U", classification = "723", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "chord length distribution; image part form; image processing; pattern recognition; shape matching", } @Article{Abdali:1985:TCR, author = "S. K. Abdali and B. D. Saunders", title = "Transitive closure and related semiring properties via eliminants", journal = j-THEOR-COMP-SCI, volume = "40", number = "2-3", pages = "257--274", month = "????", year = "1985", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci. and Eng., Univ. of Pet. and Min., Dhahran, Saudi Arabia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "algebraic structures; axiomatic formulation; closed semirings; closure algorithms; computer science; correctness; eliminants; finite automata; graph-theoretical path problems; linear equations; matrix closure; operations research; regular expressions; semiring properties; transitive closure", pubcountry = "Netherlands A11", treatment = "T Theoretical or Mathematical", } @TechReport{Aho:1985:APS, author = "Alfred V. Aho and Brian W. Kernighan and Peter J. Weinberger", title = "Awk --- A Pattern Scanning and Processing Language Programmer's Manual", type = "Computing Science Technical Report", number = "118", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "ii ++ 38", day = "5", month = jun, year = "1985", bibdate = "Fri Aug 25 15:53:20 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "Awk is a programming language that allows many tasks of information retrieval, data processing, and report generation to be specified simply. An awk program is a sequence of pattern--action statements that searches a set of files for lines matching any of the specified patterns and executes the action associated with each matching pattern. For example, the pattern \par \$1 == {"name"} \par is a complete {\em awk\/} program that prints all input lines whose first field is the string name; the action \par \{ print \$1, \$2 \} \par is a complete program that prints the first and second fields of each input line; and the pattern--action statement \par \$1 == {"address"} { print \$2, \$3 }\par is a complete program that prints the second and third fields of each. input line whose first field is {\tt address}.\par Awk patterns may include arbitrary combinations of regular expressions and comparison operations on strings, numbers, fields, variables, and array elements. Actions may include the same pattern-matching constructions as in patterns as well as arithmetic and string expressions; assignments; {\tt if-else}, {\tt while} and {\ff for} statements; function calls; and multiple input and output streams. This manual describes the version of awk released in June, 1985.", acknowledgement = ack-nhfb, } @Article{Ashdown:1985:PPM, author = "Ian E. Ashdown", title = "Parallel Pattern Matching and {Fgrep}", journal = j-DDJ, volume = "10", number = "9", pages = "46--??", month = sep, year = "1985", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Thu Jan 9 09:35:43 MST 1997", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "byHeart Software, North Vancouver, BC, Can", affiliationaddress = "byHeart Software, North Vancouver, BC, Can", classification = "723", fjournal = "Dr. Dobb's Journal of Software Tools", journalabr = "Dr Dobb's J", keywords = "Aho--Corasick algorithm; computer operating systems; computer programming --- Algorithms; data processing --- File Organization; fgrep algorithm; file-search utility; parallel pattern; pattern recognition; UNIX operating system", pagecount = "19p between p 46 and 67", } @Book{Berkovich:1985:MSP, author = "Simon Y. Berkovich and Abd El Fatah A. Hegazy", title = "Matching String Patterns in Large Textual Files", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "122--127", year = "1985", ISBN = "0-8186-0639-8", ISBN-13 = "978-0-8186-0639-7", LCCN = "QA75.5 .I6351 1985", bibdate = "Tue May 12 09:47:27 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The authors present a general approach that could be efficient when searching large textual files for near-matching of a set of patterns. The approach is based on a mapping of string segments into key-number values. To apply the terms of query against text strings in a single pass simultaneously, the input set of patterns is arranged in a hash table. The tolerance property of hash collisions and pattern representation by segment extraction can be used to detect different classes of string variations.", acknowledgement = ack-nhfb, affiliationaddress = "George Washington Univ, Washington, DC, USA", classification = "723", conference = "International Symposium on New Directions in Computing.", keywords = "data processing --- File Organization; database searching; database systems; hash tables; large textual files; string pattern matching", meetingaddress = "Trondheim, Norw", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA; Norwegian Inst of Technology, Trondheim, Norw; Kongsberg Vaepenfabrikk, Norw", } @InProceedings{Cheng:1985:APF, author = "H. D. Cheng and K. S. Fu", title = "Algorithm Partition for a Fixed-Size {VLSI} Architecture Using Space-Time Domain Expansion", crossref = "Hwang:1985:PSC", pages = "126--132", year = "1985", bibdate = "Fri Nov 16 08:47:34 2007", bibsource = "https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acsel-lab.com/arithmetic/arith7/papers/ARITH7_Cheng_Fu.pdf", abstract = "The space-time domain expansion method has recently been used to transform a computational task with a recursive formula into a VLSI architecture. In addition to its simplicity and completeness, an important advantage of this method is that it can easily solve the problem of partitioning an algorithm to fit a fixed size VLSI architecture. We propose a computational model and a partition rule which can be easily used to partition any recursive computation problem suited to the space-time domain expansion method so it can be solved on fixed-size VLSI architectures. Several examples, such as partitioned vector inner product, partitioned comparators in relational database management, partitioned matrix multiplications. and partitioned transitive closure computation, parallel recognition of general context-free languages, string matching and dynamic time-warp pattern-matching are used to illustrate the proposed method.", acknowledgement = ack-nhfb, keywords = "algorithm partition; ARITH-7; multiprocessing; pipelining; recursive task; space-time domain expansion; very large scale integration (VLSI)", } @Article{Faloutsos:1985:AMT, author = "Christos Faloutsos", title = "Access Methods for Text", journal = j-COMP-SURV, volume = "17", number = "1", pages = "49--74", month = mar, year = "1985", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/4078.4080", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:34:46 MDT 2008", bibsource = "Compendex database; http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "Also published in/as: ``{Multiattribute} Hashing Using Gray Codes'', ACM SIGMOD, 1986.", URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/4080.html", abstract = "This paper compares text retrieval methods intended for office systems. The operational requirements of the office environment are discussed, and retrieval methods from database systems and from information retrieval systems are examined. We classify these methods and examine the most interesting representatives of each class. Attempts to speed up retrieval with special purpose hardware are also presented, and issues such as approximate string matching and compression are discussed. A qualitative comparison of the examined methods is presented. The signature file method is discussed in more detail.", acknowledgement = ack-nhfb, affiliation = "Univ of Toronto, Computer Systems Research Inst, Toronto, Ont, Can", affiliationaddress = "Univ of Toronto, Computer Systems Research Inst, Toronto, Ont, Can", annote = "Signature files.", classification = "723; 901", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "database systems; design, information science; document retrieval; Information Retrieval; office automation; text retrieval", review = "ACM CR 8601-0058", subject = "{\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval. {\bf H.2.2}: Information Systems, DATABASE MANAGEMENT, Physical Design, Access methods. {\bf H.3.6}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Library Automation. {\bf H.4.1}: Information Systems, INFORMATION SYSTEMS APPLICATIONS, Office Automation. {\bf I.7.m}: Computing Methodologies, TEXT PROCESSING, Miscellaneous.", } @Article{Gillogly:1985:FPM, author = "James J. Gillogly", title = "Fast Pattern Matching for Word Lists", journal = j-CRYPTOLOGIA, volume = "9", number = "1", pages = "55--62", month = jan, year = "1985", CODEN = "CRYPE6", DOI = "https://doi.org/10.1080/0161-118591859762", ISSN = "0161-1194 (print), 1558-1586 (electronic)", ISSN-L = "0161-1194", bibdate = "Mon Jun 30 15:38:43 MDT 2008", bibsource = "http://www.dean.usma.edu/math/pubs/cryptologia/; https://www.math.utah.edu/pub/tex/bib/cryptologia.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.informaworld.com/smpp/content~content=a741902694~db=all~order=page", acknowledgement = ack-nhfb, fjournal = "Cryptologia", journal-URL = "http://www.tandfonline.com/loi/ucry20", romanvolume = "IX", } @Article{GonzalezSmith:1985:PAD, author = "M. E. {Gonzalez Smith} and J. A. Storer", title = "Parallel Algorithms for Data Compression", journal = j-J-ACM, volume = "32", number = "2", pages = "344--373", month = apr, year = "1985", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/3152.html", abstract = "Parallel algorithms for data compression by textual substitution that are suitable for VLSI implementation are studied. Both `static' and `dynamic' dictionary schemes are considered.", acknowledgement = ack-nhfb, affiliationaddress = "Brandeis Univ, Waltham, MA, USA", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "Algorithms; algorithms; computer programming; computer systems, digital --- Parallel Processing; data compression; image information; parallel algorithms; statistics; theory; verification; VLSI", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf B.7.1}: Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration). {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems. {\bf G.1.0}: Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Routing and layout.", } @Article{Griswold:1985:RSI, author = "Ralph E. Griswold", title = "{Rebus} --- a {SNOBOL4\slash Icon} hybrid", journal = j-SIGPLAN, volume = "20", number = "2", pages = "7--16", month = feb, year = "1985", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/988304.988306", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:20:20 MDT 2008", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "control structures; high level languages; Icon; pattern matching; programming language; Rebus; semantic framework; SNOBOL4; syntax", treatment = "P Practical", } @Article{Hoffman:1985:IIA, author = "C. M. Hoffman and M. J. O'Donnell and R. I. Strandh", title = "Implementation of an interpreter for abstract equations", journal = j-SPE, volume = "15", number = "12", pages = "1204--1185", month = dec, year = "1985", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Wed Aug 24 12:18:38 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "languages; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes, Reducibility and completeness \\ F.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Interpreters \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing", } @Article{Hoffmann:1985:IIA, author = "Christoph M. Hoffmann and Michael J. O'Donnell and Robert I. Strandh", title = "Implementation of an Interpreter for Abstract Equations", journal = j-SPE, volume = "15", number = "12", pages = "1185--1204", month = dec, year = "1985", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "algorithms; languages; theory", review = "ACM CR 8607-0605", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Interpreters \\ F.4.1 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming \\ F.3.2 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages \\ F.4.2 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ D.3.1 Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory", xxauthor = "Christoph M. Hoffman and Michael J. O'Donnell and Robert I. Strandh", } @Article{Jantzen:1985:ERE, author = "M. Jantzen", title = "Extending regular expressions with iterated shuffle", journal = j-THEOR-COMP-SCI, volume = "38", number = "2-3", pages = "223--247", month = jun, year = "1985", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Fachbereich Informat., Hamburg Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "algebraic language theory; finite expression; iterated shuffle; Kleene star; multicounter machine; NSPACE; product; programming theory; regular expressions extending; union", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Ju:1985:CSF, author = "M. S. Ju and J. M. Mansour", title = "Comparative Studies of Formulating the Dynamics of Rigid-Body Systems Using {Macsyma} --- a Case Study", journal = "Developments in Mechanics", volume = "13", pages = "185--186", year = "1985", CODEN = "DEMEAX", ISSN = "0419-0262", bibdate = "Wed Jan 15 15:35:13 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/macsyma.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Case Western Reserve Univ, Cleveland, OH, USA", classification = "461; 601; 921; 931", conference = "Proceedings of the 19th Midwestern Mechanics Conference.", journalabr = "Developments in Mechanics", keywords = "biomechanics; computational efficiency; equations of motion; mathematical techniques; mechanisms; pattern matching algorithm; rigid-body systems", meetingaddress = "Columbus, OH, USA", sponsor = "Ohio State Univ, Dep of Engineering Mechanics, Columbus, OH, USA", } @Article{Kapur:1985:ATC, author = "D. Kapur and M. S. Krishnamoorthy and R. McNaughton and Narendran and P.", title = "An {$ O(\bmod {T} \bmod^3) $} algorithm for testing the {Church--Rosser} property of {Thue} systems", journal = j-THEOR-COMP-SCI, volume = "35", number = "1", pages = "109--114", month = jan, year = "1985", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "General Electric Co., Res. and Dev. Center, Schenectady, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "Church--Rosser property; computational complexity; linear string-matching algorithm; reduction algorithm; Thue systems; trees (mathematics)", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", xxnote = "Check math in title??", } @Article{Kristensen:1985:APF, author = "Bent Bruun Kristensen and Ole Lehrmann Madsen and Birger M{\o}ller-Pedersen and Kristen Nygaard", title = "An algebra for program fragments", journal = j-SIGPLAN, volume = "20", number = "7", pages = "161--170", month = jul, year = "1985", CODEN = "SINODQ", ISBN = "0-89791-165-2", ISBN-13 = "978-0-89791-165-8", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:50 MST 2003", bibsource = "Compendex database; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Program fragments are described either by strings in the concrete syntax or by constructor applications in the abstract syntax. By defining conversions between these forms, both may be intermixed. Program fragments are constructed by terminal and nonterminal symbols from the grammar and by variables having program fragments as values. Basic operations such as value transfer, composition and decomposition are defined for program fragments allowing more complicated operations to be implemented. Usual operations such as testing for equality are defined, and in addition more specialized operations such as testing that a program fragment is derivable from another and converting program fragments in concrete form to abstract form are defined. By introducing regular expressions in the grammar these may be used in program fragments in concrete form. By defining constructors for regular expressions these may also be used in program fragments in abstract form.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Santa Barbara, CA, USA", classification = "721; C4210 (Formal logic); C6115 (Programming support)", conference = "Proceedings of the ACM SIGPLAN 85 Symposium on Language Issues in Programming Environments.", conflocation = "Seattle, WA, USA; 25-28 June 1985", conftitle = "Proceedings of the ACM SIGPLAN 85 Symposium on Language Issues in Programming Environments", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Notices (ACM Special Interest Group on Programming Languages)", keywords = "abstract syntax; automata theory; composition; computer metatheory --- Programming Theory; computer programming; concrete syntax; constructor applications; decomposition; grammar; Grammars; grammars; languages; program fragments; programming environments; regular expression; regular expressions; strings; theory; value transfer", meetingaddress = "Seattle, WA, USA", pubcountry = "USA A17", sponsor = "ACM, Special Interest Group on Programming Languages, New York, NY, USA; ACM, Special Interest Group on Software Engineering, New York, NY, USA", sponsororg = "ACM", subject = "D.2.3 Software, SOFTWARE ENGINEERING, Coding, Program editors \\ D.2 Software, SOFTWARE ENGINEERING, Miscellaneous \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs \\ D.2.6 Software, SOFTWARE ENGINEERING, Programming Environments", treatment = "T Theoretical or Mathematical", } @Article{Leiss:1985:CTU, author = "E. Leiss", title = "On classes of tractable unrestricted regular expressions", journal = j-THEOR-COMP-SCI, volume = "35", number = "2-3", pages = "313--327", month = feb, year = "1985", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Houston Univ., TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "Boolean automata; Boolean functions; closure; computational complexity; context-free languages; equivalence classes; equivalence problem; finite automata; intractable complexity; nontrivial subclasses; reduced automaton; tractable complexity; tractable unrestricted regular expressions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{McIsaac:1985:PMA, author = "Kevin McIsaac", title = "Pattern matching algebraic identities", journal = j-SIGSAM, volume = "19", number = "2", pages = "4--13", month = may, year = "1985", CODEN = "SIGSBZ", ISSN = "0163-5824 (print), 1557-9492 (electronic)", ISSN-L = "0163-5824", bibdate = "Wed Oct 5 08:31:59 MDT 2005", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigsam.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C4240 (Programming and algorithm theory); C6140 (Programming languages)", corpsource = "Western Australia Univ., Crawley, WA, Australia", fjournal = "SIGSAM Bulletin (ACM Special Interest Group on Symbolic and Algebraic Manipulation)", issue = "74", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J1000", keywords = "algebraic identities; algorithmic languages; algorithms; function; identity; matching process; notational extension; pattern matching; programming theory; scaling behaviour; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ I.5.1 Computing Methodologies, PATTERN RECOGNITION, Models, Deterministic \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Coroutines", treatment = "P Practical", } @Article{McIsaac:85, author = "Kevin McIsaac", title = "Pattern Matching Algebraic Identities", journal = "{SIGSAM} Bulletin", volume = "19", number = "2", pages = "4--13", month = may, year = "1985", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/red-m-z.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Meyer:1985:ISM, author = "Bertrand Meyer", title = "Incremental String Matching", journal = j-INFO-PROC-LETT, volume = "21", number = "5", pages = "219--227", day = "18", month = nov, year = "1985", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of California, Dep of Computer Science, Santa Barbara, CA, USA", classification = "723; 903; C6120 (File organisation); C6130 (Data handling techniques); C7250 (Information storage and retrieval)", corpsource = "Dept. of Comput. Sci., California Univ., Santa Barbara, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "analysis of algorithms; bibliographic search; computer programming --- Algorithms; data handling; data processing --- Word Processing; data structures; finite automaton; incremental diagram construction; incremental string matching; Information Retrieval; information retrieval; information science; program correctness; string matching; transition diagram", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Parigot:1985:LAP, author = "M. Parigot and E. Pelz", title = "A logical approach of {Petri} net languages", journal = j-THEOR-COMP-SCI, volume = "39", number = "2-3", pages = "155--169", month = aug, year = "1985", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C4220 (Automata theory)", corpsource = "UER de Math. et Inf., Paris VII Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "Buchi-like theorem; deadlock languages; directed graphs; finite automata; formal languages; logical approach; logical formulas; Petri net languages; regular expressions", pubcountry = "Netherlands A05", treatment = "T Theoretical or Mathematical", } @Article{Pramanik:1985:HPM, author = "Sakti Pramanik and Chung-Ta King", title = "A Hardware Pattern Matching Algorithm on a Dataflow", journal = j-COMP-J, volume = "28", number = "3", pages = "264--269", month = jul, year = "1985", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/28.3.264", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:18 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/28/3.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Misc/protein.pattern.bib", URL = "http://comjnl.oxfordjournals.org/content/28/3/264.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/264.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/265.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/266.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/267.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/268.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_28/Issue_03/tiff/269.tif", acknowledgement = ack-nhfb, affiliation = "Michigan State Univ, Computer Science Dep, East Lansing, MI, USA", affiliationaddress = "Michigan State Univ, Computer Science Dep, East Lansing, MI, USA", classcodes = "C4250 (Database theory); C6160 (Database management systems (DBMS)); C7250 (Information storage and retrieval)", classification = "722; 723", comment = "``A hardware pattern matcher is presented, which searches for patterns on a data flow, such as characters read from a disk. The backing up on the data flow, for a general pattern matching, is avoided by means of a set of cells running in parallel.''", corpsource = "Dept. of Computer Sci., Michigan State Univ., East Lansing, MI, USA", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "Algorithms; computer programming; data flow; data-flow patterns; database systems; database theory; dataflow; disc storage; hardware; hardware pattern matching algorithm; independent pattern searching; information retrieval system; information retrieval systems; magnetic; marking technique; pattern matching algorithm; priority lines; search", treatment = "T Theoretical or Mathematical", } @Article{Russinoff:1985:EBM, author = "David M. Russinoff", title = "An experiment with the {Boyer--Moore} theorem prover: A proof of {Wilson}'s theorem", journal = j-J-AUTOM-REASON, volume = "1", number = "2", pages = "121--139", month = jun, year = "1985", CODEN = "JAREEW", DOI = "https://doi.org/10.1007/BF00244993", ISSN = "0168-7433 (print), 1573-0670 (electronic)", ISSN-L = "0168-7433", bibdate = "Sat Apr 2 10:48:29 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jautomreason.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://link.springer.com/article/10.1007/BF00244993", acknowledgement = ack-nhfb, ajournal = "J. Autom. Reason.", fjournal = "Journal of Automated Reasoning", journal-URL = "http://link.springer.com/journal/10817", } @Misc{Spencer:1985:REP, author = "Henry Spencer", title = "Regular expression pattern matching software", howpublished = "Usenet \path|mod.sources| and \path|net.sources| archives", month = nov, year = "1985", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Misc{Spencer:regexp, author = "Henry Spencer", title = "Regular expression pattern matching software", howpublished = "Usenet \path|mod.sources| and \path|net.sources| archives", month = nov, year = "1985", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Stearns:1985:ECP, author = "R. E. Stearns and H. B. {Hunt, III}", title = "On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata", journal = j-SIAM-J-COMPUT, volume = "14", number = "3", pages = "598--611", month = "????", year = "1985", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q45 (68Q20)", MRnumber = "87f:68052", MRreviewer = "Peter R. J. Asveld", bibdate = "Mon Nov 29 11:00:24 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/14/3; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Symes:1985:POC, author = "D. Michael Symes", title = "Procedural Operators Considered as Fundamental Programming Devices", journal = j-COMP-LANGS, volume = "10", number = "2", pages = "75--89", month = "????", year = "1985", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Thu Apr 10 09:54:16 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "I. P. Sharp Associates Ltd, Toronto, Ont, Can", classcodes = "C4240 (Programming and algorithm theory)", classification = "723", corpsource = "I. P. Sharp Associates Ltd., Toronto, Ont., Canada", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "Algorithms; backtracking; backtracking primitives; computer programming; computer programming languages; control structure; functional; imperative; matching primitives; nested interaction; nested iteration; operator; pattern-; pattern-matching; procedural operator; programming device; programming theory; recursion; searching", treatment = "P Practical", } @Article{Zaki:1985:PSA, author = "Mohamed Zaki and S. A. Gamal-Eldin", title = "A portable syntax analyzer for microcomputers", journal = j-COMP-LANGS, volume = "10", number = "2", pages = "127--146", month = "????", year = "1985", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Al-Azhar Univ, Dep of Computers \& Systems Engineering, Cairo, Egypt", classcodes = "C4210 (Formal logic); C4220 (Automata theory); C6150C (Compilers, interpreters and other processors)", classification = "722; 723", corpsource = "Dept. of Comput. and Syst. Eng., Al Azhar Univ., Cairo, Egypt", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "code; compatibility; compiler; computer operating systems --- Program Compilers; computers, microprocessor; finite automata; finite state automata; generation phase; grammars; high-level; inherited attributes; interfacing; L-attributed grammar; l-attributed grammar; language analysis; lexical analysis; LL(1) parsing; machine independent analyzer; microcomputer applications; microcomputers; modular design; modules; parser; portability; portable syntax analyzer; program compilers; regular expressions; scanner; software portability; storage minimization; symbol table; syntactic structures; syntax analysis; synthesized attributes; system maintainability; system reliability; table-based; tokens", treatment = "P Practical", } @Article{Ackenhusen:1986:SBG, author = "John G. Ackenhusen and Syed S. Ali and David Bishop and Louis F. Rosa and Reed Thorkildsen", title = "Single-board general-purpose speech recognition system", journal = j-ATT-TECH-J, volume = "65", number = "5", pages = "48--59", month = sep, year = "1986", CODEN = "ATJOEM", ISSN = "2376-676X (print), 8756-2324 (electronic)", ISSN-L = "8756-2324", bibdate = "Fri Nov 12 13:09:16 2010", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/bstj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "This paper describes a single-board implementation of an isolated word recognizer based on the principles of linear predictive coding (LPC) and dynamic time warping (DTW). The recognizer requires only a serial (RS-232) terminal, power supply, and microphone for operation, and may be used to add speech input capability to any serial terminal connected to a host computer. Key elements of the recognizer include a custom integrated circuit for DTW-based pattern matching, a single-chip implementation of real-time LPC feature measurement, and a 16-bit microprocessor for control, communication, and decision functions. As a result of the custom integrated circuit and multiple processor architecture, pattern matching speed is increased by a factor of 50 over an earlier design with no custom integrated circuits and without pipeline processing capabilities, and proceeds on one word while LPC measurement on the next is in progress, increasing speech throughput.", acknowledgement = ack-nhfb, fjournal = "AT\&T Technical Journal", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1538-7305/issues/", keywords = "computers, microcomputer", subject = "dynamic time warping (DTW); isolated word recognizer; linear predictive coding (LPC); multiple processor architecture; system architecture", topic = "speech", } @Article{Apostolico:1986:BMG, author = "Alberto Apostolico and Raffaele Giancarlo", title = "The {Boyer--Moore--Galil} string searching strategies revisited", journal = j-SIAM-J-COMPUT, volume = "15", number = "1", pages = "98--105", month = "????", year = "1986", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q20", MRnumber = "87b:68045", bibdate = "Mon Nov 29 11:00:32 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/15/1; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Book{Bentley:1986:PP, author = "Jon Louis Bentley", title = "Programming Pearls", publisher = pub-AW, address = pub-AW:adr, pages = "viii + 195", year = "1986", ISBN = "0-201-10331-1 (paperback)", ISBN-13 = "978-0-201-10331-1 (paperback)", LCCN = "QA76.6.B453 1986", bibdate = "Wed Dec 15 08:16:02 1993", bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/bibnet/subjects/han-wri-mat-sci-2ed.bib; https://www.math.utah.edu/pub/tex/bib/css.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", note = "Reprinted with corrections.", acknowledgement = ack-nhfb, remark = "Chapter 13, A Spelling Checker, discusses the design and implementation of Unix spell, and notes that ``Steve Johnson wrote the first version of {\tt spell} in an afternoon in 1975.''.", shorttableofcontents = "1: Cracking the oyster \\ 2: Aha! algorithms \\ 3: Data structures programs \\ 4: Writing correct programs \\ 5: Perspective on performance \\ 6: Back of the envelope \\ 7: Algorithm design techniques \\ 8: Code tuning \\ 9: Squeezing space \\ 10: Sorting \\ 11: Searching \\ 12: Heaps \\ 13: Spelling checker", tableofcontents = "Part I: Preliminaries / 1 \\ Column 1: Cracking the Oyster / 3 \\ A Friendly Conversation \\ Precise Problem Statement \\ Program Design \\ Implementation Sketch \\ Principles \\ Problems \\ Further Reading \\ Column 2: Aha! Algorithms / 11 \\ Three Problems \\ Ubiquitous Binary Search \\ The Power of Primitives \\ Getting It Together: Sorting \\ Principles \\ Problems \\ Further Reading \\ Implementing an Anagram Program \\ Column 3: Data Structures Programs / 23 \\ A Survey Program \\ Form Letters \\ An Array of Examples \\ A Big Program \\ Principles \\ Problems \\ Further Reading \\ Column 4: Writing Correct Programs / 35 \\ The Challenge of Binary Search \\ Writing the Program \\ Understanding the Program \\ Implementing the Program \\ Principles \\ The Roles of Program Verification \\ Problems \\ Further Reading \\ Industrial-Strength Program Verification \\ Part II: Performance / 49 \\ Column 5: Perspective on Performance / 51 \\ A Case Study \\ Design Levels \\ Principles \\ Problems \\ Further Reading \\ Column 6: The Back of the Envelope / 59 \\ Basic Skills \\ Quick Calculations in Computing \\ Safety Factors \\ A Case Study \\ Principles \\ Problems \\ Further Reading \\ Quick Calculations in Everyday Life \\ Column 7: Algorithm Design Techniques / 69 \\ The Problem and a Simple Algorithm \\ Two Quadratic Algorithms \\ A Divide-and-Conquer Algorithm \\ A Scanning Algorithm \\ What Does It Matter? \\ Principles \\ Problems \\ Further Reading \\ The Impact of Algorithms \\ Column 8: Code Tuning / 81 \\ A Typical Story \\ A First Aid Quiz \\ Major Surgery --- Binary Search \\ Principles \\ Problems \\ Further Reading \\ Tuning the Federal Government's COBOL Code \\ Column 9: Squeezing Space / 93 \\ The Key --- Simplicity \\ Data Space \\ Code Space \\ Principles \\ Problems \\ Further Reading \\ Two Big Squeezes \\ Part III: The Product / 105 \\ Column 10: Sorting / 107 \\ Insertion Sort --- An $O(N^2)$ Algorithm \\ Quicksort --- An $O(N \log N)$ Algorithm \\ Principles \\ Problems \\ Further Reading \\ Column 11: Searching / 117 \\ The Problem \\ One Solution \\ The Design Space \\ Principles \\ Problems \\ Further Reading \\ Column 12: Heaps / 125 \\ The Data Structure \\ Two Critical Routines \\ Priority Queues \\ A Sorting Algorithm \\ Principles \\ Problems \\ Further Reading \\ Column 13: A Spelling Checker / 139 \\ A Simple Program \\ The Design Space \\ A Subtle Program \\ Principles \\ Problems \\ Further Reading \\ Why Spelling is Hard \\ Epilog / 151 \\ Appendix: Catalog of Algorithms / 155 \\ Hints for Selected Problems / 159 \\ Solutions to Selected Problems / 163 \\ Index / 189", } @Article{Berry:1986:RED, author = "G. Berry and R. Sethi", title = "From regular expressions to deterministic automata", journal = j-THEOR-COMP-SCI, volume = "48", number = "1", pages = "117--126", month = "????", year = "1986", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", corpsource = "Ecole Nat. Sup{\'e}rieure des Mines de Paris, Centre de Math. Appliqu{\'e}es, Valbonne, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "deterministic automata; elegant algorithm; finite automata; finite automaton; regular expressions; state transitions", pubcountry = "Netherlands A09", treatment = "T Theoretical or Mathematical", } @Article{Brazma:1986:GRE, author = "A. Brazma and E. Kinber", title = "Generalized regular expressions --- a language for synthesis of programs with branching in loops", journal = j-THEOR-COMP-SCI, volume = "46", number = "2-3", pages = "175--195", month = "????", year = "1986", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory); C6150G (Diagnostic, testing, debugging and evaluating systems)", corpsource = "Comput. Centre, Latvian State Univ., Riga, Latvian SSR, USSR", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "automata; automata theory; branching; equivalence problem; finite alphabet; formal languages; generalised regular expressions; inductive synthesis; loops; natural numbers; program testing; programs synthesis language; set-theoretic properties", pubcountry = "Netherlands A04", treatment = "T Theoretical or Mathematical", } @Article{Cisneros:1986:IPL, author = "G. Cisneros and H. V. McIntosh", title = "Introduction to the programming language {Convert}", journal = j-SIGPLAN, volume = "21", number = "4", pages = "48--57", month = apr, year = "1986", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:14:57 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6140D (High level languages)", corpsource = "Escuela Superior de Ingenieria Mecanica y Electr., Inst. Politecnico Nacional, Mexico City, Mexico", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "algorithms; high level languages; languages; programming language Convert; symbol manipulation; transformation rules", pubcountry = "USA A03 A03", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "G General Review; P Practical", } @InProceedings{Cooperman:1986:SMC, author = "Gene Cooperman", title = "A semantic matcher for computer algebra", crossref = "Char:1986:PSS", pages = "132--134", year = "1986", bibdate = "Thu Mar 12 07:38:29 MST 1998", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/issac.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/32439/p132-cooperman/", acknowledgement = ack-nhfb, keywords = "experimentation; human factors; languages", subject = "{\bf I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and Systems, Special-purpose algebraic systems. {\bf F.4.1} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic. {\bf I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and Systems, Evaluation strategies. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.1.1} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Expressions and Their Representation, Representations (general and polynomial). {\bf I.1.3} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, Languages and Systems, MACSYMA.", } @Article{Crochemore:1986:TR, author = "M. Crochemore", title = "Transducers and repetitions", journal = j-THEOR-COMP-SCI, volume = "45", number = "1", pages = "63--86", month = "????", year = "1986", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Centre Sci. et Polytech., Univ. de Paris-Nord, Villetaneuse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "automata theory; factor transducer; factors; optimal bounds; programming theory; repetition searching; string-matching problem; subsequent suffix transducers; subwords; word", pubcountry = "Netherlands A02", treatment = "T Theoretical or Mathematical", } @Article{Davies:1986:APM, author = "G. Davies and S. Bowsher", title = "Algorithms for Pattern Matching", journal = j-SPE, volume = "16", number = "6", pages = "575--601", month = jun, year = "1986", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Galil:1986:ISM, author = "Z. Galil and R. Giancarlo", title = "Improved string matching with {$k$} mismatches", journal = j-SIGACT, volume = "17", number = "4", pages = "52--54", month = "Spring", year = "1986", CODEN = "SIGNDM", DOI = "https://doi.org/10.1145/8307.8309", ISSN = "0163-5700 (print), 1943-5827 (electronic)", ISSN-L = "0163-5700", bibdate = "Wed Mar 21 08:21:23 MDT 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Misc/att.bib; https://www.math.utah.edu/pub/mirrors/ftp.ira.uka.de/bibliography/Theory/tq.bib; https://www.math.utah.edu/pub/tex/bib/sigact.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGACT News", journal-URL = "http://dl.acm.org/citation.cfm?id=J697", } @Article{Grigoriadis:1986:LBC, author = "M. D. Grigoriadis and B. Kalantari", title = "A Lower Bound to the Complexity of {Euclidean} and Rectilinear Matching Algorithms", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "73--76", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68P10)", MRnumber = "87d:68040", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rutgers Univ, New Brunswick, NJ, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Rutgers Univ., New Brunswick, NJ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; complexity; computational complexity; computer programming; Euclidean matching; Euclidean matching algorithms; graph theory; graphs; heuristic algorithm; lower bound; lower bounds; mathematical techniques --- Graph Theory; performance; rectilinear matching; rectilinear matching algorithms; spanning trees; time complexity; undirected graphs; verification", pubcountry = "Netherlands A04", review = "ACM CR 8611-1025", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ I.2.8 Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Heuristic methods", treatment = "T Theoretical or Mathematical", } @Article{Grosky:1986:IIU, author = "William I. Grosky and Yi Lu", title = "Iconic Indexing Using Generalized Pattern Matching Techniques", journal = j-CVGIP, volume = "35", number = "3", pages = "383--403", month = sep, year = "1986", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Thu Feb 6 18:44:11 MST 1997", bibsource = "Compendex database; Graphics/rosenfeld/1986.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "WSU/U Mich", affiliationaddress = "Wayne State Univ, Detroit, MI, USA", classification = "723", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "computer programming --- Algorithms; database systems; image multiplicity comparison; image processing; ionic indexing; longest common sequency; pattern matching", } @Article{Highnam:1986:OAF, author = "P. T. Highnam", title = "Optimal Algorithms for Finding the Symmetries of a Planar Point Set", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "219--222", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05", MRnumber = "87h:68144", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA", classification = "723; C4190 (Other numerical methods)", corpsource = "Dept. of Comput. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; asymptotically optimal algorithm; computational geometry; computer programming; linear pattern-matching; mirror symmetry; optimal algorithms; planar point set; rotational symmetries; string matching; symmetry; theory; verification", pubcountry = "Netherlands A01", subject = "G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Geometrical problems and computations", treatment = "T Theoretical or Mathematical", } @Article{Israeli:1986:FSR, author = "Amos Israeli and A. Itai", title = "A fast and simple randomized parallel algorithm for maximal matching", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "77--80", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "87d:68041", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; CRCW-PRAM; graph theory; graphs; input graph; mathematical techniques --- Graph Theory; maximal matching; parallel algorithm; parallel processing; parallel randomized algorithm; randomized parallel algorithm; undirected graphs; verification", pubcountry = "Netherlands A05", subject = "G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Israeli:1986:IPA, author = "Amos Israeli and Y. Shiloach", title = "An Improved Parallel Algorithm for Maximal Matching", journal = j-INFO-PROC-LETT, volume = "22", number = "2", pages = "57--60", day = "18", month = jan, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (68R10)", MRnumber = "87g:68023", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Technion-Israel Inst of Technology, Haifa, Isr", classification = "722; 723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computational complexity; computer programming; computer systems, digital --- Parallel Processing; CRCW-PRAM; graph matching; graph theory; graphs; mathematical techniques --- Graph Theory; maximal matching; parallel algorithm; performance; undirected graphs; verification", pubcountry = "Netherlands A02", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Graph algorithms \\ G.1.0 Mathematics of Computing, NUMERICAL ANALYSIS, General, Parallel algorithms \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Landau:1986:ESM, author = "G. M. Landau and U. Vishkin", title = "Efficient string matching with k mismatches", journal = j-THEOR-COMP-SCI, volume = "43", number = "2-3", pages = "239--249", month = "????", year = "1986", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tel Aviv Univ., Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "computational complexity; pattern matching; pattern recognition; string matching", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @InProceedings{Landau:1986:IEP, author = "G. M. Landau and U. Vishkin", title = "Introducing efficient parallelism into approximate string matching and a new serial algorithm", crossref = "ACM:1986:PEA", pages = "220--230", year = "1986", bibdate = "Wed Feb 20 18:33:46 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/12130/p220-landau/p220-landau.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/12130/p220-landau/", acknowledgement = ack-nhfb, } @Article{Li:1986:SMC, author = "Ming Li and Yaacov Yesha", editor = "G. R. Andrews", title = "String-Matching Cannot Be Done by a Two-Head One-Way Deterministic Finite Automaton", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "231--235", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20", MRnumber = "87h:68058", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", series = "22", acknowledgement = ack-nhfb, affiliationaddress = "Cornell Univ, Ithaca, NY, USA", classification = "721; C4220 (Automata theory)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; finite automata; k-head finite automata; Kolmogorov complexity; lower bounds; string-matching; theory; Turning machine; two-head one-way deterministic finite automaton; verification", pubcountry = "Netherlands A03", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "T Theoretical or Mathematical", } @Article{Liu:1986:SPM, author = "Ken-Chih Liu", title = "A String Pattern Matching Extension to {Pascal} and Some Comparisons with {SNOBOL4}", journal = j-SPE, volume = "16", number = "6", pages = "541--548", month = jun, year = "1986", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Manolopoulos:1986:BSI, author = "Yannis Manolopoulos", title = "Batched Search of Index Sequential Files", journal = j-INFO-PROC-LETT, volume = "22", number = "5", pages = "267--272", day = "??", month = apr, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Thessaloniki, Thessaloniki, Greece", classification = "723; 903; C6160 (Database management systems (DBMS))", corpsource = "Dept. of Electr. Eng., Thessaloniki Univ., Greece", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "batched search; database management systems; database systems; index sequential files; information retrieval systems --- Online Searching; on-line search; Performance; performance; query; theory; verification", pubcountry = "Netherlands A09", subject = "H.2.m Information Systems, DATABASE MANAGEMENT, Miscellaneous \\ H.3.3 Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "P Practical", } @Article{Suzuki:1986:SVD, author = "I. Suzuki and Y. Motohashi and K. Taniguchi and T. Kasami and T. Okamoto", title = "Specification and verification of decentralized daisy chain arbiters with omega-extended regular expressions", journal = j-THEOR-COMP-SCI, volume = "43", number = "2-3", pages = "277--291", month = "????", year = "1986", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4230 (Switching theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Electr. Eng., Texas Tech Univ., Lubbock, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "computer interfaces; concurrent processes; containment problem; decentralized daisy chain arbiters; distributed processing; eventuality; finite event sequences; formal logic; infinite event sequences; liveness; logical circuits; omega-extended regular expressions; programming theory; property proving; property specification; property verification; switching networks; temporal logic", pubcountry = "Netherlands A10", treatment = "T Theoretical or Mathematical", } @Article{Takahashi:1986:NSS, author = "K. Takahashi and H. Yamada and H. Nagai and K. Matsumi", title = "A new string search hardware architecture for {VLSI}", journal = j-COMP-ARCH-NEWS, volume = "14", number = "2", pages = "20--27", month = jun, year = "1986", CODEN = "CANED2", ISSN = "0163-5964 (ACM), 0884-7495 (IEEE)", bibdate = "Fri May 12 09:40:43 MDT 2006", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigarch.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGARCH Computer Architecture News", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J89", } @Article{Takaoka:1986:LPM, author = "Tadao Takaoka", title = "An On-Line Pattern Matching Algorithm", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "329--330", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Ibaraki, Hitachi, Jpn", classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Inf. Sci., Ibaraki Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; data handling; on-line editor; on-line pattern matching algorithm; pattern input; pattern matching algorithm; reading input symbols; response time; text editor; text editors; theory", pubcountry = "Netherlands A11", subject = "I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing \\ I.5.4 Computing Methodologies, PATTERN RECOGNITION, Applications, Computer vision", treatment = "G General Review", } @Article{Takaoka:1986:OPM, author = "Tadao Takaoka", title = "An On-Line Pattern Matching Algorithm", journal = j-INFO-PROC-LETT, volume = "22", number = "6", pages = "329--330", day = "30", month = may, year = "1986", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Ibaraki, Hitachi, Jpn", classification = "723; C6130 (Data handling techniques)", corpsource = "Dept. of Inf. Sci., Ibaraki Univ., Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; computer programming; data handling; on-line editor; on-line pattern matching algorithm; pattern input; pattern matching algorithm; reading input symbols; response time; text editor; text editors; theory", pubcountry = "Netherlands A11", subject = "I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing \\ I.5.4 Computing Methodologies, PATTERN RECOGNITION, Applications, Computer vision", treatment = "G General Review", } @Article{Turner:1986:OM, author = "D. Turner", title = "An overview of {Miranda}", journal = j-SIGPLAN, volume = "21", number = "12", pages = "158--166", month = dec, year = "1986", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:06 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", acknowledgement = ack-nhfb, classification = "C6115 (Programming support); C6120 (File organisation); C6140D (High level languages)", corpsource = "Comput. Lab., Kent Univ., Canterbury, UK", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "abstract data types; advanced functional programming system; block structure; currying; data structures; guarded equations; high level languages; higher order functions; infinite lists; languages; lazy evaluation; linking; Miranda; Miranda programming environment; pattern matching; polymorphic strong typing; programming environments; separate compilation; type synonyms; UNIX operating system; user defined types; ZF expressions", pubcountry = "USA A11", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications \\ D.4.0 Software, OPERATING SYSTEMS, General, UNIX", treatment = "P Practical; R Product Review", } @InProceedings{Wolberg:1986:SOF, author = "George Wolberg", title = "A Syntactic Omni-Font Character Recognition System", crossref = "IEEE:1986:PCI", publisher = pub-IEEE, address = pub-IEEE:adr, pages = "168--173", year = "1986", ISBN = "0-8186-0721-1", ISBN-13 = "978-0-8186-0721-9", LCCN = "TA1632 .I36 1986", bibdate = "Mon May 11 18:31:33 1998", bibsource = "Compendex database; Graphics/rosenfeld/1986.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib", note = "IEEE Service Cent. Piscataway, NJ, USA.", abstract = "The author introduces a syntactic omni-font character recognition system that recognizes a wide range of fonts, including handprinted characters. A structural pattern-matching approach is used. Essentially, a set of loosely constrained rules specify pattern components and their interrelationships. The robustness of the system is derived from the orthogonal set of pattern descriptors, location functions, and the manner in which they are combined to exploit the topological structure of characters. By virtue of the new pattern description language, PDL, the user may easily write rules to define new patterns for the system to recognize. The system also features scale-invariance and user-definable sensitivity to tilt orientation. The system has achieved a 95. 2\% recognition rate.", acknowledgement = ack-nhfb, affiliation = "Columbia Univ, New York, NY, USA", affiliationaddress = "Columbia Univ, New York, NY, USA", classification = "723", conference = "Proceedings --- CVPR '86: IEEE Computer Society Conference on Computer Vision and Pattern Recognition.", keywords = "character recognition; computer programming languages; image; pattern description language (PDL); robustness; structural pattern matching; symbol; syntactic omnifont character recognition", meetingaddress = "Miami Beach, FL, USA", sponsor = "IEEE Computer Soc, Los Alamitos, CA, USA", } @Misc{Woods:1986:MPB, author = "J. A. Woods", title = "More pep for {Boyer--Moore} {\tt grep}", howpublished = "Usenet netnews group {\tt net.unix}", day = "18", month = mar, year = "1986", bibdate = "Sat Sep 02 14:34:18 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, remark = "See also \cite{Woods:1986:MPB}.", } @Article{Abrahamson:1987:GSM, author = "Karl Abrahamson", title = "Generalized String Matching", journal = j-SIAM-J-COMPUT, volume = "16", number = "6", pages = "1039--1051", month = dec, year = "1987", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q25", MRnumber = "90a:68034", MRreviewer = "Jaroslav Ne{\v{s}}et{\v{r}}il", bibdate = "Mon Nov 29 11:00:58 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/16/6; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Blumer:1987:CIF, author = "A. Blumer and J. Blumer and D. Haussler and R. McConnell and A. Ehrenfeucht", title = "Complete Inverted Files for Efficient Text Retrieval and Analysis", journal = j-J-ACM, volume = "34", number = "3", pages = "578--595", month = jul, year = "1987", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/28873.html", abstract = "Given a finite set of texts {$S$} equals $ \{ w_1, \ldots {}, w_k \} $ over some fixed finite alphabet {$ \Sigma $}, a complete inverted file for {$S$} is an abstract data type that provides the functions {\tt find}($w$ ), which returns the longest prefix of $w$ that occurs (as a subword of a word) in {$S$}; {\tt freq}($w$ ), which returns the number of times $w$ occurs in {$S$}; and {\tt locations}($w$ ), which returns the set of positions where $w$ occurs in {$S$}. A data structure that implements a complete inverted file for {$S$} that occupies linear space and can be built in linear time, using the uniform-cost RAM model, is given. Using this data structure, the time for each of the above query functions is optimal. To accomplish this, techniques from the theory of finite automata and the work on suffix trees are used to build a deterministic finite automation that recognizes the set of all subwords of the set {$S$}. This automation is then annotated with additional information and compacted to facilitate the desired query functions. The result is a data structure that is smaller and more flexible than the suffix tree.", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Denver, Denver, CO, USA", annote = "Data structure is a compact directed acyclic word graph. Searches for arbitrary strings are allowed. Suggest searching DNA sequences. Linear times for finding the longest prefix of a keyword.", classification = "721; 723; 903", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "algorithms; automata theory --- Finite Automata; complete inverted files; data processing; Data Structures; information science --- Information Retrieval; mathematical techniques --- Trees; suffix trees; text retrieval and analysis; theory", subject = "{\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf H.3.1}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Content Analysis and Indexing, Indexing methods.", } @Article{Bowman:1987:PMU, author = "Charles F. Bowman", title = "Pattern Matching Using Finite State Machines", journal = j-DDJ, volume = "12", number = "10", pages = "46--??", month = oct, year = "1987", CODEN = "DDJOEB", ISSN = "0888-3076", bibdate = "Thu Jan 9 09:35:43 MST 1997", bibsource = "Compendex database; http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "721; 723", fjournal = "Dr. Dobb's Journal of Software Tools", journalabr = "Dr Dobb's J Software Tools", keywords = "automata theory --- Finite Automata; command finding code; computer programs; computer software --- Portability; finite state machines; pattern matching; pattern recognition; source code", pagecount = "14p between p 46 and 108", } @Article{Carpenter:1987:MPA, author = "Gail A. Carpenter and Stephen Grossberg", title = "A Massively Parallel Architecture for a Self-Organizing Neural Pattern Recognition Machine", journal = j-CVGIP, volume = "37", number = "1", pages = "54--115", month = jan, year = "1987", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Fri Feb 7 17:18:02 1997", bibsource = "Ai/adapt.sys.bib; Ai/Speech.bib; Compendex database; Graphics/rosenfeld/1987.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Math/kbmath.bib; Misc/misc.1.bib; Neural/hildebrandt.bib; Neural/Intro.theory.neural.bib; Neural/neural.1.bib; Neural/neural.5.bib", note = "CARPENTER87", abstract = "A neural network architecture for the learning of recognition categories is derived. Real-time network dynamics are completely characterized through mathematical analysis and computer simulations. The architecture self-organizes and self-stabilizes its recognition codes in response to arbitrary orderings of arbitrarily many and arbitrarily complex binary input patterns. Top-down attentional and matching mechanisms are critical in self-stabilizing the code learning process. The architecture embodies a parallel search scheme which updates itself adaptively as the learning process unfolds. After learning self-stabilizes, the search process is automatically disengaged. Thereafter input patterns directly access their recognition codes without any search. Thus recognition time does not grow as a function of code complexity. A novel input pattern can directly access a category if it shares invariant properties with the set of familiar exemplars of that category. These invariant properties emerge in the form of learned critical feature patterns, or prototypes. The architecture possesses a context-sensitive self-scaling property which enables its emergent critical feature patterns to form. They detect and remember statistically predictive configurations of featural elements which are derived from the set of all input patterns that are ever experienced. Four types of attentional process --- priming, gain control, vigilance, and intermodal competition --- are mechanistically characterized. Top-down priming and gain control are needed for code matching and self-stabilization. Attentional vigilance determines how fine the learned categories will be. If vigilance increases due to an environmental disconfirmation, then the system automatically searches for and learns finer recognition categories. A new nonlinear matching law (the $ \frac {2}{3} $ Rule) and new nonlinear associative laws (the Weber Law Rule, the Associative Decay Rule, and the Template Learning Rule) are needed to achieve these properties. All the rules describe emergent properties of parallel network interactions. The architecture circumvents the noise, saturation, capacity, orthogonality, and linear predictability constraints that limit the codes which can be stably learned by alternative recognition models.", acknowledgement = ack-nhfb, affiliation = "NEU/Boston U", affiliationaddress = "Northeastern Univ, Boston, MA, USA", annote = "A monograph describing the function and implementation of the ART model along with the equations governing its dynamics and several theorems concerning the nature of the patterns learned, and the stability of the learning model. The model consists of two layers of cells with an asymmetric network of weighted interconnections. The first layer of cells implements matching between the input signal and stored patterns. The second layer implements competition among the possible encodings for the input. It also implements a search mechanism, whereby an insufficient match with the template recalled by the initial winner of the competition causes that code to be disabled for the rest of the trial. The closeness of the required match is determined by the vigilance parameter, which is coded as a proportion of the magnitude of the input. The authors suggest that the vigilance parameter may be increased automatically in response to negative environmental feedback, but this process lies outside the scope of the model being described. The model is capable of learning stable ``critical feature'' patterns, which consist of the intersection of the (binary) feature patterns assigned to a class. The number of classes created for a given set of training patterns is controlled by the vigilance parameter (a larger vigilance parameter causes more classes to be created).", classification = "723; 921", conference = "Third Workshop on Hum and Mach Vision", equations = "168", figures = "14", fjournal = "Computer Vision, Graphics, and Image Processing", index = "ART", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "(image multiplicity comparison); computer simulation; interacting memory systems; massively parallel architecture; mathematical techniques --- Differential Equations; pattern recognition; perception; recognition codes; self-organizing neural pattern recognition machine", meetingaddress = "Boston, MA, USA", meetingdate = "Nov 19--21 1985", meetingdate2 = "11/19--21/85", ref = "J18", refs = "40", } @InProceedings{Chase:1987:IBT, author = "D. R. Chase", title = "An improvement to bottom-up tree pattern matching", crossref = "ACM:1987:PFA", pages = "168--177", year = "1987", bibdate = "Mon May 3 12:39:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/41625/p168-chase/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf E.1} Data, DATA STRUCTURES, Trees. {\bf E.4} Data, CODING AND INFORMATION THEORY. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", } @Article{Chrobak:1987:RSM, author = "Marek Chrobak and Wojciech Rytter", title = "Remarks on string-matching and one-way multihead automata", journal = j-INFO-PROC-LETT, volume = "24", number = "5", pages = "325--329", day = "16", month = mar, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q20 (68Q05 68Q25)", MRnumber = "88f:68043", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Warsaw Univ, Warsaw, Pol", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Inf., Warsaw Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; complexity; computational complexity; computer metatheory; multihead automata; one-way multihead automata; string-matching; theory; verification", pubcountry = "Netherlands A09", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Coulson:1987:PNA, author = "A. F. W. Coulson and J. F. Collins and A. Lyall", title = "Protein and Nucleic Acid Sequence Database Searching: a Suitable Case for Parallel Processing", journal = j-COMP-J, volume = "30", number = "5", pages = "420--424", month = oct, year = "1987", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/30.5.420", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:23 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/30/5.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/30/5/420.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/420.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/421.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/422.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/423.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_30/Issue_05/tiff/424.tif", acknowledgement = ack-nhfb, affiliation = "Univ of Edinburgh, Edinburgh, Scotl", affiliationaddress = "Univ of Edinburgh, Edinburgh, Scotl", classcodes = "A3620E (Constitution (chains and sequences)); A8715B (Structure, configuration, conformation, and active sites at the biomolecular level); C7250L (Non-bibliographic systems); C7320 (Physics and Chemistry); C7330 (Biology and medicine)", classification = "461; 722; 723; 815", corpsource = "Dept. of Molecular Biol., Edinburgh Univ., UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "biology computing; biopolymers --- Database Systems; computer programming --- Algorithms; computer systems, digital; configurations; cystic fibrosis antigen; cystic fibrosis associated antigen; DAP; database systems --- Medical Applications; distributed array processor (DAP) implementation; Drosophila vitellogenins; information retrieval; macromolecular; macromolecules; molecular biophysics; nucleic acid databases; Parallel Processing; parallel processing; pattern direction and searching; physics computing; processor-array machines; protein and nucleic acid sequence database searching; protein databases; protein sequence data; proteins; searching; sequence database; string-matching algorithms", treatment = "P Practical", } @InProceedings{Cruz:1987:GQL, author = "Isabel F. Cruz and Alberto O. Mendelzon and Peter T. Wood", title = "A graphical query language supporting recursion", crossref = "Dayal:1987:PAC", pages = "323--330", year = "1987", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; https://www.math.utah.edu/pub/tex/bib/pods.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/38713/p323-cruz/p323-cruz.pdf; http://www.acm.org/pubs/citations/proceedings/mod/38713/p323-cruz/", abstract = "We define a language G for querying data represented as a labeled graph {\em G}. By considering {$G$} as a relation, this graphical query language can be viewed as a relational query language, and its expressive power can be compared to that of other relational query languages. We do not propose G as an alternative to general purpose relational query languages, but rather as a complementary language in which recursive queries are simple to formulate. The user is aided in this formulation by means of a graphical interface. The provision of regular expressions in G allows recursive queries more general than transitive closure to be posed, although the language is not as powerful as those based on function-free Horn clauses. However, we hope to be able to exploit well-known graph algorithms in evaluating recursive queries efficiently, a topic which has received widespread attention recently.", acknowledgement = ack-nhfb, generalterms = "Languages; Theory", subject = "Information Systems --- Database Management --- Languages (H.2.3); Information Systems --- Database Management --- Logical Design (H.2.1): {\bf Data models}; Mathematics of Computing --- Discrete Mathematics --- Graph Theory (G.2.2): {\bf Path and circuit problems}; Theory of Computation --- Mathematical Logic and Formal Languages --- Mathematical Logic (F.4.1): {\bf Recursive function theory}", } @Article{Galil:1987:PSM, author = "Z. Galil and R. Giancarlo", title = "Parallel string matching with k mismatches", journal = j-THEOR-COMP-SCI, volume = "51", number = "3", pages = "341--348", month = "????", year = "1987", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Columbia Univ., New York, NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "computational complexity; fast integer multiplication algorithms; k mismatches; parallel algorithms; string matching", pubcountry = "Netherlands A08", treatment = "T Theoretical or Mathematical", } @Article{Gueriguian:1987:BRB, author = "John L. Gueriguian", title = "Book Review: {{\booktitle{Bark' Galianosi: The Greek-Armenian Dictionary to Galen}} by John A. C. Greppin}", journal = j-ISIS, volume = "78", number = "2", pages = "300--301", month = jun, year = "1987", CODEN = "ISISA4", ISSN = "0021-1753 (print), 1545-6994 (electronic)", ISSN-L = "0021-1753", bibdate = "Tue Jul 30 21:23:27 MDT 2013", bibsource = "http://www.jstor.org/action/showPublication?journalCode=isis; http://www.jstor.org/stable/i211183; https://www.math.utah.edu/pub/tex/bib/isis1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.jstor.org/stable/231579", acknowledgement = ack-nhfb, fjournal = "Isis", journal-URL = "http://www.jstor.org/journal/isis", } @Article{Held:1987:MNH, author = "James P. Held and John V. Carlis", title = "{MATCH}: a new high-level relational operator for pattern matching", journal = j-CACM, volume = "30", number = "1", pages = "62--75", month = jan, year = "1987", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Apr 06 08:06:22 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Wiederhold.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/7889.html", acknowledgement = ack-nhfb, annote = "MATCH is used to do pattern matching for complex stored patterns. This is a high level language expansion of HAS, which is Carlis' extension of the DIVIDE operator. MATCH requires a change in the data on which it operates, in that it incorporates the operators of relational algebra into the relations.", fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms; design; languages; theory", review = "ACM CR 8707-0595", subject = "{\bf H.2.1}: Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf H.2.3}: Information Systems, DATABASE MANAGEMENT, Languages, MATCH. {\bf I.5.m}: Computing Methodologies, PATTERN RECOGNITION, Miscellaneous. {\bf I.2.5}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Programming Languages and Software. {\bf I.2.1}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Applications and Expert Systems. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval.", } @Article{Jpolhkedrzejowicz:1987:NSC, author = "Joanna J{\polhk{e}}drzejowicz", title = "Nesting of shuffle closure is important", journal = j-INFO-PROC-LETT, volume = "25", number = "6", pages = "363--367", day = "26", month = jul, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45 (68Q90)", MRnumber = "88j:68086", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "721; C4210 (Formal logic)", corpsource = "Inst. of Math., Gdansk Univ., Poland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata theory; extended regular languages; formal languages; languages; shuffle closure; shuffle expressions; shuffle language; shuffle languages; shuffle operator; subexpression properties; theory; verification", pubcountry = "Netherlands A02", subject = "F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Algebraic language theory", treatment = "T Theoretical or Mathematical", } @Article{Karlin:1987:ACR, author = "Anna R. Karlin and Howard W. Trickey and Jeffrey D. Ullman", title = "Algorithms for the Compilation of Regular Expressions into {PLAs}", journal = j-ALGORITHMICA, volume = "2", number = "3", pages = "283--314", year = "1987", CODEN = "ALGOEJ", ISSN = "0178-4617 (print), 1432-0541 (electronic)", ISSN-L = "0178-4617", MRclass = "68Q50 (68Q35)", MRnumber = "MR911953", bibdate = "Mon Jan 22 05:30:30 MST 2001", bibsource = "dblp-journals-algorithmica.bib; http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica2.html#KarlinTU87; https://www.math.utah.edu/pub/tex/bib/algorithmica.bib; https://www.math.utah.edu/pub/tex/bib/index-table-a.html#algorithmica; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; MathSciNet database", fjournal = "Algorithmica. An International Journal in Computer Science", journal-URL = "http://link.springer.com/journal/453", oldlabel = "KarlinTU87", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/algorithmica/KarlinTU87", } @Article{Karp:1987:ERP, author = "Richard M. Karp and Michael O. Rabin", title = "Efficient Randomized Pattern-Matching Algorithms", journal = j-IBM-JRD, volume = "31", number = "2", pages = "249--260", month = mar, year = "1987", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", MRclass = "68Q20", MRnumber = "89g:68021", bibdate = "Mon Feb 12 09:58:53 MST 2001", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", ZMnumber = "653.68054", abstract = "We present randomized algorithms to solve the following string-matching problem and some of its generalizations: Given a string X of length n (the pattern) and a string Y (the text), find the first occurrence of X as a consecutive block within Y. The algorithms represent strings of length n by much shorter strings called fingerprints, and achieve their efficiency by manipulating fingerprints instead of longer strings. The algorithms require a constant number of storage locations, and essentially run in real time. They are conceptually simple and easy to implement. The method readily generalizes to higher-dimensional pattern-matching problems.", acknowledgement = ack-nhfb, affiliation = "Univ of California, Berkeley, CA, USA", affiliationaddress = "Univ of California, Berkeley, CA, USA", classcodes = "C6130D (Document processing techniques)", classification = "723; 921", conference = "Math and Comput", corpsource = "California Univ., Berkeley, CA, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", journalabr = "IBM J Res Dev", keywords = "Algorithms; computer programming; computerised pattern recognition; consecutive block; fingerprint functions; fingerprints; mathematical techniques --- Algorithms; pattern recognition; pattern-matching; problem; randomized pattern-matching algorithms; storage locations; string-matching; word processing", meetingaddress = "Yorktown Heights, NY, USA", meetingdate = "Dec 1985", meetingdate2 = "12/85", treatment = "P Practical", } @Article{Kovaleski:1987:AIS, author = "A. Kovaleski and S. Ratheal and F. Lombardi", title = "An architecture and an interconnection scheme for time-sliced buses", journal = j-J-PAR-DIST-COMP, volume = "4", number = "2", pages = "209--229", month = apr, year = "1987", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", ISSN-L = "0743-7315", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "722; 723; C5220 (Computer architecture); C5470 (Performance evaluation and testing); C7430 (Computer engineering)", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315", journalabr = "J Parallel Distrib Comput", keywords = "architecture; bandwidths; bus network; communication patterns; computer architecture; computer systems, digital; evaluation; image processing; interbus links; interbus links of matching; interconnection scheme; local communications; machine simulation; matching bandwidths; multiprocessor interconnection; networks; Performance; performance; performance evaluation; sliced buses; time-; time-sliced buses; virtual machines", treatment = "P Practical; X Experimental", } @Article{Krishnapuram:1987:HST, author = "Raghuram Krishnapuram and David Casasent", title = "{Hough} Space Transformations for Discrimination and Distortion Estimation", journal = j-CVGIP, volume = "38", number = "3", pages = "299--316", month = jun, year = "1987", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Thu Feb 6 18:44:11 MST 1997", bibsource = "Compendex database; Graphics/rosenfeld/1987.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "CMU", affiliationaddress = "Carnegie-Mellon Univ, Pittsburgh, PA, USA", classification = "723", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "(image transformation, mathematics); aircraft imagery; data processing --- Algorithms; discrimination; distortion estimation; Hough space transformations; image processing; mathematical transformations; pattern recognition --- Applications; template matching", } @Article{Landau:1987:ESM, author = "Gad M. Landau and Uzi Vishkin and Ruth Nussinov", title = "An efficient string matching algorithm with {$K$} substitutions for nucleotide and amino acid sequences", journal = j-J-THEOR-BIOL, volume = "126", number = "4", pages = "483--490", day = "21", month = jun, year = "1987", CODEN = "JTBIAP", DOI = "https://doi.org/10.1016/S0022-5193(87)80153-4", ISSN = "0022-5193 (print), 1095-8541 (electronic)", ISSN-L = "0022-5193", bibdate = "Sat Jun 1 15:22:16 MDT 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jtheorbiol1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/S0022519387801534", acknowledgement = ack-nhfb, fjournal = "Journal of Theoretical Biology", journal-URL = "http://www.sciencedirect.com/science/journal/00225193", } @Article{Peleg:1987:CPS, author = "D. Peleg", title = "Concurrent program schemes and their logics", journal = j-THEOR-COMP-SCI, volume = "55", number = "1", pages = "1--45", month = nov, year = "1987", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C6150J (Operating systems)", corpsource = "Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "axiomatization; Boolean-variable; concurrent program schemes; decidability; formal languages; formal logic; goto schemes; grammars; logics; multiprocessing programs; propositional levels; regular expressions; structured schemes; trees", pubcountry = "Netherlands A01", treatment = "T Theoretical or Mathematical", } @Article{Pike:1987:TES, author = "Rob Pike", title = "The Text Editor {\tt sam}", journal = j-SPE, volume = "17", number = "11", pages = "813--845", month = nov, year = "1987", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380171105", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "30 Oct 2006", } @Article{Robison:1987:IFP, author = "A. D. Robison", title = "The {Illinois} functional programming interpreter", journal = j-SIGPLAN, volume = "22", number = "7", pages = "64--73", month = jul, year = "1987", CODEN = "SINODQ", DOI = "https://doi.org/10.1145/960114.29657", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Wed Jun 18 16:23:52 MDT 2008", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", series = ser-SIGPLAN, URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/29650/p64-robison/", abstract = "The Illinois Functional Programming (IFP) language is a modified version of Backus' FP\1. IFP has the same side-effect free combinator style of Backus FP, while introducing an ALGOL-like syntax and structure. While IFP superficially appears to be an inefficient language to execute, its simplicity makes it quick to interpret. Functions are always monadic and there are no variable or parameter names. Furthermore, combinator-style languages allow common housekeeping operations to be condensed into efficient machine-language primitives. By reference-counting, the interpreter can often convert call-by-value to destructive call-by-reference while preserving referential transparency. The interpreter has an expression cache which can improve the asymptotic time of some combinatorial functions. IFP function definitions are stored as UNIX files, so much of UNIX's functionality is immediately borrowed into the IFP environment, e.g. ls, more, and grep. Benchmarks indicate that IFP is an order of magnitude faster than Berkeley FP[2], and is competitive with interpreted von-Neumann languages such as BASIC. The interpreter can parallel process on shared-memory multiprocessors, e.g. the Encore Multimax. IFP currently runs on machines as varied as the IBM PC, VAX, and CRAY-XMP.", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "https://dl.acm.org/loi/sigplan", keywords = "design; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Interpreters. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, FP. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures.", } @Article{Sykora:1987:TCA, author = "O. S{\'y}kora and I. V{\v{r}}{\soft{t}}o", title = "Tight chip area lower bounds for string matching", journal = j-INFO-PROC-LETT, volume = "26", number = "3", pages = "117--119", day = "23", month = nov, year = "1987", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q35", MRnumber = "89k:68079", MRreviewer = "Christoph Meinel", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Slovak Acad of Sciences, Bratislava, Czech", classification = "714; 721; 723; 921; B0250 (Combinatorial mathematics); B2570 (Semiconductor integrated circuits); C4240 (Programming and algorithm theory)", corpsource = "Inst. of Tech. Cybern., Slovak Acad. of Sci., Bratislava, Czechoslovakia", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Boolean functions; chip area; communication graph; computational complexity; computer metatheory --- Boolean Functions; graph theory; integrated circuits, VLSI; logic circuits --- Theory; mathematical techniques --- Graph Theory; string matching; Theory; theory; tight lower bounds; verification; VLSI; VLSI circuit", pubcountry = "Netherlands A02", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ B.7.1 Hardware, INTEGRATED CIRCUITS, Types and Design Styles, VLSI (very large scale integration)", treatment = "T Theoretical or Mathematical", } @Article{VanBiljon:1987:RAP, author = "W. R. {Van Biljon} and D. A. Sewry and M. A. Mulders", title = "Register Allocation in a Pattern Matching Code Generator", journal = j-SPE, volume = "17", number = "8", pages = "521--531", month = aug, year = "1987", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "algorithms; performance", review = "ACM CR 8808-0608", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ D.4.2 Software, OPERATING SYSTEMS, Storage Management, Allocation/deallocation strategies \\ B.5.1 Hardware, REGISTER-TRANSFER-LEVEL IMPLEMENTATION, Design", } @InProceedings{Wadler:1987:VWP, author = "P. Wadler", title = "{Views}: a way for pattern matching to cohabit with data abstraction", crossref = "ACM:1987:PFA", pages = "307--313", year = "1987", bibdate = "Mon May 3 12:39:13 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/41625/p307-wadler/", acknowledgement = ack-nhfb, keywords = "algorithms; languages; theory", subject = "{\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure. {\bf E.2} Data, DATA STORAGE REPRESENTATIONS. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative (functional) languages. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types.", } @Misc{Woods:1987:E, author = "J. A. Woods", title = "{\tt egrep}", howpublished = "Usenet netnews group {\tt net.unix}", month = mar, year = "1987", bibdate = "Sat Sep 02 14:34:18 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, remark = "See also \cite{Woods:1986:MPB}.", } @Article{Zaki:1987:FDA, author = "M. Zaki and Al. H. Albarhamtoshy", title = "Formal Design of an {Arabic} Text Formatter for Microcomputers", journal = j-COMP-LANGS, volume = "12", number = "2", pages = "123--143", month = "????", year = "1987", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/typeset.bib", acknowledgement = ack-nhfb, affiliationaddress = "Al-Azhar Univ, Cairo, Egypt", classcodes = "C4220 (Automata theory); C4240 (Programming and algorithm theory); C6130D (Document processing techniques)", classification = "723", corpsource = "Dept. of Comput. and Syst. Eng., Al-Azhar Univ., Cairo, Egypt", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "Arabic characters; Arabic letter; Arabic text; Arabic text formatter; automata; character generator; character sets; computer software; data processing; deterministic automata; deterministic finite; finite automata; keyboard; nondeterministic finite automata; regular expressions; states minimization; symbol format; text editing; text formatter; transition rules; Word Processing; word processing; Word Processing", treatment = "P Practical", } @Article{Carroll:1988:RBP, author = "David M. Carroll and Christine A. Pogue and Peter Willett", title = "Research: Bibliographic pattern matching using the {ICL Distributed Array Processor}", journal = j-J-AM-SOC-INF-SCI, volume = "39", number = "6", pages = "390--399", month = nov, year = "1988", CODEN = "AISJB6", DOI = "https://doi.org/10.1002/(SICI)1097-4571(198811)39:6<390::AID-ASI2>3.0.CO%3B2-N", ISSN = "0002-8231 (print), 1097-4571 (electronic)", ISSN-L = "0002-8231", bibdate = "Fri Sep 11 09:03:34 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/jasis.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Journal of the American Society for Information Science", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)2330-1643", onlinedate = "26 May 2007", } @Article{Casanova:1988:SPM, author = "Marco A. Casanova and Antonio L. Furtado", title = "String pattern-matching in {Prolog}", journal = j-COMP-LANGS, volume = "13", number = "3-4", pages = "149--170", month = "????", year = "1988", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Rio de Janeiro, Braz", classcodes = "C6110 (Systems analysis and programming); C6130 (Data handling techniques); C4210 (Formal logic)", classification = "721; 723", corpsource = "Rio Sci. Center-IBM Brasil, Rio de Janeiro, Brazil", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "Automata Theory--Grammars; Computer Metatheory--Programming Theory; Computer Programming Languages; data handling; grammars; handling; logic programming; Logic Programming; pattern-matching; Prolog; PROLOG; Prolog Programs; SNOBOL 4; string; String Pattern Matching; String Processing; Two Level Grammars; two-level grammars", treatment = "P Practical", } @Article{Edmiston:1988:PPB, author = "Elizabeth W. Edmiston and Nolan G. Core and Joel H. Saltz and Roger M. Smith", title = "Parallel processing of biological sequence comparison algorithms", journal = j-INT-J-PARALLEL-PROG, volume = "17", number = "3", pages = "259--275", month = jun, year = "1988", CODEN = "IJPPE5", ISSN = "0885-7458 (print), 1573-7640 (electronic)", ISSN-L = "0885-7458", MRclass = "92A12", MRnumber = "999 309", bibdate = "Sat Apr 26 13:44:09 MDT 1997", bibsource = "http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0885-7458&volume=17&issue=3; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C5440 (Multiprocessor systems and techniques); C5470 (Performance evaluation and testing); C7330 (Biology and medicine)", corpsource = "Dept. of Comput. Sci., Duke Univ., Durham, NC, USA", fjournal = "International Journal of Parallel Programming", journal-URL = "http://link.springer.com/journal/10766", keywords = "biological sequence comparison algorithms; biology computing; CM-I; Connection Machine; DNA; homology; Intel iPSC/1 hypercube; molecular structure; parallel algorithms; parallel machines; parallel processing; performance evaluation; protein; string matching", treatment = "T Theoretical or Mathematical", } @Article{Ehrenfeucht:1988:NDM, author = "A. Ehrenfeucht and D. Haussler", title = "A new distance metric on strings computable in linear time", journal = j-DISCRETE-APPL-MATH, volume = "20", number = "3", pages = "191--203", month = jul, year = "1988", CODEN = "DAMADU", ISSN = "0166-218X (print), 1872-6771 (electronic)", ISSN-L = "0166-218X", bibdate = "Mon Feb 05 13:32:27 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Discrete Applied Mathematics", journal-URL = "http://www.sciencedirect.com/science/journal/0166218X", keywords = "documentation; languages; measurement; theory; verification", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ I.7.1 Computing Methodologies, TEXT PROCESSING, Text Editing, Spelling \\ G.2.m Mathematics of Computing, DISCRETE MATHEMATICS, Miscellaneous", } @Article{Eilam-Tzoreff:1988:MPS, author = "Tali Eilam-Tzoreff and Uzi Vishkin", title = "Matching patterns in strings subject to multi-linear transformations", journal = j-THEOR-COMP-SCI, volume = "60", number = "3", pages = "231--254", month = dec, year = "1988", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, affiliation = "Tel Aviv Univ", affiliationaddress = "Tel Aviv, Isr", classification = "723; C4200 (Computer theory)", corpsource = "Dept. of Comput. Sci., Sch. of Math. Sci., Tel Aviv Univ., Israel", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", journalabr = "Theor Comput Sci", keywords = "Algorithms; computation theory; Computer Metatheory; Computer Programming; Minimum Distance Problems; multi-linear transformations; Multilinear Transformations; pattern matching; Pattern Matching; pattern recognition; strings; Strings of Real Numbers", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Flaherty:1988:STM, author = "Terry Flaherty", title = "A simple technique to motivate structured programming", journal = j-SIGCSE, volume = "20", number = "1", pages = "153--155", month = feb, year = "1988", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/52965.53002", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 18:57:05 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigcse1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Programs with only sequence, selection, and iteration control structures (structured programs) are more understandable and changeable than programs with unrestricted control structures (flowchart programs). However, flowcharts are intuitive, simple, and easy to follow step by step. The transition from teaching general flowcharts to structured ones is usually made by postulating the standard structured flowchart patterns without much justification. The present method establishes the correspondence between flowcharts and structured programs via sets of computations. The student examines a set of computations of a flowchart program and describes the general structure with a regular expression. A structured program that corresponds to this regular expression is constructed. In this way, the student is led to (1) see the difference between program and computation, (2) see how ``structure'' arises, (3) see that a structured program is one whose textual structure is identical to the structural description of its computations, (4) appreciate the cognitive simplicity of structure descriptions versus flowcharts.", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Greenwood:1988:VSR, author = "S. R. Greenwood", title = "{VAX SCAN}: rule-based text processing software", journal = j-DEC-TECH-J, volume = "1", number = "6", pages = "40--50", month = feb, year = "1988", CODEN = "DTJOEL", ISSN = "0898-901X", bibdate = "Thu Mar 20 18:15:43 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C6115 (Programming support); C6130D (Document processing techniques)", corpsource = "Digital Equipment Corp., Hudson, MA, USA", fjournal = "Digital Technical Journal", keywords = "character recognition; DEC; DEC computers; editing; pattern-matching; procedural language; rule-based software; software productivity; software tools; text; text patterns; text processing; text recognition; VAX SCAN; word processing", treatment = "P Practical", } @Article{Hamilton:1988:LPE, author = "Eric Hamilton", title = "Literate Programming\emdash{}Expanding Generalized Regular Expressions", journal = j-CACM, volume = "31", number = "12", pages = "1376--1385", month = dec, year = "1988", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Wed Jan 17 11:48:56 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", } @InProceedings{Hume:1988:GW, author = "Andrew Hume", editor = "????", booktitle = "1988 Spring (London) {EUUG} Conference Proceedings", title = "{{\tt Grep}} wars", publisher = "????", address = "????", pages = "237--245", year = "1988", bibdate = "Sat Sep 02 14:50:57 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Hume:1988:TTG, author = "Andrew Hume", title = "A Tale of Two Greps", journal = j-SPE, volume = "18", number = "11", pages = "1063--1072", month = nov, year = "1988", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380181105", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "30 Oct 2006", received = "11 January 1988", remark = "The first paragraph describes important history: ``In the beginning, Ken Thompson wrote the searching tool {\tt grep}. It took a regular expression and file names as arguments and printed from those files lines that matched the regular expression. In 1975, just after the release of the Sixth Edition of the UNIX system, Al Aho decided to put theory about finite state automata into practice and wrote {\tt egrep} over a weekend. {\tt Egrep} supported full regular expressions (including alternation and grouping, which were missing from {\tt grep}) and used a deterministic finite automaton rather than {\tt grep}'s nondeterministic finite automaton. {\tt Egrep} was about twice as fast as {\tt grep} for simple character searches but was slower for complex search patterns due to the high cost of building the state machine that recognized the patterns. {\tt Fgrep}, specialized for the case of many alternate literal strings, was written in the same weekend.''", revised = "26 May 1988", } @Article{Itano:1988:IPM, author = "Kozo Itano and Yutaka Sato and Hidemi Hirai and Tomoyoshi Yamagata", title = "An incremental pattern matching algorithm for the pipelined lexical scanner", journal = j-INFO-PROC-LETT, volume = "27", number = "5", pages = "253--258", day = "28", month = apr, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of Tsukuba, Sakura-mura, Jpn", classification = "723; C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", corpsource = "Inst. of Inf. Sci. and Electron., Tsukuba Univ., Ibaraki, Japan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; assemblers; C programs; compact binary form; compilers; computer programming; computer programming languages --- Pascal; computer systems, digital --- Parallel Processing; file organisation; hashing; incremental pattern matching algorithm; interpreters; language processors; languages; lexical scanning algorithm; measurement; Pascal programs; performance; pipeline processing; pipelined lexical scanner; program assemblers; program compilers; program interpreters; string compaction; theory; variable-length character strings", pubcountry = "Netherlands A06", subject = "D.3.4 Software, PROGRAMMING LANGUAGES, Processors \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "P Practical", } @Article{Landau:1988:FSM, author = "Gad M. Landau and Uzi Vishkin", title = "Fast string matching with $k$ differences", journal = j-J-COMP-SYS-SCI, volume = "37", number = "1", pages = "63--78", month = aug, year = "1988", CODEN = "JCSSBM", ISSN = "0022-0000 (print), 1090-2724 (electronic)", ISSN-L = "0022-0000", bibdate = "Tue Jan 29 15:26:09 MST 2019", bibsource = "https://www.math.utah.edu/pub/tex/bib/jcompsyssci.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0022000088900451", acknowledgement = ack-nhfb, fjournal = "Journal of Computer and System Sciences", journal-URL = "http://www.sciencedirect.com/science/journal/00220000", } @InProceedings{Lee:1988:HSC, author = "Peizong Lee and Z. M. Kedem", title = "On high-speed computing with a programmable linear array", crossref = "IEEE:1988:PSN", volume = "1", pages = "425--432", year = "1988", bibdate = "Thu Apr 16 07:55:03 MDT 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "B1265B (Logic circuits); C5120 (Logic and switching circuits)C4290 (Other computer theory)", corpsource = "Courant Inst. of Math. Sci., New York Univ., NY, USA", keywords = "algebraic computations; arbitrary depth; cellular arrays; database operations; high-speed computing; image processing; logic arrays; matrix arithmetic; nested FOT- loops; parallel algorithms; pattern matching; programmable linear array; sequential algorithms; signal processing; sorting; systolic array; transitive closure", sponsororg = "IEEE; ACM", treatment = "P Practical", } @Article{Liu:1988:SPM, author = "Ken-Chih Liu", title = "On String Pattern Matching: a Quantitative Analysis and a Proposal", journal = j-COMP-LANGS, volume = "13", number = "1", pages = "23--29", month = "????", year = "1988", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Iowa State Univ, Ames, IA, USA", classcodes = "C4240 (Programming and algorithm theory); C6110 (Systems analysis and programming); C6130 (Data handling techniques); C6140D (High level languages)", classification = "723", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "Algorithms; computer programming; computer programming languages; data handling; Gimpel's model; high level languages; pattern matching; programming; programming theory; Snobol4 pattern; SNOBOL4 pattern matching algorithm; special case processing; string pattern matching; string processing languages design; time complexity", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Mitchell:1988:OHS, author = "Joan L. Mitchell and William B. Pennebaker", title = "Optimal hardware and software arithmetic coding procedures for the {Q-Coder}", journal = j-IBM-JRD, volume = "32", number = "6", pages = "727--736", month = nov, year = "1988", CODEN = "IBMJAE", ISSN = "0018-8646 (print), 2151-8556 (electronic)", ISSN-L = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/ibmjrd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The Q-Coder is an important new development in arithmetic coding. It combines a simple but efficient arithmetic approximation for the multiply operation, a new formalism which yields optimally efficient hardware and software implementations, and a new form of probability estimation. This paper describes the concepts which allow different, yet compatible, optimal software and hardware implementations. In prior binary arithmetic coding algorithms, efficient hardware implementations favored ordering the more probable symbol (MPS) above the less probable symbol (LPS) in the current probability interval. Efficient software implementation required the inverse ordering convention. It is shown that optimal hardware and software encoders and decoders can be achieved with either symbol ordering. Although optimal implementation for a given symbol ordering requires the hardware and software code strings to point to opposite ends of the probability interval, either code string can be converted to match the other exactly. A code string generated using one symbol-ordering convention can be inverted so that it exactly matches the code string generated with the inverse convention. Even where bit stuffing is used to block carry propagation, the code strings can be kept identical.", acknowledgement = ack-nhfb, affiliation = "IBM Res. Div., Thomas J. Watson Res. Center", affiliationaddress = "Yorktown Heights, NY, USA", classcodes = "B6120B (Codes); B6110 (Information theory); C5230 (Digital arithmetic methods); C1260 (Information theory); C4220 (Automata theory)", classification = "722; 723; 921; 922; B6110 (Information theory); B6120B (Codes); C1260 (Information theory); C4220 (Automata theory); C5230 (Digital arithmetic methods)", corpsource = "IBM Res. Div., Thomas J. Watson Res. Center, Yorktown Heights, NY, USA", fjournal = "IBM Journal of Research and Development", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=5288520", journalabr = "IBM J Res Dev", keywords = "approximation; arithmetic; Arithmetic approximation; arithmetic coding; Arithmetic coding; Arithmetic Coding; Codes, Symbolic; Coding Algorithms; Computer Hardware; Computer Software; Decoders; decoders; digital arithmetic; encoding; estimation; finite automata; Formalism; formalism; Hardware coding; hardware coding; hardware implementations; Hardware implementations; information; inverse; Inverse ordering convention; Less probable symbol; less probable symbol; Mathematical Techniques; more probable symbol; More probable symbol; Multiply operation; multiply operation; Multiply Operation; ordering convention; Performance; probability; Probability; Probability estimation; Probability Interval; Q-Coder; Q-coder; software implementation; Software implementation; Symbol Ordering; theory", thesaurus = "Digital arithmetic; Encoding; Finite automata; Information theory; Probability", treatment = "T Theoretical or Mathematical", } @Article{Owolabi:1988:FAS, author = "O. Owolabi and D. R. McGregor", title = "Fast Approximate String Matching", journal = j-SPE, volume = "18", number = "4", pages = "387--393", month = apr, year = "1988", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", } @Article{Purushothaman:1988:RAS, author = "S. Purushothaman and P. A. Subrahmanyam", title = "Reasoning about systolic algorithms", journal = j-J-PAR-DIST-COMP, volume = "5", number = "6", pages = "669--699", month = dec, year = "1988", CODEN = "JPDCER", ISSN = "0743-7315 (print), 1096-0848 (electronic)", bibdate = "Sat Apr 12 19:06:31 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/jpardistcomp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "University Park, PA, USA", classification = "713; 714; 721; 722; 723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA", fjournal = "Journal of Parallel and Distributed Computing", journal-URL = "http://www.sciencedirect.com/science/journal/07437315/", journalabr = "J Parallel Distrib Comput", keywords = "algorithm theory; Algorithms; Automata Theory; Boyer--Moore Theorem Prover; Boyer--Moore theorem prover; Computer Architecture; Computer Programming; correctness; Correctness Proof; equations; Integrated Circuits, VLSI; Mathematical Techniques; mechanical correctness proof; parallel algorithms; Recursive Equations; recursive equations; recursive functions; Systolic Algorithms; systolic algorithms; theorem proving; Uniform; uniform recurrence", treatment = "T Theoretical or Mathematical", } @Article{Ratcliff:1988:PMG, author = "John W. Ratcliff and David E. Metzener", title = "Pattern Matching: The Gestalt Approach", journal = j-DDJ, volume = "13", number = "7", pages = "46, 47, 59--51, 68--72", month = jul, year = "1988", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 03 09:18:35 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Dr. Dobb's Journal of Software Tools", } @Article{Robertson:1988:TTW, author = "Edmund F. Robertson", title = "{Tietze} Transformations with Weighted Substring Search", journal = j-J-SYMBOLIC-COMP, volume = "6", number = "1", pages = "59--64", month = aug, year = "1988", CODEN = "JSYCEH", ISSN = "0747-7171 (print), 1095-855X (electronic)", ISSN-L = "0747-7171", MRclass = "68Q40 (20F05)", MRnumber = "89h:68076", bibdate = "Sat May 10 15:54:09 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "B0250 (Combinatorial mathematics); C1160 (Combinatorial mathematics)", corpsource = "Math. Inst., St. Andrews, UK", fjournal = "Journal of Symbolic Computation", journal-URL = "http://www.sciencedirect.com/science/journal/07477171/", keywords = "computer program; elimination; group; group theory; Groups; length function; presentation; routing; Tietze transformations; weighted substring search", treatment = "T Theoretical or Mathematical", } @Article{Rus:1988:PLP, author = "T. Rus", title = "Parsing languages by pattern matching", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "14", number = "4", pages = "498--511", month = apr, year = "1988", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/32.4672", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=4672", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Schaback:1988:ESB, author = "R. Schaback", title = "On the expected sublinearity of the {Boyer--Moore} algorithm", journal = j-SIAM-J-COMPUT, volume = "17", number = "4", pages = "648--658", month = aug, year = "1988", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q25 (68P10 68T10)", MRnumber = "89h:68070", MRreviewer = "Dominique Gouyou-Beauchamps", bibdate = "Mon Nov 29 11:01:07 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/17/4; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Schnoebelen:1988:RCP, author = "Ph. Schnoebelen", title = "Refined compilation of pattern-matching for functional languages", journal = j-SCI-COMPUT-PROGRAM, volume = "11", number = "2", pages = "133--159", month = dec, year = "1988", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", MRclass = "68N15 (68N20 68Q50)", MRnumber = "89k:68011", bibdate = "Sun Oct 10 09:12:09 MDT 1999", bibsource = "Compendex database; http://www.sciencedirect.com/science/journal/01676423; https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; MathSciNet database", acknowledgement = ack-nhfb, affiliation = "Lab d'Informatique Fondamentale et d'Intelligence Artificielle", affiliationaddress = "Grenoble, Fr", classification = "723", fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", journalabr = "Sci Comput Program", keywords = "Compilation Algorithm; Compiling Functions; Computer Metatheory; Computer Operating Systems --- Program Compilers; Computer Programming; Computer Programming Languages; Functional Languages; Pattern Matching", } @Article{Shankar:1988:MPC, author = "N. Shankar", title = "A Mechanical Proof of the {Church--Rosser} Theorem", journal = j-J-ACM, volume = "35", number = "3", pages = "475--522", month = jul, year = "1988", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/44484.html", abstract = "We describe a formalization and proof of the Church--Rosser theorem that was carried out with the Boyer--Moore theorem prover. The mechanical proof illustrates the effective use of the Boyer--Moore theorem prover in proof checking difficult metamathematical proofs.", acknowledgement = ack-nhfb, affiliationaddress = "Stanford Univ, Stanford, CA, USA", classification = "723", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "artificial intelligence; Boyer--Moore theorem prover; Church--Rosser theorem; computer metatheory; experimentation; lambda calculus; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Computational logic. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Mathematical induction.", } @Article{Sharpe:1988:ARE, author = "Daniel Sharpe", title = "Adding regular expressions to {Pascal}", journal = j-SIGPLAN, volume = "23", number = "12", pages = "125--133", month = dec, year = "1988", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:33 MST 2003", bibsource = "Compendex database; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "One generally praiseworthy characteristics of Pascal is that it allows the programmer to define new data types. However, not all operations that can be performed on indigenous types can also be performed on programmer-defined types. I/O is an example. This paper proposes an extension to Pascal that allows generalized input of enumerated types. Syntax is defined which lets the programmer use regular expressions to exercise considerable control over the translation of strings of input characters into the internal representation used for enumerated types.", acknowledgement = ack-nhfb, affiliationaddress = "Carrollton, GA, USA", classification = "723", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Not", keywords = "Computer Operating Systems--Program Compilers; Computer Programming; Computer Programming Languages; Data Processing--Data Structures; Data Types; design; Internal Representation; languages; Lexical Analysis; pascal; Pascal Enumerated Types; Programming Language Pascal", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Pascal \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures \\ I.1.1 Computing Methodologies, ALGEBRAIC MANIPULATION, Expressions and Their Representation, Representations (General and Polynomial)", } @TechReport{Smith:1988:ILL, author = "W. W. Smith and R. H. Campbell", title = "Introduction to Leif language descriptions", number = "UIUCDCS-R-88-1444", institution = "University of Illinois at Urbana-Champaign", address = "Urbana-Champaign, IL, USA", pages = "78", month = jul, year = "1988", bibdate = "Wed Oct 30 06:19:01 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Explains how to create and compile new language description files for Leif. Leif performs syntax checking and provides language oriented editing features for a text editor. The User Manual for Leif with GNU Emacs and the GNU Emacs Manual describe how to use Leif with its front-end, GNU Emacs. Leif uses languages specified with a regular expression lexical analyzer and an LALR(1) parse table. Each language description has three user specified components that are combined into a single, compiled language description file. The authors describe the utility that combines each of these three components into a completed language description file. They then describe the three components of a language description: parse tables, lexical analyser tables, and supplementary information. They describe the utilities used to process the specifications of these three parts of a language description file, Leif editing commands that may be used to help debug new languages, and two additional utilities supplied with Leif. They show how Leif locates the language description files required to edit a program. The text of a small example language is given. Appendices describe the utilities used to build a language description.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA description manual, and installation guide", classification = "C6130D (Document processing techniques); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", issuedby = "Univ. Illinois at Urbana-Champaign, IL, USA", keywords = "Compiled language; Debugging; Editing commands; Front-end; GNU Emacs; LALR(1) parse table; Language description files; Language oriented editing features; Leif; Lexical analyser tables; Parse tables; Regular expression lexical analyzer; Specifications; Supplementary information; Syntax checking; Text editor; User specified components; Utilities", pubcountry = "USA", thesaurus = "Program compilers; Specification languages; Text editing", } @Article{Sridhar:1988:CBG, author = "M. A. Sridhar", title = "On the connectivity of the {De Bruijn} graph", journal = j-INFO-PROC-LETT, volume = "27", number = "6", pages = "315--318", day = "13", month = may, year = "1988", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R05 (05C40)", MRnumber = "89h:68117", MRreviewer = "Bernd Graw", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Univ of South Carolina, Columbia, SC, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4210 (Formal logic)", corpsource = "Dept. of Comput. Sci., South Carolina Univ., SC, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "connectivity; data processing; Data Structures; de Bruijn graph; De Bruijn graph; formal languages; graph theory; labeled directed graphs; mathematical techniques --- Graph Theory; periods; self-loops; string matching; strings; theory; verification", pubcountry = "Netherlands A07", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Book{Tanenbaum:1988:MAS, author = "Andrew S. Tanenbaum and Johan W. Stevenson and Jost Muller", title = "{MINIX} for the {ATARI ST} and {MINIX} manual for the {ATARI ST}", publisher = pub-PH, address = pub-PH:adr, edition = "Version 1.1.", year = "1988", ISBN = "0-13-584392-8 (disks), 0-13-584434-7 (manual)", ISBN-13 = "978-0-13-584392-5 (disks), 978-0-13-584434-2 (manual)", LCCN = "QA76.76.O63", bibdate = "Mon Sep 30 17:55:16 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/minix.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "9 computer disks.", abstract = "MINIX is a new operating system that is similar to Version 7 of the UNIX operating system. MINIX is widely used on the IBM PC, and has now been ported to the Atari ST and Mega ST. Unlike the UNIX system itself, MINIX comes complete with all the source code. MINIX features: a system call compatible with V7 UNIX (except for a few very minor calls); a Kernighan and Ritchie compatible C compiler; a shell that is functionally identical to the Bourne shell; full multiprogramming (fork+exec; background jobs in shell: cc file.c \&); a full screen editor inspired by emacs (modeless, autoinsert, etc.); over 60 popular utilities (cat, cp, grep, ls, make, mount, sort, etc.); and over 100 library procedures (atoi, fork, malloc, stdio, strcmp, etc.) It works with floppy-only systems or with hard disk systems. A full operating system source code is included, and the source code for all utilities (except the C compiler) is also included.", acknowledgement = ack-nhfb, annote = "Title from disk label. An operating system for small computer systems, inspired by V7 of the UNIX operating system. It has a hierarchical file system, supports full multitasking, and has a command interpreter, called the shell, similar to the Bourne shell on UNIX. Comes with 100 utility programs, nearly all of which are similar to UNIX programs. System requirements: Amiga ST; 512K RAM; TOS. Atari ST", classification = "C6150J (Operating systems)", keywords = "Atari ST; Bourne shell; Emacs; Floppy disk systems; Full screen editor; Hard disk systems; Kernighan and Ritchie compatible C compiler; Library procedures; Mega ST; MINIX; Multiprogramming; Operating system; Operating systems (Computers) --- Software.; Source code; System call; UNIX; Utilities", pubcountry = "USA", thesaurus = "Atari computers; Microcomputer applications; Unix; User manuals", } @Article{Tarhio:1988:GAA, author = "Jorma Tarhio and Esko Ukkonen", title = "A greedy approximation algorithm for constructing shortest common superstrings", journal = j-THEOR-COMP-SCI, volume = "57", number = "1", pages = "131--145", month = apr, year = "1988", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Helsinki", affiliationaddress = "Helsinki, Finl", classification = "723; 921; B0290F (Interpolation and function approximation); B6140 (Signal processing and detection); C1260 (Information theory)C4130 (Interpolation and function approximation)", conference = "International Symposium on Mathematical Foundations of Computer Science, MFCS '86", conflocation = "Bratislava, Czechoslovakia; 25-29 Aug. 1986", conftitle = "International Symposium on Mathematical Foundations of Computer Science", corpsource = "Dept. of Comput. Sci., Helsinki Univ., Finland", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", journalabr = "Theor Comput Sci", keywords = "Algorithms; approximation theory; Computer Programming; data compression; Greedy Approximation Algorithm; greedy approximation algorithm; greedy heuristics; Hamiltonian paths; Knuth--Morris--Pratt string-matching procedure; Longest Hamiltonian Paths; Mathematical Techniques --- Graph Theory; Optimization; Shortest Common Superstrings; shortest common superstrings; String Compression; String-Matching; Weighted Graphs; weighted graphs", meetingaddress = "Bratislava, Czech", meetingdate = "Aug 25--29 1986", meetingdate2 = "08/25--29/86", pubcountry = "Netherlands A07", treatment = "T Theoretical or Mathematical", } @Article{VanWyk:1988:LPE, author = "Christopher J. {Van Wyk} and Eric Hamilton and Don Colner", title = "Literate Programming: Expanding Generalized Regular Expressions", journal = j-CACM, volume = "31", number = "12", pages = "1376--1385", month = dec, year = "1988", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Mon Jan 22 07:31:02 MST 2001", bibsource = "http://dblp.uni-trier.de/db/journals/cacm/cacm31.html#WykHC88; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", oldlabel = "WykHC88", XMLdata = "ftp://ftp.informatik.uni-trier.de/pub/users/Ley/bib/records.tar.gz#journals/cacm/WykHC88", } @Article{Walther:1988:MSU, author = "Christoph Walther", title = "Many-Sorted Unification", journal = j-J-ACM, volume = "35", number = "1", pages = "1--17", month = jan, year = "1988", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Wed Jan 15 18:12:53 MST 1997", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/hybrid.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/45071.html", abstract = "Many-sorted unification is considered; that is, unification in the many-sorted free algebras of terms, where variables, as well as the domains and ranges of functions, are restricted to certain subsets of the universe, given as a potentially infinite hierarchy of sorts. It is shown that complete and minimal sets of unifiers may not always exist for many-sorted unification. Conditions for sort hierarchies that are equivalent for the existence of these sets with one, finitely many, or infinitely many elements are presented. It is also proved that being a forest-structured sort hierarchy is a necessary and sufficient criterion for the Robinson Unification Theorem to hold for many-sorted unification. An algorithm for many-sorted unification is given.", acknowledgement = ack-nhfb, affiliationaddress = "Univ Karlsruhe, West Ger", classification = "723; 921", fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", journalabr = "J Assoc Comput Mach", keywords = "algorithms; artificial intelligence; computer metatheory --- Formal Logic; computer programming --- Algorithms; many-sorted logic; many-sorted unification; mathematical techniques --- Algebra; Robinson unification theorem; theory; verification", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Mechanical theorem proving. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.1.3}: Computing Methodologies, ALGEBRAIC MANIPULATION, Languages and Systems, Substitution mechanisms. {\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving, Resolution.", } @Article{Wood:1988:IFS, author = "David P. Wood and David Turcaso", title = "Implementing a faster string search algorithm in {Ada}", journal = j-SIGADA-LETTERS, volume = "8", number = "3", pages = "87--97", month = may # "\slash " # jun, year = "1988", CODEN = "AALEE5", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Sat Aug 9 09:05:29 MDT 2003", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigada.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C6130 (Data handling techniques)", corpsource = "Softech Inc., Alexandria, VA, USA", countrypub = "USA A02", fjournal = "ACM SIGAda Ada Letters", journal-URL = "https://dl.acm.org/loi/sigada", keywords = "Ada; Ada implementation; Ada listings; algorithms; character-by-character search; data handling; languages; string search algorithm; theory", subject = "D.3.2 Software, PROGRAMMING LANGUAGES, Language Classifications, Ada \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching", treatment = "P Practical", } @Article{Aho:1989:CGU, author = "Alfred V. Aho and Mahadevan Ganapathi and Steven W. K. Tjiang", title = "Code Generation Using Tree Matching and Dynamic Programming", journal = j-TOPLAS, volume = "11", number = "4", pages = "491--516", month = oct, year = "1989", CODEN = "ATPSDT", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "Compiler/Compiler.Lins.bib; Compiler/TOPLAS.bib; Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib; Misc/IMMD_IV.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0164-0925/75700.html", acknowledgement = ack-nhfb # " and " # ack-pb, fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", keywords = "algorithms; comparison of alternative covers of original expression; design; experimentation; languages; matching multiple trees using finite state automata; reduction rules: complex expression $\rightarrow$ single instruction cost; theory", subject = "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, twig. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Nonprocedural languages. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf F.4.2}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parallel rewriting systems. {\bf I.2.8}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Problem Solving, Control Methods, and Search, Dynamic programming.", } @TechReport{Albert:1989:CMA, author = "Luc Albert", title = "Complexit{\'e} en moyenne de l'algorithme de multi-pattern matching {RETE} sur des ensembles de patterns et d'objets de profondeur un. ({French}) [{Mean} complexity of the multi-pattern matching algorithm {RETE} on sets of patterns and objects of depth one]", volume = "1009", institution = "Institut National de Recherche en Informatique et en Automatique", address = "Le Chesnay, France", pages = "34", year = "1989", LCCN = "????", bibdate = "Wed Mar 13 13:43:08 MDT 2013", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", series = "Rapports de recherche (Institut National de Recherche en Informatique et en Automatique (France))", acknowledgement = ack-nhfb, language = "French", subject = "Algorithmes; Syst{\`e}mes experts (informatique); Bases de donn{\'e}es relationnelles; Algorithms; Matching theory; Expert systems (Computer science)", } @Article{Allan:1989:POT, author = "V. H. Allan", title = "Peephole optimization as a targeting and coupling tool", journal = j-SIGMICRO, volume = "20", number = "3", pages = "112--121", month = aug, year = "1989", CODEN = "SIGMDJ", DOI = "https://doi.org/10.1145/75395.75407", ISSN = "0163-5751, 1050-916X", ISSN-L = "0163-5751", bibdate = "Fri Apr 16 10:27:41 MDT 2021", bibsource = "https://www.math.utah.edu/pub/tex/bib/sigmicro.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "https://dl.acm.org/doi/10.1145/75395.75407", abstract = "The term peephole optimization is used to mean the pattern matching and conditional replacement performed on small sections of the intermediate form. The circular dependence between the code generation phases implies that local optimals are rarely global \ldots{}", acknowledgement = ack-nhfb, fjournal = "ACM SIGMICRO Newsletter", journal-URL = "https://dl.acm.org/loi/sigmicro", } @Article{Aoe:1989:EIS, author = "J. I. Aoe", title = "An efficient implementation of static string pattern matching machines", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "15", number = "8", pages = "1010--1016", month = aug, year = "1989", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/32.31357", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 08:07:37 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=31357", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Arratia:1989:ERS, author = "R. Arratia and M. S. Waterman", title = "The {Erd{\H{o}}s--Renyi} {Strong Law} for Pattern Matching with a Given Proportion of Mismatches", journal = j-ANN-PROBAB, volume = "17", number = "3", pages = "1152--1169", month = jul, year = "1989", CODEN = "APBYAE", ISSN = "0091-1798 (print), 2168-894X (electronic)", ISSN-L = "0091-1798", bibdate = "Sun Apr 20 10:44:17 MDT 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/annprobab1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://projecteuclid.org/euclid.aop/1176991262", acknowledgement = ack-nhfb, fjournal = "Annals of Probability", journal-URL = "http://projecteuclid.org/all/euclid.aop", } @InProceedings{Auernheimer:1989:NNM, author = "Brent Auernheimer and Alison Butler", title = "Neural net model of the neuropsychology of spelling processes", crossref = "ACM:1989:SAA", pages = "430--??", year = "1989", bibdate = "Wed Jan 15 12:19:41 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The neural network (or `brain-style') approach to computing is useful for developing systems to perform tasks humans traditionally do well and that computers do not. Neural network systems are particularly suited for pattern matching and categorization applications such as recognizing visual or auditory data. This research is concerned with representing the human spelling processes. Because spoken language is our primary mode of communication, neuropsychologists have for the most part overlooked the spelling and writing processes. Recently, interest in orthographic processes has grown. This research is an attempt to translate a theory of the cognitive processes of spelling into a neural network. An initial goal of this research is to test the model's learning and performance against normal subjects' spelling. After the model is validated for normal subjects, the neural network will be `lesioned', and the results compared to the performance of brain-damaged patients.", acknowledgement = ack-nhfb, affiliation = "California State Univ", affiliationaddress = "Fresno, CA, USA", classification = "461; 723", conference = "Seventeenth Annual ACM Computer Science Conference", conferenceyear = "1989", keywords = "Cognitive Processes; Human Engineering--Research; Neural Nets; Neuropsychology; Spelling; Summary Only; Systems Science and Cybernetics", meetingabr = "Seventeenth Annu ACM Comput Sci Conf", meetingaddress = "Louisville, KY, USA", meetingdate = "Feb 21--23 1989", meetingdate2 = "02/21--23/89", } @Article{Augustsson:1989:CLM, author = "L. Augustsson and T. Johnsson", title = "The {Chalmers Lazy-ML} Compiler", journal = j-COMP-J, volume = "32", number = "2", pages = "127--141", month = apr, year = "1989", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/32.2.127", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:26 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/32/2.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Misc/Functional.bib", URL = "http://comjnl.oxfordjournals.org/content/32/2/127.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/127.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/128.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/129.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/130.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/131.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/132.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/133.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/134.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/135.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/136.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/137.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/138.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/139.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/140.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_02/tiff/141.tif", abstract = "The authors present the principles and pragmatics of a compiler for Lazy ML, a lazy and purely functional variant of ML. The aim has been to develop an implementation that enables efficient execution on today's computers.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Chalmers Univ. of Technol.", affiliationaddress = "Goteborg, Swed", classcodes = "C6150C (Compilers, interpreters and other processors); C6140D (High level languages)", classification = "723; C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Chalmers Univ. of Technol., Goteborg, Sweden", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "abstract machine; Abstract machine; Chalmers; compilers; Computer Operating Systems; Computer Programming; Computer Programming Languages; functional programming; functional variant; Functional variant; G-machine; high level languages; input/output; Input/output; language; Lazy Functional Languages; Lazy ML; Lazy ML language; Lazy ml Language; Lazy-ML compiler; modules; Modules; pattern matching; Pattern matching; Pattern Matching, Chalmers; program; Program Compilers; program transformation phases; Program transformation phases; separate compilation; Separate compilation", thesaurus = "Functional programming; High level languages; Program compilers", treatment = "P Practical", } @Article{Baeza-Yates:1989:ISS, author = "Ricardo A. Baeza-Yates", title = "Improved String Searching", journal = j-SPE, volume = "19", number = "3", pages = "257--271", month = mar, year = "1989", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380190305", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "30 Oct 2006", } @Article{Bird:1989:FDP, author = "R. S. Bird and J. Gibbons and G. Jones", title = "Formal derivation of a pattern matching algorithm", journal = j-SCI-COMPUT-PROGRAM, volume = "12", number = "2", pages = "93--104", month = jul, year = "1989", CODEN = "SCPGD4", ISSN = "0167-6423 (print), 1872-7964 (electronic)", ISSN-L = "0167-6423", MRclass = "68Q20", MRnumber = "90k:68055", bibdate = "Sun Oct 10 09:12:09 MDT 1999", bibsource = "Compendex database; http://www.sciencedirect.com/science/journal/01676423; https://www.math.utah.edu/pub/tex/bib/scicomputprogram.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; MathSciNet database", acknowledgement = ack-nhfb, affiliation = "Oxford Univ", affiliationaddress = "Engl", classification = "723", fjournal = "Science of Computer Programming", journal-URL = "http://www.sciencedirect.com/science/journal/01676423", journalabr = "Sci Comput Program", keywords = "Computer Metatheory --- Programming Theory; Computer Programming --- Algorithms; Knuth--Morris--Pratt Algorithm; Pattern Matching Algorithms; Pattern Recognition", } @Article{Burton:1989:FPQ, author = "F. Warren Burton and John G. Kollias", title = "Functional programming with quadtrees", journal = j-IEEE-SOFTWARE, volume = "6", number = "1", pages = "90--97", month = jan, year = "1989", CODEN = "IESOEG", ISSN = "0740-7459 (print), 0740-7459 (electronic)", ISSN-L = "0740-7459", bibdate = "Sat Jan 25 07:35:26 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/ieeesoft.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "723", fjournal = "IEEE Software", journal-URL = "http://www.computer.org/portal/web/csdl/magazines/software", journalabr = "IEEE Software", keywords = "Computer Programming; Computer Programming Languages; Data Processing --- Data Structures; Data Types; Function Programming; Functional Languages; Pattern Matching; Quadtrees", } @Article{Cieslak:1989:PNP, author = "R. Cieslak and A. Fawaz and S. Sachs and P. Varaiya and J. Walrand and A. Li", title = "The Programmable Network Prototyping System", journal = j-COMPUTER, volume = "22", number = "5", pages = "67--76", month = may, year = "1989", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Feb 01 14:21:35 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/computer1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Misc/IMMD_IV.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Electr. Eng and Comput. Sci., California Univ., Berkeley, CA, USA", classification = "B6210L (Computer communications); C0310F (Software development management); C5620 (Computer networks and techniques); C6110B (Software engineering techniques); C6115 (Programming support); C6155 (Computer communications software); C7420 (Control engineering)", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", keywords = "Communication network emulation; Component specifications; Control system; Generic communications functions; Interacting components; Library; Load conditions; Pattern matching; PNPS; Programmable network prototyping system; Prototyping environment; Reception; Reusable hardware modules; Signal propagation; Software tools; Transmission", thesaurus = "Computer communications software; Computer networks; Computerised control; Programming; Programming environments", } @Article{Consel:1989:PEP, author = "Charles Consel and Olivier Danvy", title = "Partial evaluation of pattern matching in strings", journal = j-INFO-PROC-LETT, volume = "30", number = "2", pages = "79--86", day = "30", month = jan, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Paris, Fr", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory); C6130 (Data handling techniques); C6150C (Compilers, interpreters and other processors)", corpsource = "Paris VI Univ., France", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; algorithms; Automata Theory--Finite Automata; compilers; Computer Programming; data handling; deterministic automata; Deterministic Finite Automata; deterministic finite automaton; finite automata; Knuth--Morris--Pratt Algorithm; languages; Partial Evaluation; partial evaluation; pattern matcher; Pattern Matching; pattern matching; program compilers; programming theory; strings; theory", subject = "F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Cooper:1989:FHO, author = "M. C. Cooper", title = "Formal hierarchical object models for fast template matching", journal = j-COMP-J, volume = "32", number = "4", pages = "351--361", month = aug, year = "1989", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/32.4.351", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:27 MST 2012", bibsource = "Compendex database; http://comjnl.oxfordjournals.org/content/32/4.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/32/4/351.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/351.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/352.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/353.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/354.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/355.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/356.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/357.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/358.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/359.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/360.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_04/tiff/361.tif", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Hull Univ.", affiliationaddress = "Hull, Engl", classcodes = "C6120 (File organisation)", classification = "713; 723; 741; C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., Hull Univ., UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "Applications; data structures; edge-detection; Edge-detection operators; formal hierarchical object models; Formal hierarchical object models; Hierarchical Object Models; Image Processing; inspection; Inspection; Mathematical Transformations--Fourier Transforms; Object-Oriented Programming; operators; Pattern Matching; pictures; Pictures, Pattern Recognition; printed circuit boards; Printed circuit boards; Printed Circuits--Inspection; repeated sub-objects; Repeated sub-objects; repetitive structure; Repetitive structure; repnets; Repnets; template matching; Template matching", thesaurus = "Data structures", treatment = "P Practical", } @Article{Delcambre:1989:PMR, author = "L. M. L. Delcambre and J. Waramahaputi and J. N. Etheredge", title = "Pattern match reduction for {Relational Production Language} in the {USL MMDBS}", journal = j-SIGMOD, volume = "18", number = "3", pages = "59--67", month = sep, year = "1989", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", ISSN-L = "0163-5808", bibdate = "Mon Jan 12 08:45:32 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigmod.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA", classification = "C6160D (Relational DBMS); C6160Z (Other DBMS); C6170 (Expert systems)", fjournal = "SIGMOD Record (ACM Special Interest Group on Management of Data)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J689", keywords = "Expert database systems; Pattern Match Reduction; Performance characteristics; Query processing; Relational Production Language; Relational rules; Relational view; RPL; RPL interpreter", thesaurus = "Computerised pattern recognition; Expert systems; Relational databases", xxtitle = "Pattern match reduction for the relational production language in the {USL MMDBS}", } @Article{Eckel:1989:TSI, author = "Bruce Eckel", title = "{TAWK}: a simple interpreter in {C++}", journal = j-DDJ, volume = "14", number = "5", pages = "50--60, 98, 100--102", month = may, year = "1989", CODEN = "DDJOEB", ISSN = "0888-3076", bibdate = "Tue Sep 10 09:30:19 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Eisys Consulting, Seattle, WA, USA", classification = "C6150C (Compilers, interpreters and other processors); C6160 (Database management systems (DBMS))", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "'Report'; 'Scripting language'; 'Tiny awk'; C++; Common-separated ASCII file; Data-encapsulation; Database files; Interpreter; Language execution; Language parsing; Long fields; Long records; Pattern matching language; Record reading; Recursive descent technique; TAWK", thesaurus = "C listings; Microcomputer applications; Program interpreters; Report generators", } @Article{Emmelmann:1989:BGE, author = "Helmut Emmelmann and Friedrich-Wilhelm Schr{\"o}er and Rudolf Landwehr", title = "{BEG}: a generator for efficient back ends", journal = j-SIGPLAN, volume = "24", number = "7", pages = "227--237", month = jul, year = "1989", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:41 MST 2003", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/pldi/73141/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/73141/p227-emmelmann/", abstract = "This paper describes a system that generates compiler back ends from a strictly declarative specification of the code generation process. The generated back ends use tree pattern matching for code selection. Two methods for register allocation supporting a wide range of target architectures are provided. A general bottom-up pattern matching method avoids problems that occurred with previous systems using LR-parsing. The performance of compilers using generated back ends is comparable to very fast production compilers. Some figures are given about the results of using the system to generate the back end of a Modula-2 compiler.", acknowledgement = ack-nhfb, affiliationaddress = "Karlsruhe, West Ger", annote = "Published as part of the Proceedings of PLDI'89.", classification = "723", conference = "Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Not", keywords = "algorithms; Compiler Generation; Computer Operating Systems; Computer Programming; languages; Optimizing Compilers; performance; Program Compilers", meetingaddress = "Portland, OR, USA", meetingdate = "Jun 21--23 1989", meetingdate2 = "06/21--23/89", sponsor = "ACM, Special Interest Group on Programming Languages, New York; SS NY, USA", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Parsing. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications, Modula-2. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Optimization.", } @Article{Fiala:1989:DCF, author = "E. R. Fiala and D. H. Greene", title = "Data Compression with Finite {Windows}", journal = j-CACM, volume = "32", number = "4", pages = "490--505", month = apr, year = "1989", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Sat Jan 26 12:46:16 MST 2013", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/datacompression.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/63341.html", acknowledgement = ack-ds # " and " # ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms; design; experimentation; theory", rawdata = "Fiala, E. R., and D. H. Greene (1989), ``Data Compression with Finite Windows,'' {\it Communications of the ACM}, {\bf32}(4):490--505.", review = "ACM CR 8910-0733", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf E.1}: Data, DATA STRUCTURES. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Computations on discrete structures. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", } @Article{Foster:1989:ALF, author = "M. J. Foster", title = "Avoiding latch formation in regular expression recognizers", journal = j-IEEE-TRANS-COMPUT, volume = "38", number = "5", pages = "754--756", month = may, year = "1989", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/12.24279", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Fri Jul 8 19:00:39 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=24279", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Ganapathi:1989:PBR, author = "Mahadevan Ganapathi", title = "{Prolog} based retargetable code generation", journal = j-COMP-LANGS, volume = "14", number = "3", pages = "193--204", month = "????", year = "1989", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Stanford Univ", affiliationaddress = "Stanford, CA, USA", classcodes = "C6150C (Compilers, interpreters and other processors); C1180 (Optimisation techniques)", classification = "722; 723", corpsource = "Comput. Sci. Lab., Stanford Univ., CA, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "back-end language; Code Generator Generators; code optimization; Code Optimization; compiler back end; Computer Operating Systems--Program Compilers; Computer Programming; formal specification; high quality code; implementation; optimisation; optimizing code generators; pattern matching; peephole optimization; program compilers; program processors; PROLOG; Prolog based retargetable code generation; Prolog Based Retargetable Code Generation; specification", treatment = "P Practical", } @Article{Ganapathi:1989:SPP, author = "Mahadevan Ganapathi", title = "Semantic predicates in parser generators", journal = j-COMP-LANGS, volume = "14", number = "1", pages = "25--33", month = "????", year = "1989", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Stanford, CA, USA", classcodes = "C6150C (Compilers, interpreters and other processors)", classification = "721; 723", corpsource = "Comput. Syst. Lab., Stanford Univ., CA, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "analysis; Attributed Parsing; Automata Theory--Grammars; compiler implementors; compiler-compilers; Computer Operating Systems; Conflict Resolution; decision making; Disambiguating Predicates; epsilon productions; grammars; parser generators; Parser Generators; parsers; pattern matching; Program Compilers; program compilers; Semantic Predicates; syntactic; vanilla parser", treatment = "P Practical", } @Article{Grossi:1989:SES, author = "R. Grossi and F. Luccio", title = "Simple and efficient string matching with $k$ mismatches", journal = j-INFO-PROC-LETT, volume = "33", number = "3", pages = "113--120", day = "30", month = nov, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25", MRnumber = "90m:68057", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ di Pisa", affiliationaddress = "Pisa, Italy", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithm Design; algorithm theory; Algorithms; computational complexity; Computer Programming; Mathematical Techniques--Trees; mismatches; permutations; String Matching; string matching; suffix tree; Suffix Trees", treatment = "T Theoretical or Mathematical", } @Misc{Haertel:1989:GG, author = "M. Haertel", title = "{GNU} {\tt e?grep}", volume = "17", howpublished = "Usenet archive {\tt comp.sources.unix}", month = feb, year = "1989", bibdate = "Sat Sep 02 14:45:09 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Hudak:1989:CEA, author = "Paul Hudak", title = "Conception, Evolution, and Application of Functional Programming Languages", journal = j-COMP-SURV, volume = "21", number = "3", pages = "359--411", month = sep, year = "1989", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/72551.72554", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:38:19 MDT 2008", bibsource = "ACM Computing Archive; Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Parallel/par.misc.bib; http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/72554.html", abstract = "The foundations of functional programming languages are examined from both historical and technical perspectives. Their evolution is traced through several critical periods: early work on lambda calculus and combinatory calculus, Lisp, Iswim, FP, ML, and modern functional languages such as Miranda and Haskell. The fundamental premises on which the functional programming methodology stands are critically analyzed with respect to philosophical, theoretical, and pragmatic concerns. Particular attention is paid to the main features that characterize modern functional languages: higher-order functions, lazy evaluation, equations and pattern matching, strong static typing and type inference, and data abstraction. In addition, current research areas --- such as parallelism, nondeterminism, input\slash output, and state-oriented computations --- are examined with the goal of predicting the future development and application of functional languages.", acknowledgement = ack-nhfb, affiliation = "Yale Univ", affiliationaddress = "New Haven, CT, USA", annote = "This is the second paper in the special issue which has a section on non-determinism [along with Bal, et al] which begins with a statement which would sound bizarre to non-programmers or those not familiar with the issues of determinacy.", classification = "723", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "ag; APL; Categories and Subject Descriptors: D.1.1 [Programming Techniques]: Applicative (Functional) Programming; Computer Programming Languages; D.3.2 [Programming Languages]: Language classifications - applicative languages; Data Abstraction; data-flow languages; denotative [declarative] language; F.4.1 [Mathematical Logic and Formal Languages]: Mathematical Logic - lambda calculus and related systems; FL; FP; Functional Programming Languages; grecommended91; Haskell; higher-order functions; Hope; Iswim; K.2 [History of Computing]: software General Terms: Languages; KRC; Lambda Calculus; Lambda Calculus, Additional Key Words and Phrases: Data abstraction; languages; lazy evaluation; Lisp; Miranda; ML; non-procedural languages; referential transparency; SASL; special issue on programming language paradigms; types; very-high-level languages", review = "ACM CR 9006-0486", subject = "{\bf D.1.1}: Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Lambda calculus and related systems. {\bf F.1.2}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism and concurrency. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Applicative languages.", } @Article{Jouvelot:1989:RPM, author = "P. Jouvelot and B. Dehbonei", title = "Recursive {Pattern Matching} on concrete data types", journal = j-SIGPLAN, volume = "24", number = "11", pages = "84--93", month = nov, year = "1989", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:47 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "algorithms; languages; theory", subject = "D.1.1 Software, PROGRAMMING TECHNIQUES, Applicative (Functional) Programming \\ D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Data types and structures \\ F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs \\ F.3.3 Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Program and recursion schemes \\ F.4.3 Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Formal Languages, Classes defined by grammars or automata", } @Article{Katajainen:1989:AAS, author = "J. Katajainen and T. Raita", title = "An approximation algorithm for space-optimal encoding of a text", journal = j-COMP-J, volume = "32", number = "3", pages = "228--237", month = jun, year = "1989", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/32.3.228", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:26 MST 2012", bibsource = "http://comjnl.oxfordjournals.org/content/32/3.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/32/3/228.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/228.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/229.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/230.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/231.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/232.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/233.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/234.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/235.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/236.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_32/Issue_03/tiff/237.tif", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Turku Univ., Finland", classcodes = "C6130D (Document processing techniques); C6120 (File organisation); C7250 (Information storage and retrieval); C1260 (Information theory)", classification = "C1260 (Information theory); C6120 (File organisation); C6130D (Document processing techniques); C7250 (Information storage and retrieval)", corpsource = "Dept. of Comput. Sci., Turku Univ., Finland", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "acyclic bandwidth limited network; Acyclic bandwidth limited network; approximation algorithm; Approximation algorithm; code book; Code book; compression; data compression; encoding; fixed dictionary; Fixed dictionary; fixed internal memory; Fixed internal memory; heuristic; information storage; linear working; Linear working storage; longest match; Longest match heuristic; often-occurring; Often-occurring substrings; optimisation; performance; Performance; running time; Running time; shortest path; Shortest path; space-optimal encoding; Space-optimal encoding; storage; storage management; storage space; Storage space; string matching algorithm; String matching algorithm; substrings; text; Text compression; vertex pair; Vertex pair", thesaurus = "Data compression; Encoding; Information storage; Optimisation; Storage management", treatment = "P Practical", } @Article{King:1989:UNN, author = "Todd King", title = "Using neural networks for pattern recognition", journal = j-DDJ, volume = "14", number = "1", pages = "14--28, 90--95", month = jan, year = "1989", CODEN = "DDJOEB", ISSN = "0888-3076", bibdate = "Tue Sep 10 09:30:19 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Neural/adapt.sys.bib", acknowledgement = ack-nhfb, affiliation = "California Univ., Berkeley, CA, USA", classification = "C1230 (Artificial intelligence); C1240 (Adaptive system theory); C1250 (Pattern recognition); C7430 (Computer engineering)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "C program; Called variation; Classification paradigm; Close approximations; Memorized patterns; Neural networks; Pattern associator; Pattern learning; Pattern matching; Pattern recognition", thesaurus = "C listings; Computerised pattern recognition; Microcomputer applications; Neural nets", } @Article{Knight:1989:UMS, author = "Kevin Knight", title = "Unification: a Multidisciplinary Survey", journal = j-COMP-SURV, volume = "21", number = "1", pages = "93--124", month = mar, year = "1989", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/62029.62030", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", MRclass = "68T15 (03B35 03B70 68N17)", MRnumber = "91g:68142", bibdate = "Thu Jun 19 09:37:55 MDT 2008", bibsource = "Compendex database; http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/62030.html", abstract = "The unification problem and several variants are presented. Various algorithms and data structures are discussed. Research on unification arising in several areas of computer science is surveyed; these areas include theorem proving, logic programming, and natural language processing. Sections of the paper include examples that highlight particular uses of unification and the special problems encountered. Other topics covered are resolution, higher order logic, the occur check, infinite terms, feature structures, equational theories, inheritance, parallel algorithms, generalization, lattices, and other applications of unification. The paper is intended for readers with a general computer science background --- no specific knowledge of any of the above topics is assumed.", acknowledgement = ack-nhfb, affiliation = "Carnegie-Mellon Univ", affiliationaddress = "Pittsburgh, PA, USA", classification = "721; 723", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", keywords = "algorithms; Artificial Intelligence; Computational Complexity; Computer Metatheory; Equational Theories; Feature Structures; Higher Order Logic; languages, Automata Theory; Logic Programming; Natural Language Processing; Theorem Proving", review = "ACM CR 9005-0423", subject = "{\bf I.2.3}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Deduction and Theorem Proving. {\bf I.1.3}: Computing Methodologies, ALGEBRAIC MANIPULATION, Languages and Systems, Substitution mechanisms. {\bf E.1}: Data, DATA STRUCTURES, Graphs. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.2.7}: Computing Methodologies, ARTIFICIAL INTELLIGENCE, Natural Language Processing.", } @InProceedings{Kosaraju:1989:ETP, author = "S. R. Kosaraju", title = "Efficient tree pattern matching", crossref = "IEEE:1989:ASF", pages = "178--183", year = "1989", bibdate = "Thu Apr 5 06:13:40 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Landau:1989:FPS, author = "Gad M. Landau and Uzi Vishkin", title = "Fast parallel and serial approximate string matching", journal = j-J-ALG, volume = "10", number = "2", pages = "157--169", month = jun, year = "1989", CODEN = "JOALDV", DOI = "https://doi.org/10.1016/0196-6774(89)90010-2", ISSN = "0196-6774 (print), 1090-2678 (electronic)", ISSN-L = "0196-6774", bibdate = "Tue Dec 11 09:14:52 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/jalg.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/0196677489900102", acknowledgement = ack-nhfb, fjournal = "Journal of Algorithms", journal-URL = "http://www.sciencedirect.com/science/journal/01966774", } @Article{Makinen:1989:SIP, author = "Erkki M{\"a}kinen", title = "On the subtree isomorphism problem for ordered trees", journal = j-INFO-PROC-LETT, volume = "32", number = "5", pages = "271--273", day = "22", month = sep, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 68P05 68Q25)", MRnumber = "90k:68139", MRreviewer = "Fabrizio Luccio", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See also comments \cite{Grossi:1991:FCS}.", acknowledgement = ack-nhfb, affiliation = "Univ of Tampere", affiliationaddress = "Tampere, Finl", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Tampere Univ., Finland", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; algorithms; Combinatorial Mathematics; Mathematical Techniques; Ordered Trees; ordered trees; Pattern Recognition; String Pattern Matching; string pattern matching; subtree isomorphism problem; theory; tree encoding; Tree Isomorphism; trees (mathematics); verification; Zaks Sequence", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Marola:1989:USD, author = "Giovanni Marola", title = "Using symmetry for detecting and locating objects in a picture", journal = j-CVGIP, volume = "46", number = "2", pages = "179--195", month = may, year = "1989", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Thu Feb 6 18:44:11 MST 1997", bibsource = "Compendex database; Graphics/rosenfeld/1989.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Istituto di Elettronica e Telecomunicazioni, Pisa Univ., Italy", affiliationaddress = "Pisa, Italy", classification = "723; B6140C (Optical information and image processing); C1250 (Pattern recognition); C5260B (Computer vision and picture processing)", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "Algorithm; Image Processing; Local symmetry; Noise insensitive, image part form; Object Detection; Object detection; Object Detection; Object Location; Object location; Object Location; Object Recognition; Overlapping Objects; Overlapping objects; Overlapping Objects; Pattern Recognition; Picture; Planar images; Symmetry detection; Template matching procedure; Unscaled intensity images", thesaurus = "Computerised pattern recognition; Computerised picture processing", } @Article{Menico:1989:FSS, author = "Costas Menico", title = "Faster string searches ({Boyer--Moore} algorithm)", journal = j-DDJ, volume = "14", number = "7", pages = "74--75, 98--99", month = jul, year = "1989", CODEN = "DDJOEB", ISSN = "0888-3076", bibdate = "Tue Sep 10 09:30:19 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/dr-dobbs-1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Software Bottling Co., Maspeth, NY, USA", classification = "C6130D (Document processing techniques)", keywords = "Boyer--Moore algorithm; Brute force method; Hybrid algorithm; Pattern analysis; String searches", thesaurus = "Assembly language listings; Computerised pattern recognition; Pascal listings; Search problems", } @Article{Mischel:1989:WAE, author = "James Mischel", title = "Writing {AWK}-like extensions to {C}", journal = j-DDJ, volume = "14", number = "6", pages = "64--66, 68, 70, 94, 96, 98, 103--104", month = jun, year = "1989", CODEN = "DDJOEB", ISSN = "0888-3076", bibdate = "Tue Sep 10 09:30:19 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/dr-dobbs-1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", keywords = "AWK programming language; AWK-like extensions; AWKLIB get-line() function; C; Fields; Global variables; Implicit processing loop; Match; Program status; Regular expression; String search functions; Substrings", thesaurus = "C listings; Complete computer programs; High level languages; Programming", } @Article{Mischel:1989:WAL, author = "James Mischel", title = "Writing {AWK}-like extensions to {C}", journal = j-DDJ, volume = "14", number = "6", pages = "64--66, 68, 70, 94, 96, 98, 103--104", month = jun, year = "1989", CODEN = "DDJOEB", ISSN = "0888-3076", bibdate = "Tue Sep 10 09:30:19 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C6110 (Systems analysis and programming); C6140D (High level languages)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "AWK programming language; AWK-like extensions; AWKLIB get-line() function; C; Fields; Global variables; Implicit processing loop; Match; Program status; Regular expression; String search functions; Substrings", thesaurus = "C listings; Complete computer programs; High level languages; Programming", } @Article{Myers:1989:AMR, author = "Eugene W. Myers and Webb Miller", title = "Approximate matching of regular expressions", journal = j-BULL-MATH-BIOL, volume = "51", number = "1", pages = "5--37", month = jan, year = "1989", CODEN = "BMTBAP", DOI = "https://doi.org/10.1007/BF02458834", ISSN = "0092-8240 (print), 1522-9602 (electronic)", ISSN-L = "0092-8240", bibdate = "Wed Jun 28 16:16:14 MDT 2017", bibsource = "https://www.math.utah.edu/pub/tex/bib/bullmathbiol.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://link.springer.com/article/10.1007/BF02458834", acknowledgement = ack-nhfb, fjournal = "Bulletin of Mathematical Biology", journal-URL = "http://link.springer.com/journal/11538", } @Article{Ophel:1989:IMR, author = "John Ophel", title = "An improved mixture rule for pattern matching", journal = j-SIGPLAN, volume = "24", number = "6", pages = "91--96", month = jun, year = "1989", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:40 MST 2003", bibsource = "Compendex database; http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "An improved mixture rule for compiling the pattern matching mechanism used in function definitions for ML, Miranda and Hope is presented. The new rule produces better code for patterns with mixed constructors and variables in multiple columns.", acknowledgement = ack-nhfb, affiliationaddress = "Canberra, Aust", classification = "723", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Not", keywords = "Computer Operating Systems; Computer Programming Languages; design; Hope Language; languages; Miranda Language; ML Language; Pattern Matching; Pattern Recognition; Program Compilers; standardization", subject = "D.3.3 Software, PROGRAMMING LANGUAGES, Language Constructs, Procedures, functions, and subroutines \\ D.3.4 Software, PROGRAMMING LANGUAGES, Processors, Compilers", } @Article{Padberg:1989:CMB, author = "Manfred Padberg and Antonio Sassano", title = "The complexity of matching with bonds", journal = j-INFO-PROC-LETT, volume = "32", number = "6", pages = "297--300", day = "3", month = oct, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q25 (05C70 68R10)", MRnumber = "90j:68020", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "New York Univ", affiliationaddress = "New York, NY, USA", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Graduate Sch. of Bus. Adm., New York Univ., NY, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "bond structure; cardinality; complexity; Computational Complexity; computational complexity; Computer Metatheory--Computability and Decidability; cycle; disjoint subsets; edges; finite; Graph Theory; graph theory; loopless graph; matching with bonds; Mathematical Techniques; maximum-weight matching; MB; nonempty; NP-hard problem; Restricted Matching Problems; set theory; theory; undirected; union; verification", subject = "G.2.2 Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory \\ F.1.3 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Complexity Classes \\ F.2.2 Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching", treatment = "T Theoretical or Mathematical", } @Article{Rytter:1989:NOP, author = "Wojciech Rytter", title = "A note on optimal parallel transformations of regular expressions to nondeterministic finite automata", journal = j-INFO-PROC-LETT, volume = "31", number = "2", pages = "103--109", day = "26", month = apr, year = "1989", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q45", MRnumber = "90k:68094", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliationaddress = "Coventry, Engl", classification = "721; 723; C4220 (Automata theory); C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Warwick Univ., Coventry, UK", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithms; Automata Theory; Computer Systems, Digital--Parallel Processing; Finite Automata; finite automata; homomorphism; log n time; Nondeterministic Finite Automata; nondeterministic finite automata; optimal parallel transformations; parallel algorithms; Parallel Random Access Machines; parallel random-access machine; Parallel Transformations; recursive construction; Regular Expressions; regular expressions; theory; verification", subject = "F.1.1 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation, Automata \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Parallelism \\ F.1.2 Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Modes of Computation, Alternation and nondeterminism \\ E.1 Data, DATA STRUCTURES, VAX/VMS", treatment = "T Theoretical or Mathematical", } @Article{Statman:1989:SSC, author = "R. Statman", title = "On sets of solutions to combinator equations", journal = j-THEOR-COMP-SCI, volume = "66", number = "1", pages = "99--104", day = "2", month = aug, year = "1989", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:29:49 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1985.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition)", corpsource = "Dept. of Math., Carnegie-Mellon Univ., Pittsburgh, PA, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "beta -conversion; combinator equations; combinatorial mathematics; pattern matching; pattern recognition; sets of solutions", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Walker:1989:FCP, author = "Kenneth W. Walker", title = "First-class patterns for {Icon}", journal = j-COMP-LANGS, volume = "14", number = "3", pages = "153--163", month = "????", year = "1989", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Arizona", affiliationaddress = "Tucson, AZ, USA", classcodes = "C6140D (High level languages); C6130D (Document processing techniques)", classification = "723", corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "backtracking; coexpression semantics; Computer Programming Languages; constructs; control structure; dynamically created; entities; executable form; high level languages; Icon Programming Language; Icon programming language; interpreters; language; Language Constructs; matching expressions; modifications; pattern data type; pattern simulation; problem solving; procedure syntax; Snobol Programming Language; SNOBOL4; String Pattern Matching; string pattern matching", treatment = "P Practical", } @Article{Wood:1989:IFS, author = "P. Wood and D. Turcaso", title = "Implementing a Faster String Search Algorithm in {Ada}", journal = j-SIGADA-LETTERS, volume = "8", number = "3", pages = "87--97", month = may # "\slash " # jun, year = "1989", CODEN = "AALEE5", ISSN = "1094-3641 (print), 1557-9476 (electronic)", ISSN-L = "1094-3641", bibdate = "Thu Sep 28 07:33:23 MDT 2000", bibsource = "ftp://ftp.uu.net/library/bibliography; http://www.adahome.com/Resources/Bibliography/articles.ref; https://www.math.utah.edu/pub/tex/bib/sigada.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", fjournal = "ACM SIGAda Ada Letters", journal-URL = "https://dl.acm.org/loi/sigada", } @Article{Yasuda:1989:PAM, author = "Takuya Yasuda and Satoshi Igarashi and Oichi Atoda and Nobuo Saito", title = "`{Pattern} associative memory' and its use in logic programming language processors", journal = j-SYS-COMP-JAPAN, volume = "20", number = "11", pages = "11--20", month = nov, year = "1989", CODEN = "SCJAEP", ISSN = "0882-1666 (print), 1520-684X (electronic)", ISSN-L = "0882-1666", bibdate = "Thu Oct 31 17:45:50 2002", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The traditional speed improvement of the logic language processing system has been based on the parallelism of clauses, and aimed at speeding up of the unification. However, there can be another approach. By introducing a specific function to the memory hardware, the database can be managed independently of the host CPU. Then the speed is improved by minimizing the data traffic through the von Neumann bottleneck in the retrieval of candidate clauses. This paper proposes a pattern associative memory (PAM) which maintains the clauses by the structural representation in it and retrieves them by pattern matching with a high speed. To make use of argument parallelism of clauses, parallel hashing is adopted in PAM.", acknowledgement = ack-nhfb, affiliation = "Tokyo Univ of Agriculture and Technology", affiliationaddress = "Koganei, Jpn", classification = "722; 723; 922", fjournal = "Systems and computers in Japan", journalabr = "Syst Comput Jpn", keywords = "Associative; Candidate Clause Retrieval; Computer Systems, Digital --- Parallel Processing; Data Storage, Digital; Database Systems; Garbage Collection; Hash Table; Hashing Processor; Logic Language Processing; Pattern Associative Memory; Probability", } @Article{Zetzsche:1989:IPR, author = "Christoph Zetzsche and Terry Caelli", title = "Invariant pattern recognition using multiple filter image representations", journal = j-CVGIP, volume = "45", number = "2", pages = "251--262", month = feb, year = "1989", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Thu Feb 6 18:44:11 MST 1997", bibsource = "Compendex database; Graphics/rosenfeld/1989.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Lehrstuhl fur Nachrichtentechnik, Tech. Univ., Munich, West Germany", affiliationaddress = "Munich, West Germany", classification = "723; C1250 (Pattern recognition); C5260B (Computer vision and picture processing)", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "4-Dimensional representation; Correlation processes; Cross correlation; Encoding scheme; Image Decomposition; Image decompositions; Image positional information; Image Processing; Invariant Pattern Recognition; Invariant pattern recognition; Matched filtering; Multiple Filter Image Representations; Multiple filter image representations; Pattern Matching; Pattern Recognition; Pattern rotations; Recognition system, (image transformation, form); Scale changes; Signal Filtering and Prediction; Translations", thesaurus = "Correlation methods; Filtering and prediction theory; Pattern recognition", } @Article{Zhu:1989:TTD, author = "Rui Feng Zhu and Tadao Takaoka", title = "A Technique for Two-Dimensional Pattern Matching", journal = j-CACM, volume = "32", number = "9", pages = "1110--1120", month = sep, year = "1989", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu May 30 09:41:10 MDT 1996", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/cacm1980.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/66459.html", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms; design; image multiplicity comparison; performance", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.5.4}: Computing Methodologies, PATTERN RECOGNITION, Applications, Text processing.", } @Article{Arcangeli:1990:PPP, author = "J.-P. Arcangeli and C. Pomian", title = "Principles of plasma pattern and alternative structure compilation", journal = j-THEOR-COMP-SCI, volume = "71", number = "2", pages = "177--191", day = "30", month = mar, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C6150C (Compilers, interpreters and other processors)", conflocation = "Nice, France; 23-25 Feb. 1988", conftitle = "INFORMATIKA 88. 2nd French-Soviet Workshop on Methods of Compilation and Program Construction", corpsource = "Lab. Langages et Syst. Inf., Univ. Paul Sabatier, Toulouse, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "alternative structure compilation; backtracking; formal model; message parsing; pattern codes; pattern matching; plasma pattern; program compilers; simple jumps; single pass compiler; syntax", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Balachandran:1990:ERC, author = "A. Balachandran and D. M. Dhamdhere and S. Biswas", title = "Efficient retargetable code generation using bottom-up tree pattern matching", journal = j-COMP-LANGS, volume = "15", number = "3", pages = "127--140", month = "????", year = "1990", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Indian Inst of Technology", affiliationaddress = "Bombay, India", classcodes = "C6150C (Compilers, interpreters and other processors); C4210 (Formal logic)", classification = "722; 723", corpsource = "Indian Inst. of Technol., Bombay, India", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "attributed production rules; automatic code generation; bottom-up tree pattern; Code Generation; compression; Computer Operating Systems--Program Compilers; Computer Programming Languages; cost; derivation; expression trees; folding technique; Graham Glanville style; grammars; information; matching; matching automaton; minimum cost; optimal instruction; Pattern Matching; program compilers; regular tree grammar; retargetable code generation; selection; table; target machine instructions", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Barrett:1990:RGA, author = "Robert Barrett", title = "References On {\tt grep}, {\tt awk}, {\tt sed}, and {\tt tr}", journal = j-CUJ, volume = "8", type = "Letter", number = "3", pages = "138--??", month = mar, year = "1990", ISSN = "0898-9788", bibdate = "Fri Aug 30 16:52:23 MDT 1996", bibsource = "http://www.cuj.com/cbklist.htm; https://www.math.utah.edu/pub/tex/bib/cccuj.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Bertossi:1990:SMW, author = "A. A. Bertossi and F. Luccio and E. Lodi and L. Pagli", title = "String matching with weighted errors", journal = j-THEOR-COMP-SCI, volume = "73", number = "3", pages = "319--328", day = "22", month = jul, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "computational complexity; parallel algorithms; parallel time; PRAM model; sequential time; string matching problem; weighted differences; weighted errors", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Bradford:1990:SMB, author = "James H. Bradford", title = "Sequence matching with binary codes", journal = j-INFO-PROC-LETT, volume = "34", number = "4", pages = "193--196", day = "24", month = apr, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Brock Univ", affiliationaddress = "St. Catharines, Ont, Can", classification = "723; B6120B (Codes); C1250 (Pattern recognition); C1260 (Information theory)", corpsource = "Dept. of Comput. Sci., Brock Univ., St. Catharines, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; Algorithms; Binary Codes; binary codes; binary codewords; binary numbers; Codes, Symbolic; Computer Metatheory--Computability and Decidability; Computer Programming; error correction codes; Hamming Distance; Hamming distance; Levenshtein Distance; Levenshtein distance; pattern recognition; Sequence Matching; sequence matching; string pairs; String Similarity; string similarity; String-To-String Editing Problem", treatment = "T Theoretical or Mathematical", } @Article{Breslauer:1990:OTP, author = "Dany Breslauer and Zvi Galil", title = "An optimal {$ O(\log \log n) $} time parallel string matching algorithm", journal = j-SIAM-J-COMPUT, volume = "19", number = "6", pages = "1051--1058", month = dec, year = "1990", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q25 (68R15)", MRnumber = "91m:68074", bibdate = "Mon Nov 29 11:01:39 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/19/6; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @InProceedings{Chang:1990:ASM, author = "W. I. Chang and E. L. Lawler", title = "Approximate string matching in sublinear expected time", crossref = "IEEE:1990:PAS", volume = "1", pages = "116--124", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Cohen:1990:CLP, author = "Jacques Cohen", title = "Constraint logic programming languages", journal = j-CACM, volume = "33", number = "7", pages = "52--68", month = jul, year = "1990", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu May 30 09:41:10 MDT 1996", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Misc/IMMD_IV.bib; http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/79209.html", abstract = "Constraint Logic Programming (CLP) is an extension of Logic Programming aimed at replacing the pattern matching mechanism of unification, as used in Prolog, by a more general operation called constraint satisfaction. This article provides a panoramic view of the recent work done in designing and implementing CLP languages. It also presents a summary of their theoretical foundations, discusses implementation issues, compares the major CLP languages, and suggests directions for further work.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "design; languages", subject = "{\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Logic programming. {\bf F.4.1}: Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Mathematical Logic, Prolog. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @TechReport{Cole:1990:TBC, author = "R. Cole", title = "Tight bounds on the complexity of the {Boyer--Moore} pattern matching algorithm", type = "Report", number = "512", institution = "Computer Science Dept, New York University", address = "New York, NY, SA", month = jun, year = "1990", bibdate = "Sat Sep 02 14:28:37 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @InProceedings{Colussi:1990:ECS, author = "L. Colussi and Z. Galil and R. Giancarlo", title = "On the exact complexity of string matching", crossref = "IEEE:1990:PAS", volume = "1", pages = "135--144", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @InProceedings{Consens:1990:GVF, author = "Mariano P. Consens and Alberto O. Mendelzon", title = "{GraphLog}: a visual formalism for real life recursion", crossref = "ACM:1990:PPN", pages = "404--416", year = "1990", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; https://www.math.utah.edu/pub/tex/bib/pods.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/pods/298514/p404-consens/p404-consens.pdf; http://www.acm.org/pubs/citations/proceedings/pods/298514/p404-consens/", abstract = "We present a query language called GraphLog, based on a graph representation of both data and queries. Queries are graph patterns. Edges in queries represent edges or paths in the database. Regular expressions are used to qualify these paths. We characterize the expressive power of the language and show that it is equivalent to stratified linear Datalog, first order logic with transitive closure, and non-deterministic logarithmic space (assuming ordering on the domain). The fact that the latter three classes coincide was not previously known. We show how GraphLog can be extended to incorporate aggregates and path summarization, and describe briefly our current prototype implementation.", acknowledgement = ack-nhfb, classification = "C6140D (High level languages); C6160Z (Other DBMS)", corpsource = "Comput. Syst. Res. Inst., Toronto Univ., Ont., Canada", keywords = "database management systems; edges; expressive power; first order logic; graph representation; graph theory; GraphLog; path summarization; paths; query language; query languages; real life recursion; transitive closure; visual formalism", sponsororg = "SIGACT; SIGMOD; SIGART", treatment = "P Practical", } @Book{Cormen:1990:IA, author = "Thomas H. Cormen and Charles E. (Eric) Leiserson and Ronald L. Rivest", title = "Introduction to Algorithms", publisher = pub-MIT, address = pub-MIT:adr, pages = "xvii + 1028", year = "1990", ISBN = "0-262-03141-8, 0-07-013143-0 (McGraw-Hill)", ISBN-13 = "978-0-262-03141-7, 978-0-07-013143-9 (McGraw-Hill)", LCCN = "QA76.6 .C662 1990", bibdate = "Tue Oct 11 06:42:43 2005", bibsource = "https://www.math.utah.edu/pub/bibnet/subjects/acc-stab-num-alg.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, libnote = "Not yet in my library.", subject = "Computer programming; Computer algorithms", tableofcontents = "Growth of functions \\ Summations \\ Recurrences \\ Sets, etc. \\ Counting and probability \\ Heapsort \\ Quicksort \\ Sorting in linear time \\ Medians and order statistics \\ Elementary data structures \\ Hash tables \\ Binary search trees \\ Red-black trees \\ Augmenting data structures \\ Dynamic programming \\ Greedy algorithms \\ Amortized analysis \\ B-trees \\ Binomial heaps \\ Fibonacci heaps \\ Data structures for disjoint sets \\ Elementary graph algorithms \\ Minimum spanning trees \\ Single-source shortest paths \\ All-pairs shortest paths \\ Maximum flow \\ Sorting networks \\ Arithmetic circuits \\ Algorithms for parallel computers \\ Matrix operations \\ Polynomials and the FFT \\ Number-theoretic algorithms \\ String matching \\ Computational geometry \\ NP-completeness \\ Approximation algorithms", } @InProceedings{Dubiner:1990:FTP, author = "M. Dubiner and Z. Galil and E. Magen", title = "Faster tree pattern matching", crossref = "IEEE:1990:PAS", volume = "1", pages = "145--150", year = "1990", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Galil:1990:IAA, author = "Zvi Galil and Kunsoo Park", title = "An Improved Algorithm for Approximate String Matching", journal = j-SIAM-J-COMPUT, volume = "19", number = "6", pages = "989--999", month = dec, year = "1990", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q20 (68Q25 68U15)", MRnumber = "92c:68062", MRreviewer = "Linda Pagli", bibdate = "Mon Nov 29 11:01:39 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/19/6; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Giegerich:1990:CSI, author = "R. Giegerich", title = "Code selection by inversion of order-sorted derivors", journal = j-THEOR-COMP-SCI, volume = "73", number = "2", pages = "177--211", day = "22", month = jun, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Tech. Fak., Bielefeld Univ., West Germany", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "code selection problem; code selector specification; completeness; expressive power; formal criteria; hierarchic derivor; high level languages; intermediate languages; inversion; nonsyntactic subtasks; order-sorted derivors; order-sorted term algebras; pattern matching; programming theory", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @InProceedings{Glueck:1990:AMT, author = "R. Glueck and V. F. Turchin", title = "Application of metasystem transition to function inversion and transformation", crossref = "Watanabe:1990:IPI", pages = "286--287", year = "1990", bibdate = "Thu Mar 12 08:36:58 MST 1998", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/issac.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/96877/p286-glueck/", abstract = "The authors prove by construction an application considered theoretically by Turchin (1972) that self-application of metacomputation will allow the automatic construction of inverse algorithms, in particular the algorithm of binary subtraction from the algorithm of binary addition. Further, they present results concerning the algorithmic construction of an efficient pattern matcher, which leads to the Knuth, Morris and Pratt algorithm. These results were achieved with the first working model of a self-applicable supercompiler system, implementing the concept of metacomputation.", acknowledgement = ack-nhfb, affiliation = "Univ. of Technol. Vienna, Austria", classification = "C4240 (Programming and algorithm theory)", keywords = "Algorithmic construction; algorithms; Function inversion; Inverse algorithms; Metacomputation; Metasystem transition; Pattern matcher; theory; Transformation; verification", subject = "{\bf G.1.0} Mathematics of Computing, NUMERICAL ANALYSIS, General, Computer arithmetic. {\bf I.1.0} Computing Methodologies, SYMBOLIC AND ALGEBRAIC MANIPULATION, General. {\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", thesaurus = "Algorithm theory; Computation theory; Symbol manipulation", } @Article{Goldschlag:1990:MVC, author = "D. M. Goldschlag", title = "Mechanically verifying concurrent programs with the {Boyer--Moore} prover", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "16", number = "9", pages = "1005--1023", month = sep, year = "1990", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/32.58787", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 11:00:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=58787", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @Article{Gonnet:1990:AKR, author = "Gaston H. Gonnet and Ricardo A. Baeza-Yates", title = "An analysis of the {Karp-Rabin} string matching algorithm", journal = j-INFO-PROC-LETT, volume = "34", number = "5", pages = "271--274", day = "7", month = may, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "We present an average case analysis of the Karp-Rabin string matching algorithm. This algorithm is a probabilistic algorithm that adapts hashing techniques to string searching. We also propose an efficient implementation of this algorithm.", acknowledgement = ack-nhfb, affiliation = "Univ of Waterloo", affiliationaddress = "Waterloo, Ont, Canada", classification = "723; 922; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; average case analysis; Computer Programming; Hashing; hashing techniques; Karp-Rabin Algorithm; Karp-Rabin string matching algorithm; pattern recognition; probabilistic algorithm; Probability; search problems; String Matching; String Searching", treatment = "T Theoretical or Mathematical", } @Article{Gonnet:1990:AKS, author = "Gaston H. Gonnet and Ricardo A. Baeza-Yates", title = "An analysis of the {Karp-Rabin} string matching algorithm", journal = j-INFO-PROC-LETT, volume = "34", number = "5", pages = "271--274", day = "7", month = may, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "We present an average case analysis of the Karp-Rabin string matching algorithm. This algorithm is a probabilistic algorithm that adapts hashing techniques to string searching. We also propose an efficient implementation of this algorithm.", acknowledgement = ack-nhfb, affiliation = "Univ of Waterloo", affiliationaddress = "Waterloo, Ont, Canada", classification = "723; 922; C4240 (Programming and algorithm theory)", corpsource = "Dept. of Comput. Sci., Waterloo Univ., Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190/", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; average case analysis; Computer Programming; Hashing; hashing techniques; Karp-Rabin Algorithm; Karp-Rabin string matching algorithm; pattern recognition; probabilistic algorithm; Probability; search problems; String Matching; String Searching", treatment = "T Theoretical or Mathematical", } @Article{Guenther:1990:EEF, author = "G. R. Guenther", title = "Efficient expansion of factored expressions", journal = j-INFO-PROC-LETT, volume = "35", number = "2", pages = "69--72", day = "29", month = jun, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Laurentian Univ", affiliationaddress = "Sudbury, Ont, Can", classification = "723; C4210 (Formal logic); C4240 (Programming and algorithm theory); C6140D (High level languages)", corpsource = "Dept. of Math. and Comput. Sci., Laurentian Univ., Sudbury, Ont., Canada", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Computer Programming --- Algorithms; Computer Programming Languages; Factored Expressions; factored expressions; formal languages; generator; high level languages; iterator; Iterators; programming theory; Regular Expressions; regular expressions; Theory", treatment = "P Practical; T Theoretical or Mathematical", } @TechReport{Harrison:1990:CAV, author = "Luddy Harrison and Zahira Ammarguellat", title = "A comparison of automatic versus manual parallelization of the {Boyer--Moore} theorem prover", number = "CSRD 960", institution = inst-UIUC-CSRD, address = inst-UIUC-CSRD:adr, pages = "17", year = "1990", bibdate = "Fri Aug 30 08:01:51 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/super.bib", abstract = "In this paper, we compare the manual parallelization of the Boyer--Moore theorem prover [Gab85] using the constructs of Multiplisp [Hal85] and Qlisp [GGS89], with the automatic parallelization of the same program using the Parcel compiler [Har89]. boyer is popular as a Lisp benchmark because it performs a significant and representative computation; its structure makes it interesting for studying manual and automatic parallelization as well. We will compare the parallelism that results from a straightforward hand-parallelization of the theorem prover using future and qlet, with that introduced by Parcel. We find the most significant parallelism within the theorem prover is easily expressed using future or qlet, and that this same parallelism is automatically uncovered by the Parcel compiler. There is in boyer some producer-consumer parallelism that can be expressed using future or qlet, that is not exploited by Parcel. On the other hand, we show that Parcel is able to deduce the lifetimes of dynamically allocated objects, and on this basis to guide the management of a hierarchical memory, whereas there is no provision for the management of such a memory in either Multilisp or Qlisp.", acknowledgement = ack-nhfb, annote = "To appear in Monographs in Parallel and Distributed Computing, Chris Jesshope and Dave Klappholz, eds., Pitman Publishing, 1990. Supported in part by the National Science Foundation. Supported in part by the U.S. Department of Energy. Supported in part by the Office of Naval Research. Supported in part by the Air Force Office of Scientific Research.", keywords = "Automatic theorem proving; Parallel processing (Electronic computers)", } @Article{Hashiguchi:1990:ERE, author = "K. Hashiguchi and H. Yoo", title = "Extended regular expressions of star degree at most two", journal = j-THEOR-COMP-SCI, volume = "76", number = "2-3", pages = "273--284", day = "21", month = nov, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "closure; concatenation; context-free languages; extended regular expressions; finite languages; formal languages; Kleene star; star degree; star operator; subfamily; union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Hendren:1990:PPR, author = "Laurie J. Hendren and Alexandru Nicolau", title = "Parallelizing programs with recursive data structures", journal = j-IEEE-TRANS-PAR-DIST-SYS, volume = "1", number = "1", pages = "35--47", month = jan, year = "1990", CODEN = "ITDSEO", ISSN = "1045-9219 (print), 1558-2183 (electronic)", ISSN-L = "1045-9219", bibdate = "Fri Apr 11 15:20:39 MDT 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/ieeetranspardistsys.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Cornell Univ, Dep of Comput Sci, Ithaca, NY, USA", classification = "722; 723; C4240 (Programming and algorithm theory); C6120 (File organisation); C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA", fjournal = "IEEE Transactions on Parallel and Distributed Systems", journal-URL = "http://www.computer.org/tpds/archives.htm", journalabr = "IEEE Trans Parallel Distrib Syst", keywords = "accessible nodes; automatic parallelization; Computer Operating Systems; Computer Systems, Digital--Parallel Processing; Data Processing--Data Structures; data structures; directed acyclic graphs; directed graphs; disambiguation techniques; dynamic data structures; dynamically updatable trees; imperative; imperative programs; interference; interference analysis; language; parallel programming; parallel programming languages; parallelization techniques; parallelizing compilers; Parallelizing Compilers; Program Compilers; program compilers; Recursive Data Structures; recursive data structures; regular-expression-like representation; tools; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Henry:1990:UWI, author = "Robert R. Henry and Kenneth M. Whaley and Bruce Forstall", title = "The {University} of {Washington} illustrating compiler", journal = j-SIGPLAN, volume = "25", number = "6", pages = "223--233", month = jun, year = "1990", CODEN = "SINODQ", ISBN = "0-89791-364-7", ISBN-13 = "978-0-89791-364-5", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:15:53 MST 2003", bibsource = "Compendex database; http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/pldi/93542/index.html; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/pldi/93542/p223-henry/", abstract = "The University of Washington illustrating compiler (UWPI) automatically illustrates the data structures used in simple programs written in a subset of Pascal${}^2$. A UWPI user submits a program to UWPI, and can then watch a graphical display show time varying illustrations of the data structures and program source code. UWPI uses the information latent in the program to determine how to illustrate the program. UWPI infers the abstract data types directly from the declarations and operations used in the source program, and then lays out the illustration in a natural way by instantiating well-known layouts for the abstract types. UWPI solves program illustration using compile-time pattern matching and type inferencing to link anticipated execution events to display events, rather than relying on user assistance or specialized programming techniques. UWPI has been used to automatically illustrate didactic sorting and searching examples, and can be used to help teach basic data structures, or to help when debugging programs.", acknowledgement = ack-nhfb, affiliation = "Univ of Washington", affiliationaddress = "Seattle, WA, USA", annote = "Published as part of the Proceedings of PLDI'90.", classification = "722; 723", conference = "Proceedings of the ACM SIGPLAN '90 Conference on Programming Language Design and Implementation", conferenceyear = "1990", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", journalabr = "SIGPLAN Not", keywords = "Computer Operating Systems; Computer Programming Languages --- pascal; Data Processing --- Data Structures; design; Program Compilers; reliability; University of Washington Illustrating Compiler (UWPI)", meetingaddress = "White Plains, NY, USA", meetingdate = "Jun 20--22 1990", meetingdate2 = "06/20--22/90", sponsor = "Assoc for Computing Machinery, Special Interest Group on Programming Languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Data types and structures. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Abstract data types. {\bf D.2.2} Software, SOFTWARE ENGINEERING, Design Tools and Techniques, User interfaces. {\bf D.2.5} Software, SOFTWARE ENGINEERING, Testing and Debugging, Debugging aids. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory.", } @TechReport{Hume:1990:FSS, author = "Andrew Hume and Daniel Sunday", title = "Fast String Searching", type = "Computing Science Technical Report", number = "156", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "??", year = "1990", bibdate = "Sat Sep 02 07:46:26 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", acknowledgement = ack-nhfb, remark = "Published in \cite{Hume:1991:FSS}. No electronic form of this report has yet been located, so the year is uncertain.", } @Article{Isenman:1990:PAI, author = "M. E. Isenman and D. E. Shasha", title = "Performance and architectural issues for string matching", journal = j-IEEE-TRANS-COMPUT, volume = "39", number = "2", pages = "238--250", month = feb, year = "1990", CODEN = "ITCOB4", DOI = "https://doi.org/10.1109/12.45209", ISSN = "0018-9340 (print), 1557-9956 (electronic)", ISSN-L = "0018-9340", bibdate = "Thu Jul 7 14:19:59 MDT 2011", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranscomput1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=45209", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Computers", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=12", } @Article{Janicki:1990:TSS, author = "R. Janicki and T. Muldner", title = "Transformations of sequential specifications into concurrent specifications by synchronization guards", journal = j-THEOR-COMP-SCI, volume = "77", number = "1-2", pages = "97--129", day = "07", month = dec, year = "1990", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4240 (Programming and algorithm theory); C6110B (Software engineering techniques)", conflocation = "Iowa City, IA, USA; 22-24 May 1989", conftitle = "International Conference on Algebraic Methodology and Software Technology, AMAST", corpsource = "Dept. of Comput. Sci. and Syst., McMaster Univ., Hamilton, Ont., Canada", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "Banach; concurrent specifications; formal specification; high level languages; parallel programming; Pascal; Pascal-like language; programming language representation; programming theory; regular expression; sequential specifications; special actions; synchronisation; synchronization guards; transformations", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Jokinen:1990:PTA, author = "M. O. Jokinen", title = "Parameter Transmission Abstractions", journal = j-COMP-J, volume = "33", number = "2", pages = "133--139", month = apr, year = "1990", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/33.2.133", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:28 MST 2012", bibsource = "http://comjnl.oxfordjournals.org/content/33/2.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/33/2/133.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/133.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/134.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/135.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/136.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/137.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/138.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_02/tiff/139.tif", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci., Turku Univ., Finland", classcodes = "C6140D (High level languages); C6110 (Systems analysis and programming); C6120 (File organisation)", classification = "C6110 (Systems analysis and programming); C6120 (File organisation); C6140D (High level languages)", corpsource = "Dept. of Comput. Sci., Turku Univ., Finland", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "computational linguistics; conventional; Conventional parameter transmission mechanisms; copying; Copying; data structures; default values; Default values; high level; implicit actions; Implicit actions; languages; linguistic mechanism; Linguistic mechanism; optional parameters; Optional parameters; parameter binding; parameter transmission abstractions; Parameter transmission abstractions; parameter transmission mechanisms; pattern recognition; pattern-matching based; Pattern-matching based parameter binding; programming; programming languages; Programming languages; type conversions; Type conversions", thesaurus = "Computational linguistics; Data structures; High level languages; Pattern recognition; Programming", treatment = "P Practical", } @Article{Kuo:1990:NSC, author = "R. T. Kuo and S. S. Tseng", title = "The necessary and sufficient condition for the worst-case male optimal stable matching", journal = j-INFO-PROC-LETT, volume = "34", number = "5", pages = "261--263", day = "7", month = may, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Natl Chiao Tung Univ", affiliationaddress = "Hsinchu, Taiwan", classification = "723; C4240 (Programming and algorithm theory); C4250 (Database theory)", corpsource = "National Chiao Tung Univ., Hsinchu, Taiwan", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Algorithms; Computer Programming; database theory; pattern recognition; probability; search problems; sequential stable matching problem; Stable Matching Problem; worst-case male optimal stable matching", treatment = "T Theoretical or Mathematical", } @Article{Lee:1990:HSC, author = "Peizong Lee and Zvi M. Kedem", title = "On High-Speed Computing with a Programmable Linear Array", journal = j-J-SUPERCOMPUTING, volume = "4", number = "3", pages = "223--249", month = sep, year = "1990", CODEN = "JOSUED", DOI = "https://doi.org/10.1007/BF00127833", ISSN = "0920-8542 (print), 1573-0484 (electronic)", ISSN-L = "0920-8542", bibdate = "Wed Jul 6 11:13:02 MDT 2005", bibsource = "ftp://ftp.ira.uka.de/pub/Parallel/JOURNAL.SUPER.bib; http://springerlink.metapress.com/openurl.asp?genre=issue&issn=0920-8542&volume=4&issue=3; https://www.math.utah.edu/pub/tex/bib/jsuper.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.springerlink.com/openurl.asp?genre=article&issn=0920-8542&volume=4&issue=3&spage=223", acknowledgement = ack-nhfb, affiliation = "Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan", classification = "B1265B (Logic circuits); C5220 (Computer architecture)", corpsource = "Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan", fjournal = "The Journal of Supercomputing", journal-URL = "http://link.springer.com/journal/11227", keywords = "cellular arrays; database operations; formal methodology; high-speed computations; matrix arithmetic; nested for-loops; optimal processor/time product; parallel processing; pattern matching; programmable linear systolic array; sequential algorithms; signal processing; sorting; systolic arrays; transitive closure", treatment = "T Theoretical or Mathematical", } @Article{Lins:1990:ISU, author = "Rafael D. Lins and Simon J. Thompson", title = "Implementing {SASL} using Categorical Multi-combinators", journal = j-SPE, volume = "20", number = "11", pages = "1137--1165", month = nov, year = "1990", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Categorical multi-combinators form a rewriting system developed with the aim of providing efficient implementations of lazy functional languages. The core of the system of categorical multi-combinators consists of only two rewriting laws with a very low pattern-matching complexity. This system allows the equivalent of several beta-reductions to be performed at once, and avoids the generation of trivially reducible sub-expressions. In this paper we present a method of introducing algebraic data-types and local recursion to categorical multi-combinators which is both efficient and in harmony with the original system. We also show how to compile a subset of SASL into categorical combinators. Some implementation issues are also addressed here. The performance of implementations of categorical multi-combinator SASL machines is analysed here and compared with other implementations of functional languages.", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "combinator functional", } @Article{Liu:1990:COR, author = "Cheng-Hsiung Liu and Wen-Hsiang Tsai", title = "{$3$D} Curved Object Recognition from Multiple {$2$D} Camera Views", journal = j-CVGIP, volume = "50", number = "2", pages = "177--187", month = may, year = "1990", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Fri Jan 31 15:09:26 MST 1997", bibsource = "Compendex database; Graphics/optica.bib; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Inst. of Comput. Sci. and Inf. Eng., Nat. Chiao Tung Univ.", affiliationaddress = "Hsinchu, Taiwan", classification = "723; 741; C1250 (Pattern recognition); C5260B (Computer vision and picture processing)", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "2D Shape Analysis; 3D curved object recognition; 3D Object Recognition; Automatic Learning; Decision Tree; Decision tree; Feature Clustering; Feature comparison; Fixed camera views; Image Processing--Image Analysis; Industrial Plants--Automation; Input 2D silhouette shape features; Lateral camera; Learning process; Model shapes; Multiple 2D camera views; Pattern Recognition Systems; Principal axes; Recognition system; Rotation; Sequential matching; Shape registration; Top camera; Top-view shape centroids; Translation; Turntable; Vision--Artificial", thesaurus = "Computer vision; Computerised pattern recognition; Computerised picture processing", } @Article{Maes:1990:CSS, author = "Maurice Maes", title = "On a cyclic string-to-string correction problem", journal = j-INFO-PROC-LETT, volume = "35", number = "2", pages = "73--78", day = "29", month = jun, year = "1990", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Philips Research Lab", affiliationaddress = "Eindhoven, Neth", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Philips Res. Labs., Eindhoven, Netherlands", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; Computer Programming; cyclic string-to-string correction problem; Cyclic Strings; distance functions; distance measure; edit operations; encoding; equivalent; minimum-cost sequences; Pattern Matching; polygonal objects; similarity measure; String Correction", treatment = "T Theoretical or Mathematical", } @Article{Mahajan:1990:EPI, author = "Milind Mahajan and V. K. Prasanna Kumar", title = "Efficient parallel implementation of {RETE} pattern matching", journal = j-COMPUT-SYST-SCI-ENG, volume = "5", number = "3", pages = "187--192", month = jul, year = "1990", CODEN = "CSSEEI", ISSN = "0267-6192", bibdate = "Thu Feb 4 13:21:32 MST 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/computsystscieng.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; OCLC Contents1st database", acknowledgement = ack-nhfb, affiliation = "Univ of Southern California", affiliationaddress = "Los Angeles, USA", classification = "723", fjournal = "Computer Systems Science and Engineering", journal-URL = "http://www.crlpublishing.co.uk/csse", journalabr = "Comput Syst Sci Eng", keywords = "Computer Programming --- Algorithms; Computer Systems Programming --- Multiprocessing Programs; Expert Systems; Matching Algorithms; Pattern Matching; RETE Algorithm", } @InCollection{Morris:1990:PER, author = "Joseph M. Morris", title = "Programming by expression refinement: the {KMP} algorithm", crossref = "Feijen:1990:BOB", chapter = "37", pages = "327--338", year = "1990", bibdate = "Sun Mar 27 17:53:57 1994", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/d/dijkstra-edsger-w.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, keywords = "Knuth--Morris--Pratt pattern-matching algorithm", } @Article{Nilsen:1990:SDT, author = "Kelvin Nilsen", title = "A stream data type that supports goal-directed pattern matching on unbounded sequences of values", journal = j-COMP-LANGS, volume = "15", number = "1", pages = "41--54", month = "????", year = "1990", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Iowa State Univ", affiliationaddress = "Ames, IA, USA", classcodes = "C6120 (File organisation); C6110 (Systems analysis and programming); C5260B (Computer vision and picture processing)C6180N (Natural language processing); C6130D (Document processing techniques); C6140D (High level languages)", classification = "723", corpsource = "Dept. of Comput. Sci., Iowa State Univ., Ames, IA, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "arbitrary values; Computer Programming Languages; computerised pattern recognition; Data Processing--Data Structures; data structures; data type; Design; goal-directed; Goal-Directed Pattern Matching; high; Icon; interactive user; interfaces; level languages; natural language processing; pattern matching techniques; processing; programming; sequences; Snobol4; SNOBOL4; stream data type; unbounded; user interfaces; word", treatment = "P Practical", } @InProceedings{Noor:1990:ASC, author = "Ahmed K. Noor and Carl M. Anderson", title = "Application of symbolic computation to geometrically nonlinear analysis of curved beams", crossref = "Noor:1990:SCT", pages = "115--148", year = "1990", bibdate = "Sat Oct 21 15:18:51 2000", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/mathematica.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The application of a two-step hybrid analytical technique to the geometrically nonlinear analysis of curved beams is used to demonstrate the potential of symbolic computations in structural mechanics. The hybrid technique is based on successive use of the regular perturbation method and a classical direct variational procedure. The present application is also used to identify a number of problem areas which limit the realization of the full potential of symbolic computations in nonlinear structural mechanics. The tasks which can be efficiently performed by symbolic computations are: (1) generation of algebraic expressions for the perturbation functions; (2) determination of the radius of convergence of the perturbation series; and (3) evaluation of sensitivity derivatives (derivatives of the different response quantities with respect to the geometric and material parameters of the beam). The symbolic computation system Mathematica is used in the present study. A sample Mathematica program is presented for generating the perturbation functions, applying the direct variational procedure, and evaluating the sensitivity derivatives.", acknowledgement = ack-nhfb, affiliation = "Univ of Virginia", affiliationaddress = "Hampton, VA, USA", classification = "408; 723; 921", conference = "Winter Annual Meeting of the American Society of Mechanical Engineers", conferenceyear = "1990", journalabr = "ASME Pressure Vessels Piping Div Publ PVP", keywords = "Analysis; Beams and Girders; Computer Program Mathematica; Computer Software; Curved Beams; Direct Variational Procedure; Mathematical Techniques --- Nonlinear Equations; Nonlinear Geometric Analysis; Regular Perturbation Method; Symbolic Computation", meetingaddress = "Dallas, TX, USA", meetingdate = "Nov 25--30 1990", meetingdate2 = "11/25--30/90", sponsor = "ASME, Pressure Vessels and Piping Div; ASME, Applied Mechanics Div; ASME, Computers in Engineering Div", } @Article{Partsch:1990:FPM, author = "H. A. Partsch and F. A. Stomp", title = "A fast pattern matching algorithm derived by transformational and assertional reasoning", journal = j-FORM-ASP-COMPUT, volume = "2", number = "1", pages = "109--122", month = mar, year = "1990", CODEN = "FACME5", DOI = "https://doi.org/10.1007/BF01888219", ISSN = "0934-5043 (print), 1433-299X (electronic)", ISSN-L = "0934-5043", bibdate = "Tue Mar 17 20:57:21 MDT 2015", bibsource = "https://www.math.utah.edu/pub/tex/bib/formaspcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://link.springer.com/article/10.1007/BF01888219", acknowledgement = ack-nhfb, fjournal = "Formal Aspects of Computing", journal-URL = "http://link.springer.com/journal/165", } @Article{Peacocke:1990:ISS, author = "Richard D. Peacocke and Daryl H. Graf", title = "An Introduction to Speech and Speaker Recognition", journal = j-COMPUTER, volume = "23", number = "8", pages = "26--33", month = aug, year = "1990", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Tue Feb 04 06:54:17 1997", bibsource = "Ai/Speech.bib; Compendex database; https://www.math.utah.edu/pub/tex/bib/computer1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Misc/IMMD_IV.bib", abstract = "Speech recognition, the ability to identify spoken words, and speaker recognition, the ability to identify who is saying them, are becoming commonplace applications of speech processing technology.", acknowledgement = ack-nhfb, affiliation = "Bell Northern Research, Ottawa, Ont, Can", classification = "721; 723; 751; 922; B6130 (Speech analysis and processing techniques); C1250C (Speech recognition); C5260 (Digital signal processing); C5585 (Speech recognition and synthesis); C6180N (Natural language processing)", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", journalabr = "Computer", keywords = "Automata Theory--Grammars; Controlled environmental conditions; Digital signal processing module; Hidden Markov Models; Isolated words; Limited vocabulary size; Pattern-matching algorithm; Preprocessed signal storage; Probability; Recognition; Reference speech patterns; Signal Processing--Digital Techniques; Speaker recognition; Speaker-dependent systems; Speech; Speech capture device; Speech recognition system; Speech recognition task; Tightly constrained grammar; Tightly Constrained Grammar", thesaurus = "Computerised signal processing; Speech recognition", } @Article{Ramesh:1990:PTP, author = "R. Ramesh and I. V. Ramakrishnan", title = "Parallel Tree Pattern Matching", journal = j-J-SYMBOLIC-COMP, volume = "9", number = "4", pages = "485--502 (or 485--501??)", month = apr, year = "1990", CODEN = "JSYCEH", ISSN = "0747-7171 (print), 1095-855X (electronic)", ISSN-L = "0747-7171", bibdate = "Wed Mar 19 13:51:24 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C4240 (Programming and algorithm theory); C1160 (Combinatorial mathematics); C1250 (Pattern recognition)", corpsource = "Dept. of Comput. Sci., Texas Univ., Dallas, TX, USA", fjournal = "Journal of Symbolic Computation", journal-URL = "http://www.sciencedirect.com/science/journal/07477171", keywords = "automatic; code; compilers; computational complexity; optimization; parallel algorithm; parallel algorithms; parallel random access machine model; parallel tree pattern matching; pattern; programming tasks; recognition; Rewriting, Theorem proving; symbolic computation; term rewriting; theorem proving; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Saxton:1990:FGA, author = "Lawrence V. Saxton and Nalin Wijesinghe", title = "A fast generalized approximate string matching algorithm", journal = j-CONG-NUM, volume = "78", pages = "199--206", year = "1990", ISSN = "0384-9864", MRclass = "68U15 (68P20)", MRnumber = "1140484", bibdate = "Mon May 26 18:16:34 2014", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "Proceedings of the Twenty-first Southeastern Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1990).", fjournal = "Congressus Numerantium. A Conference Journal on Numerical Themes", } @Book{Sedgewick:1990:AC, author = "Robert Sedgewick", title = "Algorithms in {C}", publisher = pub-AW, address = pub-AW:adr, pages = "xii + 657", year = "1990", ISBN = "0-201-51425-7", ISBN-13 = "978-0-201-51425-4", LCCN = "QA76.73.C15 S43 1990", bibdate = "Wed Dec 15 10:41:38 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, tableofcontents = "Fundamentals \\ 1. Introduction \\ 2. C \\ 3. Elementary data structures \\ 4. Trees \\ 5. Recursion \\ 6. Analysis of algorithms \\ 7. Implementation of algorithms \\ Sorting algorithms \\ 8. Elementary sorting methods \\ 9. Quicksort \\ 10. Radix sorting \\ 11. Priority queues \\ 12. Mergesort \\ 13. External sorting \\ Searching algorithms \\ 14. Elementary searching methods \\ 15. Balanced trees \\ 16. Hashing \\ 17. Radix searching \\ 18. External searching \\ String processing \\ 19. String searching \\ 20. Pattern matching \\ 21. Parsing \\ 22. File compression \\ 23. Cryptology \\ Geometry algorithms \\ 24. Elementary geometric methods \\ 25. Finding the convex hull \\ 26. Range searching \\ 27. Geometric intersection \\ 28. Closet-point problems \\ Graph algorithms \\ 29. Elementary graph algorithms \\ 30. Connectivity \\ 31. Weighted graphs \\ 32. Directed graphs \\ 33. Network flow \\ 34. Matching \\ Mathematical algorithms \\ 35. Random numbers \\ 36. Arithmetic \\ 37. Gaussian elimination \\ 38. Curve fitting \\ 39. Integration \\ Advanced topics \\ 40. Parallel algorithms \\ 41. The Fast Fourier Transform \\ 42. Dynamic programming \\ 43. Linear programming \\ 44. Exhaustive search \\ 45. NP-complete problems \\ Index", } @Article{Sunday:1990:VFS, author = "Daniel M. Sunday", title = "A Very Fast Substring Search Algorithm", journal = j-CACM, volume = "33", number = "8", pages = "132--142", month = aug, year = "1990", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu May 30 09:41:10 MDT 1996", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See also \cite{Boyer:1977:FSS,Knuth:1977:FPM,Baeza-Yates:1992:NAT}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/79184.html", abstract = "This article describes a substring search algorithm that is faster than the Boyer--Moore algorithm. This algorithm does not depend on scanning the pattern string in any particular order. Three variations of the algorithm are given that use three different pattern scan orders. These include: (1) a ``Quick Search'' algorithm; (2) a ``Maximal Shift'' and (3) an ``Optimal Mismatch'' algorithm.", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", } @Article{Sunday:string-search, author = "Daniel M. Sunday", title = "A Very Fast Substring Search Algorithm", journal = j-CACM, volume = "33", number = "8", pages = "132--142", month = aug, year = "1990", bibdate = "Sun May 2 07:54:35 1999", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See also \cite{Boyer:string-search,Knuth:string-search,Baeza-Yates:j-CACM-35-10-74}.", acknowledgement = ack-nhfb, } @Article{Takahashi:1990:SCM, author = "H. Takahashi and N. Itoh and T. Amano and A. Yamashita", title = "A spelling correction method and its application to an {OCR} system", journal = j-PATTERN-RECOGN, volume = "23", number = "3-4", pages = "363--377", year = "1990", CODEN = "PTNRA8", ISSN = "0031-3203 (print), 1873-5142 (electronic)", ISSN-L = "0031-3203", bibdate = "Wed Jan 15 12:19:41 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "This paper describes a method of spelling correction consisting of two steps: selection of candidate words, and approximate string matching between the input word and each candidate word. Each word is classified and multi-indexed according to combinations of a constant number of characters in the word. Candidate words are selected fast and accurately, regardless of error types, as long as the number of errors is below a threshold. We applied this method to the post-processing of a printed alphanumeric OCR on a personal computer, thus making our OCR more reliable and user-friendly.", acknowledgement = ack-nhfb, affiliation = "IBM Japan Ltd", affiliationaddress = "Tokyo, Jpn", classification = "722; 723; 741", comment = "Some criteria are explained and used to find correct spellings of misspelled words. The candidate words must start with the same letter and be within 3 of the same length. This method requires that the first character be correct -- this is a bad requirement. They develop a method that orders the characters in the word least frequently to most frequently and then searches a dictionary ordered in a similar way.", fjournal = "Pattern Recognition", journalabr = "Pattern Recognit", keywords = "Applications; Character Recognition Equipment; Character Recognition, Optical; Learning Systems; Machine Learning; Optical Scanners; Pattern Matching; Pattern Recognition; Spelling Correction; Text Processing", } @Article{Takeichi:1990:DFK, author = "Masato Takeichi and Yoji Akama", title = "Deriving a functional {Knuth--Morris--Pratt} algorithm by transformation", journal = j-J-INF-PROCESS, volume = "13", number = "4", pages = "522--528", year = "1990", CODEN = "JIPRDE", ISSN = "0387-6101", ISSN-L = "0387-6101", MRclass = "68N05", MRnumber = "1108115", bibdate = "Mon May 27 17:36:50 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "J. Inform. Process.", fjournal = "Journal of Information Processing", journal-URL = "https://www.ipsj.or.jp/english/jip/index.html", remark = "This article is missing from the v13n4 contents listing at the publisher Web site.", } @Article{Tsui:1990:OES, author = "Hung-Tat Tsui and Ming-Hong Chan and Kin-Cheong Chu and Shao-Hua Kong", title = "Orientation estimation of {$3$D} surface patches", journal = j-CVGIP, volume = "50", number = "1", pages = "112--124", month = apr, year = "1990", CODEN = "CVGPDB", ISSN = "0734-189x (print), 1557-895x (electronic)", ISSN-L = "0734-189X", bibdate = "Fri Jan 31 15:09:26 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/cvgip.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Dept. of Electron., Chinese Univ. of Hong Kong", affiliationaddress = "Shatin, Hong Kong", classification = "723; 741; 913; C1250 (Pattern recognition); C5260B (Computer vision and picture processing)", fjournal = "Computer Vision, Graphics, and Image Processing", journal-URL = "http://www.sciencedirect.com/science/journal/0734189X", journalabr = "Comput Vision Graphics Image Process", keywords = "3D resampling; 3D spherical window; 3D surface patches; 3D template matching; 3D Vision; Automatic Inspection; Automatic inspection job; Closed contours; Depth Recovery; Image Analysis; Image Processing; Image Segmentation; Inspection; Irregular-shaped objects; Nonuniform surface sampling; Object Recognition; Object recognition; Orientation estimation; Patch orientation; Pattern Matching; Pattern Recognition; Self-occlusion; Vision--Artificial", thesaurus = "Computer vision; Inspection", } @InProceedings{Vishkin:1990:DSN, author = "U. Vishkin", title = "Deterministic sampling --- a new technique for fast pattern matching", crossref = "ACM:1990:PTS", pages = "170--180", year = "1990", bibdate = "Wed Feb 20 18:33:59 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/citations/proceedings/stoc/100216/p170-vishkin/", acknowledgement = ack-nhfb, } @Article{Wolff:1990:SPS, author = "J. G. Wolff", title = "Simplicity and Power --- Some Unifying Ideas in Computing", journal = j-COMP-J, volume = "33", number = "6", pages = "518--534", month = dec, year = "1990", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/33.6.518", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", MRclass = "68N15", MRnumber = "1 084 057", bibdate = "Tue Dec 4 14:48:30 MST 2012", bibsource = "http://comjnl.oxfordjournals.org/content/33/6.toc; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/; https://www.math.utah.edu/pub/tex/bib/compj1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/33/6/518.full.pdf+html; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/518.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/519.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/520.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/521.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/522.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/523.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/524.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/525.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/526.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/527.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/528.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/529.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/530.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/531.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/532.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/533.tif; http://www3.oup.co.uk/computer_journal/hdb/Volume_33/Issue_06/tiff/534.tif", acknowledgement = ack-nhfb, affiliation = "Sch. of Electron. Eng. Sci., Wales Univ., Bangor, UK", classcodes = "C6140D (High level languages); C6110 (Systems analysis and programming); C6170 (Expert systems); C1210B (Reliability theory); C1250 (Pattern recognition)", classification = "C1210B (Reliability theory); C1250 (Pattern recognition); C6110 (Systems analysis and programming); C6140D (High level languages); C6170 (Expert systems)", corpsource = "Sch. of Electron. Eng. Sci., Wales Univ., Bangor, UK", fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", keywords = "AND; AND relations; artificial; Artificial intelligence; complexity; Complexity; computerised pattern recognition; computing machine; Computing machine; computing system; Computing system; connectionist; Connectionist; descriptive power; Descriptive power; formal system; Formal system; high expressive power; High expressive power; information theory; intelligence; key dimensions; Key dimensions; knowledge structure; Knowledge structure; language; logic programming; new; New language; OR relations; parallel languages; parallel programming; parallelism; Parallelism; pattern matching; Pattern matching; PROLOG; Prolog-like pattern-matching system; redundancy; Redundancy; relations; search; Search; Shannon-Weaver; Shannon-Weaver information theory; simplicity; Simplicity; size; Size; software engineering; Software engineering; SP; symbolic; Symbolic; unification; Unification; unifying framework; Unifying framework; unifying ideas; Unifying ideas", thesaurus = "Computerised pattern recognition; Logic programming; Parallel languages; Parallel programming; PROLOG; Redundancy", treatment = "P Practical; T Theoretical or Mathematical", } @TechReport{Aho:1991:MCR, author = "Alfred V. Aho and Ravi Sethi", title = "Maintaining Cross References in Manuscripts", type = "Computing Science Technical Report", number = "127", institution = inst-ATT-BELL, address = inst-ATT-BELL:adr, pages = "10", day = "20", month = aug, year = "1991", bibdate = "Fri Aug 25 15:53:20 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", URL = "https://web.archive.org/web/*/http://cm.bell-labs.com/cm/cs/cstr/127.ps.gz", abstract = "Authors face the tedious bookkeeping problem of maintaining the consistency of references to figures, citations, and other numbered entities in successive drafts of a manuscript. If a figure is added to or deleted from the manuscript, the numbers of all subsequent figures must be adjusted, along with the references to these figures. In this note, we show how the UNIX commands grep, awk, and sed can be used to create a simple and flexible reference assembler that automatically maintains the consistency of cross references in manuscripts.", acknowledgement = ack-nhfb, remark = "TO DO: This report is dated 3 years after its publication in \cite{Aho:1988:MCR}; presumably it is an update of a much earlier version.", } @Article{Aiken:1991:IRT, author = "Alexander Aiken and Brian R. Murphy", title = "Implementing Regular Tree Expressions", journal = j-LECT-NOTES-COMP-SCI, volume = "523", pages = "427--??", year = "1991", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 08:51:55 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Belli:1991:SFT, author = "F. Belli and K. E. Grosspietsch", title = "Specification of fault-tolerant system issues by predicate\slash transition nets and regular expressions --- approach and case study", journal = j-IEEE-TRANS-SOFTW-ENG, volume = "17", number = "6", pages = "513--526", month = jun, year = "1991", CODEN = "IESEDJ", DOI = "https://doi.org/10.1109/32.87278", ISSN = "0098-5589 (print), 1939-3520 (electronic)", ISSN-L = "0098-5589", bibdate = "Thu Feb 1 11:00:42 MST 2018", bibsource = "https://www.math.utah.edu/pub/tex/bib/ieeetranssoftweng1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=87278", acknowledgement = ack-nhfb, fjournal = "IEEE Transactions on Software Engineering", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32", } @TechReport{Boyer:1991:ACP, author = "Robert S. Boyer and Yuan Yu", title = "{AUTOMATED CORRECTNESS PROOFS OF MACHINE CODE PROGRAMS FOR A COMMERCIAL MICROPROCESSOR}", number = "TR-91-33", institution = "University of Texas, Austin", address = "Austin, TX, USA", pages = "15", month = nov, year = "1991", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Techreports/university-of-texas-austin.bib", note = "prize ($ \backslash $ \$1.50).", abstract = "We have formally specified a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm, i.e., the Boyer--Moore Theorem Prover. Using this MC68020 specification, we have mechanically checked the correctness of MC68020 machine code programs for Euclid's GCD, Hoare's Quick Sort, binary search, and other well-known algo- rithms. The machine code for these examples was generated using the Gnu C and the Verdix Ada compilers. We have developed an extensive library of proven lemmas to facilitate automated reasoning about machine code programs. We describe a two stage methodology we use to do our machine code proofs.", acknowledgement = ack-nhfb, keywords = "Automated reasoning Nqthm Boyer--Moore Theorem Prover formal program verification object code Gnu C Ada.", } @InProceedings{Breslauer:1991:LBP, author = "Dany Breslauer and Zvi Galil", title = "A lower bound for parallel string matching", crossref = "ACM:1991:PTT", pages = "439--443", year = "1991", bibdate = "Wed Feb 20 18:33:59 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/103418/p439-breslauer/p439-breslauer.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/103418/p439-breslauer/", acknowledgement = ack-nhfb, } @Article{Chapman:1991:QSS, author = "Rob Chapman", title = "{QuikFind} String Search", journal = j-FORTH-DIMENSIONS, volume = "13", number = "4", pages = "21--??", day = "1", month = nov, year = "1991", CODEN = "FODMD5", ISSN = "0884-0822", bibdate = "Sat May 25 13:29:25 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; UnCover library database", abstract = "Sure, ``Forth is fast'-repeat that mantra to yourself while waiting to compile code from a dictionary of several thousand words. The author tweaked his system a bit, then got hooked on the potential. His years-long self-study course is described succinctly here, along with the anticipated results: a fast hash algorithm for dictionary searches that won't turn your modules into molasses.", acknowledgement = ack-nhfb, fjournal = "Forth Dimensions", } @Article{Colussi:1991:CEP, author = "Livio Colussi", title = "Correctness and efficiency of pattern matching algorithms", journal = j-INF-COMPUT, volume = "95", number = "2", pages = "225--251", year = "1991", CODEN = "INFCEC", DOI = "https://doi.org/10.1016/0890-5401(91)90046-5", ISSN = "0890-5401 (print), 1090-2651 (electronic)", ISSN-L = "0890-5401", MRclass = "68Q60", MRnumber = "1138119", bibdate = "Mon May 27 17:37:03 2024", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "https://doi.org/10.1016/0890-5401(91)90046-5", acknowledgement = ack-nhfb, ajournal = "Inf. Comput.", fjournal = "Information and Computation", journal-URL = "http://www.sciencedirect.com/science/journal/08905401", } @Article{Cope:1991:RMU, author = "David Cope", title = "Recombinant Music: Using the Computer to Explore Musical Style", journal = j-COMPUTER, volume = "24", number = "7", pages = "22--28", month = jul, year = "1991", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Sat Feb 1 16:21:14 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/computer1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "A computer program that creates new but stylistically recognizable music from existing works offers insights into the elusive phenomenon of musical style.", acknowledgement = ack-nhfb, affiliation = "Porter Coll., California Univ., Santa Cruz, CA, USA", classification = "723; 751; C5260B (Computer vision and picture processing); C6170 (Expert systems); C7820 (Humanities)", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", journalabr = "Computer", keywords = "Artificial Intelligence; Augmented Transition Networks; Computer Programming; EMI; Experiments in Musical Intelligence; Expert system; Expert Systems; Hierarchical Analysis; Hierarchical musical function; Musical pitches; Musical Style Analysis; Natural-language processing; Pattern matching; Pattern recognition; Pattern Recognition Systems; Recombinant music; Recombinant Music", thesaurus = "Computerised pattern recognition; Expert systems; Music; Natural languages", } @Article{Cringean:1991:NNS, author = "Janey K. Cringean and Roger England and Gordon A. Manson and Peter Willett", title = "Nearest-neighbour searching in files of text signatures using transputer networks", journal = j-EPODD, volume = "4", number = "4", pages = "185--203", month = dec, year = "1991", CODEN = "EPODEU", ISSN = "0894-3982", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/epodd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "This paper discusses the implementation of nearest-neighbour document retrieval in serial files using transputer networks. The system uses a two-stage retrieval algorithm in which an initial text-signature search is used to exclude large numbers of documents from the detailed and time-consuming pattern-matching search. The latter is implemented using a processor farm, so that documents which match at the signature level can be examined in parallel to determine whether they are, in fact, a good match for the query. The results demonstrate that communication is the critical factor in all of the transputer networks that were investigated. A high degree of speed-up can be obtained when only the pattern-matching search is carried out. When text signatures are used, however, the speed-up is less, decreasing in line with an increase in the size of the text signatures that are used.", acknowledgement = ack-nhfb, fjournal = "Electronic Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion, Dissemination, and Design", keywords = "Best-match searching, Full-text documents, Geometric parallelism, Information retrieval, Nearest-neighbour searching, Parallel processing", } @Article{Crochemore:1991:TWS, author = "Maxime Crochemore and Dominique Perrin", title = "Two-Way String Matching", journal = j-J-ACM, volume = "38", number = "3", pages = "651--675", month = jul, year = "1991", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:24:43 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/116845.html", abstract = "A new string matching algorithm is presented, which can be viewed as an intermediate between the classical algorithms of Knuth, Morris, and Pratt on the one hand and Boyer and Moore, on the other hand. The algorithm is linear in time and uses constant space as the algorithm of Galil and Seiferas. It presents the advantage of being remarkably simple which consequently makes its analysis possible. The algorithm relies on a previously-known result in combinatorics on words, called the {\em Critical Factorization Algorithm}, which relates the global period of a word to its local repetitions of blocks.", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", keywords = "algorithms; analysis of algorithms; combinatorial algorithms; critical factorization theorem; Design; pattern matching; String Processing; text processing; theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", } @Article{Crochemore:1991:UKM, author = "M. Crochemore and W. Rytter", title = "Usefulness of the {Karp-Miller-Rosenberg} algorithm in parallel computations on strings and arrays", journal = j-THEOR-COMP-SCI, volume = "88", number = "1", pages = "59--82", day = "30", month = sep, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4240P (Parallel programming and algorithm theory)", corpsource = "LITP, Inst. Blaise Pascal, Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "arrays; complexity bounds; computational complexity; data structure; finding squares; longest common factor; longest repeated factor; Lyndon factorization; maximal symmetric factor; palindromes; parallel algorithms; parallel computations; pattern-matching; repeated patterns; sequential algorithms; string matching; strings; testing even palstars", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Danvy:1991:SDC, author = "Olivier Danvy", title = "Semantics-directed compilation of nonlinear patterns", journal = j-INFO-PROC-LETT, volume = "37", number = "6", pages = "315--322", day = "28", month = mar, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Kansas State Univ", affiliationaddress = "Manhattan, KS, USA", classification = "723; C6150C (Compilers, interpreters and other processors)", corpsource = "Dept. of Comput. and Inf. Sci., Kansas State Univ., Manhattan, KS, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automatic derivation; compiled patterns; Computer Metatheory; Computer Programming --- Theory; Computer Programming Languages; computerised pattern recognition; Nonlinear Patterns; nonlinear patterns; Partial Evaluation; partial evaluation; Pattern Compilation; pattern compiler; Pattern Matching; pattern matching program; program compilers; Programming Theory; Semantics-Directed Compilation", treatment = "P Practical; T Theoretical or Mathematical", } @Book{Dougherty:1991:SA, author = "Dale Dougherty", title = "sed \& awk", publisher = pub-ORA, address = pub-ORA:adr, pages = "xxii + 394", year = "1991", ISBN = "0-937175-59-5", ISBN-13 = "978-0-937175-59-0", LCCN = "QA76.76.U84 D69 1991", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/ora.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", URL = "http://www.oreilly.com/catalog/9780937175590", abstract = "For people who create and modify text files, sed and awk are power tools for editing. Most of the things that you can do with these programs can be done interactively with a text editor. However, using sed and awk can save many hours of repetitive work in achieving the same result. To master sed and awk you must thoroughly understand UNIX regular expressions, and understand the syntax of sed and awk commands. This handbook treats regular expressions as a foundation for learning about sed and awk and contains a comprehensive treatment of sed and awk syntax. It emphasizes the kinds of practical problems that sed and awk can help users to solve, with many useful example scripts and programs.", acknowledgement = ack-nhfb, tableofcontents = "1. Power Tools for Editing \\ 2. Understanding Basic Operations \\ 3. Understanding Regular Expression Syntax \\ 4. Writing Sed Scripts \\ 5. Basic Sed Commands \\ 6. Advanced Sed Commands \\ 7. Writing Scripts for Awk \\ 8. Conditionals, Loops, and Arrays \\ 9. Functions \\ 10. The Bottoms Drawer \\ 11. Full-featured Applications \\ 12. A Miscellany of Scripts \\ Appendices", } @Article{Dowek:1991:SOP, author = "G. Dowek", title = "A second-order pattern matching algorithm for the cube of typed lambda-calculi", journal = j-LECT-NOTES-COMP-SCI, volume = "520", pages = "151--??", year = "1991", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 08:51:55 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Galil:1991:ECS, author = "Zvi Galil and Raffaele Giancarlo", title = "On the Exact Complexity of String Matching: Lower Bounds", journal = j-SIAM-J-COMPUT, volume = "20", number = "6", pages = "1008--1020", month = dec, year = "1991", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q20 (68Q25 68U15)", MRnumber = "93a:68049", MRreviewer = "D. M. Campbell", bibdate = "Mon Nov 29 11:01:53 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/20/6; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Gokhale:1991:BUH, author = "Maya Gokhale and William Holmes and Andrew Kopser and Sara Lucas and Ronald Minnich and Douglas Sweely and Daniel Lopresti", title = "Building and Using a Highly Parallel Programmable Logic Array", journal = j-COMPUTER, volume = "24", number = "1", pages = "81--89", month = jan, year = "1991", CODEN = "CPTRB4", ISSN = "0018-9162 (print), 1558-0814 (electronic)", ISSN-L = "0018-9162", bibdate = "Mon Feb 24 15:40:54 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/computer1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/super.bib", abstract = "Construction of real hardware and feedback from real users contributed to Splash's design, development, and success. For certain pattern-matching applications its price/performance ratio is unmatched.", acknowledgement = ack-nhfb, affiliation = "Supercomputing Res Center, Bowie, MD, USA", classification = "721; 722; 723; 912; B1265B (Logic circuits); C5120 (Logic and switching circuits); C5210 (Logic design methods)", fjournal = "Computer", journal-URL = "http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=2", journalabr = "Computer", keywords = "Computer Systems, Digital; Computers, Supercomputer; Cray-2; Ergonomics; Hardware development; Highly parallel programmable logic array; Logic description generator; Logic Design; Parallel Processing; Parallel Programmable Logic Array; Programming; Runtime environment; Sequence comparison; Splash; splash Programmable Logic Array; Sun workstation; Sun Workstation; Sun workstation; Two-slot addition", thesaurus = "Logic arrays; Logic design", } @Article{Grossi:1991:FCS, author = "Roberto Grossi", title = "Further comments on the subtree isomorphism for ordered trees: {``On the subtree isomorphism problem for ordered trees'' [Inform. Process. {Lett. \bf 32} (1989), no. 5, 271--273; MR 90k:68139] by E. {M{\"a}kinen}}", journal = j-INFO-PROC-LETT, volume = "40", number = "5", pages = "255--256", day = "13", month = dec, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (05C05 68P05 68Q25)", MRnumber = "93c:68077", MRreviewer = "Fabrizio Luccio", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "See \cite{Makinen:1989:SIP}.", acknowledgement = ack-nhfb, affiliation = "Universita di Pisa", affiliationaddress = "Pisa, Italy", classification = "723; 731; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm theory; Binary Tree Representation; Codes, Symbolic --- Coding Errors; coding; Computer Metatheory --- Binary Sequences; Computer Programming --- Algorithms; Design of Algorithms; Mathematical Techniques; Mathematical Techniques --- Linear Algebra; Ordered Trees; ordered trees; Subtree Isomorphism; subtree isomorphism; Trees; trees (mathematics); unordered rooted trees", treatment = "T Theoretical or Mathematical", } @Article{Grossi:1991:NSI, author = "Roberto Grossi", title = "A note on the subtree isomorphism for ordered trees and related problems", journal = j-INFO-PROC-LETT, volume = "39", number = "2", pages = "81--84", day = "31", month = jul, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68R10 (68Q25)", MRnumber = "93e:68101", MRreviewer = "Charles J. Colbourn", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ di Pisa Corso Italia", affiliationaddress = "Pisa, Italy", classification = "723; 921; C1160 (Combinatorial mathematics); C4240 (Programming and algorithm theory)", corpsource = "Dipartimento di Inf., Pisa Univ., Italy", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "codeword; computational complexity; Computer Programming --- Algorithms; Computer Systems Programming --- Multiprocessing Programs; EREW PRAM; exact string matching; Mathematical Techniques; Ordered Trees; ordered trees; parallel algorithm; Parallel Algorithms; parallel algorithms; sequential space; sequential time; string coding; String Matching; Subtree Isomorphism; subtree isomorphism; Trees; trees (mathematics)", treatment = "T Theoretical or Mathematical", } @Article{Hume:1991:FSS, author = "Andrew Hume and Daniel Sunday", title = "Fast String Searching", journal = j-SPE, volume = "21", number = "11", pages = "1221--1248", month = nov, year = "1991", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380211105", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", note = "See \cite{Boyer:1977:FSS,Knuth:1977:FPM,Sunday:1990:VFS}.", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "Boyer--Moore; DNA sequence matching; pattern matching; string searching", onlinedate = "30 Oct 2006", } @Article{Jokinen:1991:TAA, author = "P. Jokinen and E. Ukkonen", title = "Two algorithms for approximate string matching in static texts", journal = j-LECT-NOTES-COMP-SCI, volume = "520", pages = "240--??", year = "1991", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 08:51:55 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Kearns:1991:ERE, author = "Steven M. Kearns", title = "Extending Regular Expressions with Context Operators and Parse Extraction", journal = j-SPE, volume = "21", number = "8", pages = "787--804", month = aug, year = "1991", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "context sensitive; parse extraction; regular expressions; string matching", } @Article{Kearns:1991:T, author = "Steven M. Kearns", title = "{TLex}", journal = j-SPE, volume = "21", number = "8", pages = "805--821", month = aug, year = "1991", CODEN = "SPEXBL", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", keywords = "pattern matching; regular expressions; string matching", } @Article{Kesner:1991:PMO, author = "D. Kesner", title = "Pattern matching in order-sorted languages", journal = j-LECT-NOTES-COMP-SCI, volume = "520", pages = "267--??", year = "1991", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 08:51:55 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Kinber:1991:CSS, author = "E. B. Kinber", title = "On complete sets of samples for generalized regular expressions", journal = j-THEOR-COMP-SCI, volume = "91", number = "1", pages = "101--117", day = "09", month = dec, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic)", corpsource = "Comput. Centre, Latvian State Univ., Riga, Latvia", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "arbitrary class; complete sets of samples; decidability; equivalence problem; equivalent programs; formal languages; generalized regular expressions; inductive formalizations; language; program structures; stronger equivalence relation", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Klier:1991:FCB, author = "Peter Klier and Richard J. Fateman", title = "On Finding the Closest Bitwise Matches in a Fixed Set", journal = j-TOMS, volume = "17", number = "1", pages = "88--97", month = mar, year = "1991", CODEN = "ACMSCU", DOI = "https://doi.org/10.1145/103147.103157", ISSN = "0098-3500 (print), 1557-7295 (electronic)", ISSN-L = "0098-3500", MRclass = "68Q20", MRnumber = "1 103 630", bibdate = "Sun Sep 04 23:33:02 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/toms.bib", URL = "http://www.acm.org/pubs/citations/journals/toms/1991-17-1/p88-klier/", abstract = "In a given large fixed table of bit-vectors, we would like to find, as rapidly as possible, those bit-vectors which have the least Hamming distances from a newly-presented arbitrary bit-vector.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Mathematical Software (TOMS)", journal-URL = "http://portal.acm.org/toc.cfm?idx=J782", keywords = "algorithms; performance", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf E.2}: Data, DATA STORAGE REPRESENTATIONS. {\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Sorting and searching. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process.", } @Article{Laville:1991:CPR, author = "Alain Laville", title = "Comparison of Priority Rules in Pattern Matching and Term Rewriting", journal = j-J-SYMBOLIC-COMP, volume = "11", number = "4", pages = "321--348 (or 321--347??)", month = apr, year = "1991", CODEN = "JSYCEH", ISSN = "0747-7171 (print), 1095-855X (electronic)", ISSN-L = "0747-7171", MRclass = "68Q42 (68N05)", MRnumber = "93g:68063", bibdate = "Sat May 10 15:54:09 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/jsymcomp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classcodes = "C4210 (Formal logic); C4240 (Programming and algorithm theory)", corpsource = "INRIA, Le Chesnay, France", fjournal = "Journal of Symbolic Computation", journal-URL = "http://www.sciencedirect.com/science/journal/07477171", keywords = "calls; constructors based linear systems; function; pattern matching; priority rules; programming theory; rewriting systems; term rewriting", treatment = "T Theoretical or Mathematical", } @Article{LeBret:1991:RSM, author = "Christophe {Le Bret}", title = "Robust String Matching", journal = j-COMP-LANG-MAG, volume = "8", number = "12", pages = "71--??", month = dec, year = "1991", CODEN = "COMLEF", ISSN = "0749-2839", bibdate = "Tue Jan 23 08:04:25 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/complang.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Computer Language Magazine", } @Article{Lee:1991:DCM, author = "David Lee", title = "Detection, Classification, and Measurement of Discontinuities", journal = j-SIAM-J-SCI-STAT-COMP, volume = "12", number = "2", pages = "311--341", month = mar, year = "1991", CODEN = "SIJCD4", ISSN = "0196-5204", MRclass = "94A12 (26A27 65D99 94A13)", MRnumber = "91m:94004", MRreviewer = "Solomon Marcus", bibdate = "Tue Apr 29 19:18:28 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/siamjscistatcomp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4130 (Interpolation and function approximation); C4290 (Other computer theory)", corpsource = "AT and T Bell Labs., Murray Hill, NJ, USA", fjournal = "SIAM Journal on Scientific and Statistical Computing", journal-URL = "http://epubs.siam.org/loi/sijcd4", keywords = "classification; computational geometry; curve fitting; discontinuities; discontinuity detection; linear filter; measurement; necessary and sufficient conditions; one-to-one correspondence; pattern matching; pattern search; sampled noisy data; scaled pattern; splines; splines (mathematics); statistical method; white noise", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Lee:1991:VAL, author = "Kuo Chu Lee and Takako Matoba Hickey and Victor W. Mak and Gary E. Herman", title = "{VLSI} Accelerators for Large Database Systems", journal = j-IEEE-MICRO, volume = "11", number = "6", pages = "8--20", month = nov # "\slash " # dec, year = "1991", CODEN = "IEMIDZ", DOI = "https://doi.org/10.1109/40.108569", ISSN = "0272-1732 (print), 1937-4143 (electronic)", ISSN-L = "0272-1732", bibdate = "Thu Dec 14 06:08:58 MST 2000", bibsource = "Compendex database; Database/Graefe.bib; https://www.math.utah.edu/pub/tex/bib/ieeemicro.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; Science Citation Index database (1980--2000)", abstract = "Resloving the problem of slow response times in a cost-effective manner", acknowledgement = ack-nhfb, affiliation = "Bellcore, Morristown, NJ, USA", classcodes = "B1265F (Microprocessors and microcomputers); B2570 (Semiconductor integrated circuits); C5130 (Microprocessor chips); C6160D (Relational DBMS); C5220 (Computer architecture)", classification = "714.2; 722.1; 723.3", corpsource = "Bellcore, Morristown, NJ, USA", fjournal = "IEEE Micro", journal-URL = "https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=40", keywords = "aggregation operations; Associative search; associative search; Boolean algebra; Computer applications; databases; dedicated computer systems; formatted databases; general purpose computers; hardware interfaces; instruction sets; large database; Microprocessor chips; microprocessor chips; reduced instruction set computing; Relational data filtering; relational data filtering; Relational database systems; relational databases; special purpose computers; string search; String search accelerator; systems; text search; unformatted; VLIS accelerators; VLSI; VLSI accelerator; VLSI circuits", treatment = "P Practical", } @Article{Mak:1991:EPP, author = "Victor Wing-Kit Mak and Chu Lee Kuo and Ophir Frieder", title = "Exploiting Parallelism in Pattern Matching: An Information Retrieval Application", journal = j-TOIS, volume = "9", number = "1", pages = "52--74", month = jan, year = "1991", CODEN = "ATISET", ISSN = "1046-8188", ISSN-L = "0734-2047", bibdate = "Sat Jan 16 19:02:45 MST 1999", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Database/Graefe.bib; http://liinwww.ira.uka.de/bibliography/Database/Graefe.html; http://www.acm.org/pubs/tois/toc.html; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tois.bib", URL = "http://www.acm.org:80", abstract = "We propose a document-searching architecture based on high-speed hardware pattern matching to increase the throughput of an information retrieval system. We also propose a new parallel VLSI pattern-matching algorithm called the Data Parallel Pattern Matching (DPPM) algorithm, which serially broadcasts and compares the pattern to a block of data in parallel. The DPPM algorithm utilizes the high degree of integration of VLSI technology to attain very high-speed processing through parallelism. Performance of the DPPM has been evaluated both analytically and by simulation. Based on the simulation statistics and timing analysis on the hardware design, a search rate of multiple gigabytes per second is achievable using 2-$ \lbrace $ micro$ \rbrace $ m CMOS technology. The potential performance of the proposed document-searching architecture is also analyzed using the simulation statistics of the DPPM algorithm.", acknowledgement = ack-nhfb, fjournal = "ACM Transactions on Information Systems (TOIS)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J779", keywords = "Algorithms; Algorithms implemented in hardware; Analysis of algorithms and problem complexity; Arithmetic and logic structures; Computer systems organization; Data; Design; Design studies; Design styles; DPPM; Files; Information search and retrieval; Information storage and retrieval; Integrated circuits; Modeling techniques; Multiple data stream architecture; Nonnumerical algorithms and problems; Parallel; Pattern matcher; Pattern matching; Performance; Performance of systems; Processor architectures; Search process; Selection process; SIMD; Sorting and searching; Sorting/searching; Types and design styles; VLSI", } @Article{Manber:1991:ASM, author = "Udi Manber and Ricardo Baeza-Yates", title = "An algorithm for string matching with a sequence of don't cares", journal = j-INFO-PROC-LETT, volume = "37", number = "3", pages = "133--136", day = "18", month = feb, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Arizona", affiliationaddress = "Tucson, AZ, USA", classification = "723; C6120 (File organisation); C7250 (Information storage and retrieval)", corpsource = "Dept. of Comput. Sci., Arizona Univ., Tucson, AZ, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "algorithm; Algorithms; biological sequences; Computer Programming; Data Processing --- Data Structures; data structures; information retrieval; pattern; proximity searching; search; sequence of don't cares; String Matching; string matching; suffix array data structure; text searching systems; two-dimensional orthogonal range queries problem; upper bound", treatment = "P Practical", } @Article{Naor:1991:SMP, author = "M. Naor", title = "String Matching with Preprocessing of Text and Pattern", journal = j-LECT-NOTES-COMP-SCI, volume = "510", pages = "739--??", year = "1991", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 08:51:55 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Narayanan:1991:PME, author = "V. Narayanan", title = "Pattern matching for everyone", journal = j-SIGCSE, volume = "23", number = "3", pages = "27--30", month = sep, year = "1991", CODEN = "SIGSD3", DOI = "https://doi.org/10.1145/126459.126468", ISSN = "0097-8418 (print), 2331-3927 (electronic)", ISSN-L = "0097-8418", bibdate = "Sat Nov 17 18:57:16 MST 2012", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigcse1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIGCSE Bulletin (ACM Special Interest Group on Computer Science Education)", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J688", } @Article{Pakin:1991:REG, author = "Scott Pakin", title = "Regular Expressions and Gender Guessing", journal = j-COMP-LANG-MAG, volume = "8", number = "12", pages = "59--??", month = dec, year = "1991", CODEN = "COMLEF", ISSN = "0749-2839", bibdate = "Tue Jan 23 08:04:25 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Computer Language Magazine", } @Article{Partsch:1991:ACS, author = "H. A. Partsch and N. Volker", title = "Another Case Study on Reusability of Transformational Developments Pattern Matching According to {Knuth}, {Morris}, and {Pratt}", journal = j-LECT-NOTES-COMP-SCI, volume = "544", pages = "35--??", year = "1991", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 08:51:55 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @InCollection{Pepper:1991:LPD, author = "P. Pepper", title = "Literate program derivation: a case study", crossref = "Broy:1991:MPS", pages = "101--124", year = "1991", bibdate = "Wed Aug 31 00:52:14 MDT 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/litprog.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "`Literate programming' is a notion that has been introduced by D. E. Knuth (1984), as a means for improving the art of programming by amalgamating explanatory text with the program proper. The author combines the principal ideas of literate programming with the concepts of formal program development, based on algebraic specifications and transformations. This experiment is performed using the sublinear string-searching algorithm of R. S. Boyer and J. S. Moore (1977) as an illustrating example.", acknowledgement = ack-nhfb, affiliation = "Inst. fur Angewandte Inf., Tech. Univ., Berlin, Germany", classification = "C1250 (Pattern recognition); C4240 (Programming and algorithm theory); C5260B (Computer vision and picture processing); C6110B (Software engineering techniques)", keywords = "Algebraic specifications; Case study; Explanatory text; Formal program development; Literate programming; Sublinear string-searching algorithm; Transformations", thesaurus = "Computerised pattern recognition; Formal specification; Programming", } @Article{Revesz:1991:TOM, author = "G. E. Revesz", title = "On translating ordinary mathematical notation", journal = j-STRUCTURED-PROGRAMMING, volume = "12", number = "3", pages = "115--122", month = "", year = "1991", CODEN = "STPGEM", ISSN = "0935-1183", bibdate = "Thu Sep 01 01:15:09 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/texbook3.bib", abstract = "The abstract mathematical description of an algorithm is usually much better for human consumption than its implementation in a conventional programming language. The aim is to use ordinary mathematical notation as a program development tool for certain applications. The author illustrates some ideas via an experimental translator which translates mathematical formulas to Pascal statements. More precisely, a combination of ordinary mathematical notation and conventional style control structures and declarations is used as the programming language. But, because of the two-dimensional nature of ordinary mathematical notation, the proper display of source programs requires some special tools. Given the popularity of the {\TeX} type-setting system, the author decided to encode the source programs in plain {\TeX}. The experimental translator has four phases: the first phase is a lexical analyzer (tokenizer) which deals primarily with the decoding of the {\TeX} notation; the second phase is a preprocessor which analyses the declarations and performs other pattern matching functions; the third is the actual parser; and the fourth phase is the code generator. (6 Refs.)", acknowledgement = ack-nhfb, affiliation = "IBM Corp., Thomas J. Watson Res. Center, Yorktown, NY, USA", classification = "C6110 (Systems analysis and programming); C6140D (High level languages); C6150C (Compilers, interpreters and other processors)", keywords = "Abstract mathematical description; Code generator; Conventional style control structures; Declarations; Experimental translator; Lexical analyzer; Ordinary mathematical notation; Parser; Pascal statements; Pattern matching functions; Preprocessor; Program development tool; Programming language; Source programs; TeX notation; TeX type-setting system; Tokenizer; Two-dimensional nature", thesaurus = "Pascal; Program compilers; Program interpreters; Structured programming; Word processing", } @Article{Rote:1991:CMH, author = "G{\"u}nter Rote", title = "Computing the minimum {Hausdorff} distance between two-point sets on a line under translation", journal = j-INFO-PROC-LETT, volume = "38", number = "3", pages = "123--127", day = "17", month = may, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U05 (68T10)", MRnumber = "92d:68114", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Technische Univ Graz", affiliationaddress = "Graz, Austria", classification = "723; 921; C4240 (Programming and algorithm theory)", corpsource = "Inst. f{\"u}r Math., Tech. Univ., Graz, Austria", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; computational complexity; Computational Geometry; computational geometry; Computer Programming; Computer Vision; geometry; Hausdorff Distance; Mathematical Techniques --- Geometry; minimum Hausdorff distance; optimal algorithm; Pattern Matching; Pattern Recognition; point sets", treatment = "T Theoretical or Mathematical", } @Article{Savoy:1991:IRH, author = "Jacques Savoy and Daniel Desbois", title = "Information retrieval in hypertext systems: an approach using {Bayesian} networks", journal = j-EPODD, volume = "4", number = "2", pages = "87--108", month = jun, year = "1991", CODEN = "EPODEU", ISSN = "0894-3982", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/epodd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The emphasis in most hypertext systems is on the navigational methods, rather than on the global document retrieval mechanisms. When a search mechanism is provided, it is often restricted to simple string matching or to the Boolean model. As an alternate method, we propose a retrieval mechanism using Bayesian inference networks. The main contribution of our approach is the automatic construction of this network using the expected mutual information measure to build the inference tree, and using Jaccard's formula to define fixed conditional probability relationships.", acknowledgement = ack-nhfb, fjournal = "Electronic Pub\-lish\-ing\emdash{}Orig\-i\-na\-tion, Dissemination, and Design", keywords = "Hypertext, Information retrieval, Information retrieval in hypertext, Bayesian network, Probabilistic retrieval model, Probabilistic inference, Uncertainty processing", } @Article{Savoy:EPODD-4-2-87, author = "Jacques Savoy and Daniel Desbois", title = "Information retrieval in hypertext systems: an approach using {Bayesian} networks", journal = j-EPODD, volume = "4", number = "2", pages = "87--108", month = jun, year = "1991", CODEN = "EPODEU", ISSN = "0894-3982", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/epodd.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The emphasis in most hypertext systems is on the navigational methods, rather than on the global document retrieval mechanisms. When a search mechanism is provided, it is often restricted to simple string matching or to the Boolean model. As an alternate method, we propose a retrieval mechanism using Bayesian inference networks. The main contribution of our approach is the automatic construction of this network using the expected mutual information measure to build the inference tree, and using Jaccard's formula to define fixed conditional probability relationships.", acknowledgement = ack-nhfb, keywords = "Hypertext, Information retrieval, Information retrieval in hypertext, Bayesian network, Probabilistic retrieval model, Probabilistic inference, Uncertainty processing", } @Article{Schneier:1991:OHF, author = "Bruce Schneier", title = "One-Way Hash Functions: Probabilistic algorithms can be used for general-purpose pattern matching", journal = j-DDJ, volume = "16", number = "9", pages = "148--151", day = "1", month = sep, year = "1991", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 09:11:02 MDT 1996", bibsource = "http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/dr-dobbs.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; UnCover database", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "128-Bit hash; 32 Bit; 32-Bit architectures; 32-Bit operands; Cryptographic algorithm; DES; Digital Encryption Standard; MD5; Message Digest; One-way hash function", thesaurus = "C listings; Cryptography; File organisation", } @Article{Schneier:1991:OWH, author = "Bruce Schneier", title = "One-Way Hash Functions: Probabilistic algorithms can be used for general-purpose pattern matching", journal = j-DDJ, volume = "16", number = "9", pages = "148--151", day = "1", month = sep, year = "1991", CODEN = "DDJOEB", ISSN = "1044-789X", bibdate = "Tue Sep 10 09:11:02 MDT 1996", bibsource = "ftp://ftp.math.utah.edu/pub/tex/bib/dr-dobbs.bib; ftp://ftp.math.utah.edu/pub/tex/bib/hash.bib; http://www.ddj.com/index/author/index.htm; https://www.math.utah.edu/pub/tex/bib/cryptography1990.bib; https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; UnCover database", acknowledgement = ack-nhfb, classification = "C6120 (File organisation); C6130 (Data handling techniques)", fjournal = "Dr. Dobb's Journal of Software Tools", keywords = "128-Bit hash; 32 Bit; 32-Bit architectures; 32-Bit operands; Cryptographic algorithm; DES; Digital Encryption Standard; MD5; Message Digest; One-way hash function", thesaurus = "C listings; Cryptography; File organisation", } @Article{Smith:1991:EVF, author = "P. D. Smith", title = "Experiments with a Very Fast Substring Search Algorithm", journal = j-SPE, volume = "21", number = "10", pages = "1065--1074", month = oct, year = "1991", CODEN = "SPEXBL", DOI = "https://doi.org/10.1002/spe.4380211006", ISSN = "0038-0644 (print), 1097-024X (electronic)", ISSN-L = "0038-0644", bibdate = "Sat May 31 13:36:16 MDT 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/spe.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, ajournal = "Softw. Pract. Exp.", fjournal = "Software --- Practice and Experience", journal-URL = "http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-024X", onlinedate = "30 Oct 2006", } @Article{Smith:1991:PEP, author = "Donald A. Smith", title = "Partial evaluation of pattern matching in constraint logic programming languages", journal = j-SIGPLAN, volume = "26", number = "9", pages = "62--71", month = sep, year = "1991", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:11 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", } @Article{Tucci:1991:RNC, author = "Maurizio Tucci and Gennaro Costagliola and Shi-Kuo Chang", title = "A remark on {NP}-completeness of picture matching", journal = j-INFO-PROC-LETT, volume = "39", number = "5", pages = "241--243", day = "13", month = sep, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Pittsburgh", affiliationaddress = "Pittsburgh, PA, USA", classification = "723; 903; C1250 (Pattern recognition); C4240 (Programming and algorithm theory); C4250 (Database theory); C6160S (Spatial and pictorial databases)", corpsource = "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "2-D string representation; computational complexity; computer graphics; Computer Metatheory --- Computational Complexity; computerised pattern recognition; computerised picture processing; database management systems; Database Systems; database theory; iconic indexing; image database systems; Image Databases; image retrieval; Information Retrieval; information retrieval; Information Science; NP Completeness; NP-completeness; objects; orthogonal projections; Picture Matching; picture matching; picture queries; picture retrieval; spatial relations", treatment = "T Theoretical or Mathematical", } @Article{Vishkin:1991:DSN, author = "Uzi Vishkin", title = "Deterministic Sampling --- a New Technique for Fast Pattern Matching", journal = j-SIAM-J-COMPUT, volume = "20", number = "1", pages = "22--40", month = feb, year = "1991", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68P99 (68Q10 68Q20 68T10)", MRnumber = "1 082 134", bibdate = "Mon Nov 29 11:01:41 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/20/1; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @Article{Yodaiken:1991:MFC, author = "Victor Yodaiken", title = "Modal functions for concise definition of state machines and products", journal = j-INFO-PROC-LETT, volume = "40", number = "2", pages = "65--72", day = "25", month = oct, year = "1991", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68Q60", MRnumber = "92m:68077", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ of Massachusetts", affiliationaddress = "Amherst, MA, USA", classification = "721; C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Comput. and Inf. Syst., Massachusetts Univ., Amherst, MA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "automata products; Automata Theory; Automata Theory --- Formal Languages; complex control; computer engineering; Finite Automata; finite automata; Finite State Transition Systems; finite state transition systems; formal languages; function composition; generalized feedback product; modal extension; Modal Functions; modal functions; Moore machine; Moore Machines; past input signals; primitive recursive functions; recursive functions; regular expressions; rule; semigroups; state dependent extension; state diagrams; state machines; state products; state sets; state systems; wreath products", treatment = "T Theoretical or Mathematical", } @Article{Yoo:1991:EAL, author = "H. Yoo and K. Hashiguchi", title = "Extended automata-like regular expressions of star degree at most (2, 1)", journal = j-THEOR-COMP-SCI, volume = "88", number = "2", pages = "351--363", day = "07", month = oct, year = "1991", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4210 (Formal logic); C4220 (Automata theory)", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "automata theory; concatenation; context-free languages; extended automata-like regular expressions; finite languages; star degree; star operator; ultralinear languages; union", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Amir:1992:EPM, author = "Amihood Amir and Gad M. Landau and Uzi Vishkin", title = "Efficient pattern matching with scaling", journal = j-J-ALG, volume = "13", number = "1", pages = "2--32", month = mar, year = "1992", CODEN = "JOALDV", DOI = "https://doi.org/10.1016/0196-6774(92)90003-U", ISSN = "0196-6774 (print), 1090-2678 (electronic)", ISSN-L = "0196-6774", bibdate = "Tue Dec 11 09:15:14 MST 2012", bibsource = "https://www.math.utah.edu/pub/tex/bib/jalg.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.sciencedirect.com/science/article/pii/019667749290003U", acknowledgement = ack-nhfb, fjournal = "Journal of Algorithms", journal-URL = "http://www.sciencedirect.com/science/journal/01966774", } @Article{Amir:1992:TDD, author = "Amihood Amir and Martin Farach", title = "Two-dimensional dictionary matching", journal = j-INFO-PROC-LETT, volume = "44", number = "5", pages = "233--239", day = "21", month = dec, year = "1992", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", MRclass = "68U15", MRnumber = "93k:68111", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, classification = "C4240 (Programming and algorithm theory); C6130D (Document processing techniques)", corpsource = "Coll. of Comput., Georgia Inst. of Technol., Atlanta, GA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", keywords = "computational complexity; dictionary matching algorithms; dictionary patterns; pattern matching algorithms; pattern string; preprocessing; text processing; two-dimensional dictionary problem; two-dimensional patterns; word processing", treatment = "T Theoretical or Mathematical", } @Article{Anonymous:1992:AUa, author = "Anonymous", title = "{Answers to UNIX}", journal = j-UNIX-WORLD, volume = "9", number = "10", pages = "117--??", month = oct, year = "1992", ISSN = "0739-5922", bibdate = "Sat Jan 27 06:20:21 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", abstract = "Designing scripts, regular expressions, and reading characters.", acknowledgement = ack-nhfb, fjournal = "UNIX/world", } @Article{Anonymous:1992:CPM, author = "Anonymous", title = "{Combinatorial Pattern Matching School}", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "??--??", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1160 (Combinatorial mathematics) and algorithm theory; C1250 (Pattern recognition); C4220 (Automata theory); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "acyclic deterministic automata; algorithm theory; automata theory; average-case pattern matching; Boyer--Moore--Horspool algorithm; canonical form; circular string; computational complexity; data compression; dynamic programming; factor automata; fast linear-space computations; linear time; longest common subsequences; minimisation; optimal algorithms; pattern recognition; search problems; string matching", pubcountry = "Netherlands", } @Article{Atallah:1992:PMM, author = "Mikhail J. Atallah and Philippe Jacquet and Wojciech Szpankowski", title = "Pattern Matching with Mismatches: a Probabilistic Analysis and a Randomized Algorithm", journal = j-LECT-NOTES-COMP-SCI, volume = "644", pages = "27--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Baeza-Yates:1992:ART, author = "R. A. Baeza-Yates and M. Regnier", title = "Average running time of the {Boyer--Moore--Horspool} algorithm", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "19--31", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. de Ciencias de la Comput., Chile Univ., Santiago, Chile", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "average running time; Boyer--Moore--Horspool algorithm; Boyer--Moore-type string searching algorithms; cardinality; computational complexity; exact expression; linearity constant; pattern recognition; search problems; stationary process; symbol manipulation; text editing; word enumeration problem", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Article{Baeza-Yates:1992:FPA, author = "Ricardo A. Baeza-Yates and Chris H. Perleberg", title = "Fast and Practical Approximate String Matching", journal = j-LECT-NOTES-COMP-SCI, volume = "644", pages = "182--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Baeza-Yates:1992:NAT, author = "Ricardo Baeza-Yates and Gaston H. Gonnet", title = "A new approach to text searching", journal = j-CACM, volume = "35", number = "10", pages = "74--82", month = oct, year = "1992", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Thu May 30 09:41:10 MDT 1996", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", note = "This paper describes a new linear-time string search algorithm that can handle limited regular-expression pattern matching {\em without\/} backtracking. See also \cite{Knuth:1977:FPM}, \cite{Boyer:1977:FSS}, \cite{Karp:1981:ERPa}, \cite{Sunday:1990:VFS}, and \cite{Wu:1992:FTS}.", URL = "http://www.acm.org/pubs/toc/Abstracts/0001-0782/135243.html", acknowledgement = ack-nhfb, fjournal = "Communications of the ACM", journal-URL = "https://dl.acm.org/loi/cacm", keywords = "algorithms", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Retrieval models. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Search process. {\bf H.3.3}: Information Systems, INFORMATION STORAGE AND RETRIEVAL, Information Search and Retrieval, Selection process. {\bf I.5.4}: Computing Methodologies, PATTERN RECOGNITION, Applications, Text processing.", } @Article{Baeza-Yates:1992:TCN, author = "Ricardo Baeza-Yates and Fred T. Krogh and Bernard Ziegler and Peter R. Sibbald and Daniel M. Sunday", title = "Technical Correspondence: Notes on a Very Fast Substring Search Algorithm", journal = j-CACM, volume = "35", number = "4", pages = "132--137", month = apr, year = "1992", CODEN = "CACMA2", ISSN = "0001-0782 (print), 1557-7317 (electronic)", ISSN-L = "0001-0782", bibdate = "Tue Jan 28 14:52:45 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/cacm1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, journal-URL = "https://dl.acm.org/loi/cacm", } @Article{Bertossi:1992:SNP, author = "A. A. Bertossi and F. Luccio and L. Pagli and E. Lodi", title = "Short notes: {A parallel solution to the approximate string matching problem}", journal = j-COMP-J, volume = "35", number = "5", pages = "524--526", month = oct, year = "1992", CODEN = "CMPJA6", DOI = "https://doi.org/10.1093/comjnl/35.5.524", ISSN = "0010-4620 (print), 1460-2067 (electronic)", ISSN-L = "0010-4620", bibdate = "Tue Dec 4 14:48:35 MST 2012", bibsource = "http://comjnl.oxfordjournals.org/content/35/5.toc; https://www.math.utah.edu/pub/tex/bib/compj.bib; https://www.math.utah.edu/pub/tex/bib/compj1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://comjnl.oxfordjournals.org/content/35/5/524.full.pdf+html; http://www3.oup.co.uk/computer_journal/Volume_35/Issue_05/350524.sgm.abs.html; http://www3.oup.co.uk/computer_journal/Volume_35/Issue_05/tiff/524.tif; http://www3.oup.co.uk/computer_journal/Volume_35/Issue_05/tiff/525.tif; http://www3.oup.co.uk/computer_journal/Volume_35/Issue_05/tiff/526.tif", acknowledgement = ack-nhfb, fjournal = "The Computer Journal", journal-URL = "http://comjnl.oxfordjournals.org/", } @InProceedings{Boyer:1992:ACP, author = "R. S. Boyer and Yuan Yu", title = "Automated correctness proofs of machine code programs for a commercial microprocessor", crossref = "Kapur:1992:ADC", pages = "416--430", month = "", year = "1992", bibdate = "Wed Oct 30 05:59:54 MST 1996", bibsource = "https://www.math.utah.edu/pub/bibnet/authors/h/hoare-c-a-r.bib; https://www.math.utah.edu/pub/tex/bib/gnu.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The authors have formally specified a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm i.e. the Boyer--Moore Theorem Prover. Using this MC68020 specification, the authors have mechanically checked the correctness of MC68020 machine code programs for Euclid's GCD, Hoare's Quick Sort, binary search, and other well-known algorithms. The machine code for these examples was generated using the GNU C and the Verdix Ada compilers. The authors have developed an extensive library of proven lemmas to facilitate automated reasoning about machine code programs. The authors describe a two stage methodology they use to do their machine code proofs.", acknowledgement = ack-nhfb, affiliation = "Dept. of Comput. Sci. and Math., Texas Univ., Austin, TX, USA", classification = "C4210 (Formal logic); C5130 (Microprocessor chips); C6110B (Software engineering techniques); C6150G (Diagnostic, testing, debugging and evaluating systems)", keywords = "Automated reasoning system Nqthm; Automatic correctness proofs; Binary search; Boyer--Moore Theorem Prover; Commercial microprocessor; GCD; GNU C; Hoare's Quick Sort; Machine code programs; Mathematical logic; MC68020; Verdix Ada compilers", thesaurus = "Formal specification; Microprocessor chips; Program verification; Theorem proving", } @Article{Breslauer:1992:LBP, author = "Dany Breslauer and Zvi Galil", title = "A Lower Bound for Parallel String Matching", journal = j-SIAM-J-COMPUT, volume = "21", number = "5", pages = "856--862", month = oct, year = "1992", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q22 (68Q25 68U15)", MRnumber = "93j:68064", bibdate = "Mon Nov 29 11:02:04 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/21/5; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @InProceedings{Bruggemann-Klein:1992:DRLa, author = "A. Br{\"u}ggemann-Klein and D. Wood", title = "Deterministic regular languages", crossref = "Finkel:1992:SAS", bookpages = "xiv + 620", pages = "173--184", month = feb, year = "1992", bibdate = "Tue Sep 13 16:25:09 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "The ISO standard for standard generalized markup language (SGML) provides a syntactic meta-language for the definition of textual markup systems. In the standard the right hand sides of productions are called content models and they are based on regular expressions. The allowable regular expressions are those that are `unambiguous' as defined by the standard. Unfortunately, the standard's use of the term `unambiguous' does not correspond to the two well known notions, since not all regular languages are denoted by `unambiguous' expressions. Furthermore, the standard's definition of `unambiguous' is somewhat vague. The authors provide a precise definition of `unambiguous expressions' and rename them deterministic regular expressions to avoid any confusion. A regular expression E is deterministic if the canonical epsilon-free finite automaton M/sub E/ recognizing L(E) is deterministic. A regular language is deterministic if there is a deterministic expression that denotes it. The authors give a Kleene-like theorem for deterministic regular languages and characterize them in terms of the structural properties of the minimal deterministic automata recognizing them. The latter result enables them to decide if a given regular expression denotes a deterministic regular language and, if so, to construct an equivalent deterministic expression.", acknowledgement = ack-nhfb, affiliation = "Inst. f{\"u}r Inf., Freiburg Univ., Germany", classification = "C4210 (Formal logic); C4220 (Automata theory)", confdate = "13--15 Feb. 1992", conflocation = "Cachan, France", keywords = "Canonical epsilon-free finite automaton; Content models; Deterministic regular expressions; ISO standard; Kleene-like theorem; Minimal deterministic automata; Regular expressions; Standard generalized markup language; Structural properties; Syntactic meta-language; Textual markup systems", thesaurus = "Deterministic automata; Finite automata; Formal languages", } @InProceedings{Bruggemann-Klein:1992:DRLb, author = "A. Bruggemann-Klein and D. Wood", title = "Deterministic regular languages", crossref = "Finkel:1992:SAS", pages = "173--184", month = "????", year = "1992", bibdate = "Wed Sep 11 05:43:28 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Inst. f{\"u}r Inf., Freiburg Univ., Germany", classification = "C4210 (Formal logic); C4220 (Automata theory)", keywords = "Canonical epsilon-free finite automaton; Content models; Deterministic regular expressions; ISO standard; Kleene-like theorem; Minimal deterministic automata; Regular expressions; Standard generalized markup language; Structural properties; Syntactic meta-language; Textual markup systems", thesaurus = "Deterministic automata; Finite automata; Formal languages", } @TechReport{Bruggemann-Klein:1992:URE, author = "Anne Br{\"u}ggemann-Klein and Derick Wood", title = "Unambiguous Regular Expressions and {SGML} Document Grammars", type = "Technical Report", number = "337", institution = "Computer Science Department, University of Western Ontario", address = "London, Ontario, Canada", month = nov, year = "1992", ISBN = "0-7714-1454-4", ISBN-13 = "978-0-7714-1454-1", bibdate = "Sat Feb 24 09:50:43 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-js, annote = "From Joachim Schrod: ``Available from AFA \path=ftp.csd.uwo.ca:/pub/csd-technical-reports/337=. This report shows the relationship between traditional formal languages and SGML doctype specifications. In particular, it is a data point to show that the usage of terms in the SGML community does not conform to the canonical meaning in CS\@. The report shows that one can decide if a given regular expression is equivalent to a valid SGML doctype, and that one can do this transformation. The algorithm for the transformation is exponential; it is not known if this is a time-optimal algorithm.''", } @InProceedings{BruggemannKlein:1992:DRL, author = "A. Bruggemann-Klein and D. Wood", title = "Deterministic regular languages", crossref = "Finkel:1992:SAS", pages = "173--184", month = "????", year = "1992", bibdate = "Wed Sep 11 05:43:28 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Inst. f{\"u}r Inf., Freiburg Univ., Germany", classification = "C4210 (Formal logic); C4220 (Automata theory)", keywords = "Canonical epsilon-free finite automaton; Content models; Deterministic regular expressions; ISO standard; Kleene-like theorem; Minimal deterministic automata; Regular expressions; Standard generalized markup language; Structural properties; Syntactic meta-language; Textual markup systems", thesaurus = "Deterministic automata; Finite automata; Formal languages", } @Article{Cai:1992:MEB, author = "J. Cai and R. Paige and R. Tarjan", title = "More efficient bottom-up multi-pattern matching in trees", journal = j-THEOR-COMP-SCI, volume = "106", number = "1", pages = "21--60", day = "30", month = nov, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4210 (Formal logic); C6120 (File organisation)", corpsource = "Dept. of Comput. Sci., New York Univ., NY, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "bottom-up multi-pattern matching; decomposition method; pattern preprocessing; pattern recognition; programming language systems; rewriting systems; space/time tradeoff; theorem proving; tree data structures; trees", pubcountry = "Netherlands", treatment = "P Practical", } @Article{Chang:1992:TEC, author = "William I. Chang and Jordan Lampe", title = "Theoretical and Empirical Comparisons of Approximate String Matching Algorithms", journal = j-LECT-NOTES-COMP-SCI, volume = "644", pages = "172--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Chew:1992:IGP, author = "L. P. Chew and K. Kedem", title = "Improvements on Geometric Pattern Matching Problems", journal = j-LECT-NOTES-COMP-SCI, volume = "621", pages = "318--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Chia-Hsiang:1992:RED, author = "Chang Chia-Hsiang and Robert Paige", title = "From Regular Expressions to {DFA's} Using Compressed {NFA's}", journal = j-LECT-NOTES-COMP-SCI, volume = "644", pages = "88--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @InProceedings{Cole:1992:TBE, author = "R. Cole and R. Hariharan", title = "Tighter bounds on the exact complexity of string matching", crossref = "IEEE:1992:ASF", pages = "600--609", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Crochemore:1992:FSI, author = "M. Crochemore", title = "Foreword to the {Special Issue on Selected Papers of the Combinatorial Pattern Matching School, Paris, July 1990}", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "1--??", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Fri Nov 21 19:16:33 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", } @Article{Crochemore:1992:NTD, author = "M. Crochemore and W. Rytter", title = "Note on Two-Dimensional Pattern Matching by Optimal Parallel Algorithms", journal = j-LECT-NOTES-COMP-SCI, volume = "654", pages = "100--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Crochemore:1992:SMO, author = "M. Crochemore", title = "String-matching on ordered alphabets", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "33--47", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory); C6130 (Data handling techniques)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "LITP, Paris Univ., France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "complexity; computational complexity; constant space; data handling; linear time; memory locations; ordered alphabets; pattern recognition; search problems; string-matching algorithm; time-space optimal", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @InProceedings{Farnum:1992:PBT, author = "Charles Farnum", title = "Pattern-based tree attribution", crossref = "ACM:1992:CRN", pages = "211--222", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p211-farnum/", abstract = "Attribute grammars have been used for many language-oriented tasks, including the formal description of semantics and the implementation of compilation tasks from simple type checking through code generation. Despite their successful use, attribute grammars have some disadvantages, including the monolithic nature of the grammar and the fixed factoring of all attribute descriptions by a single set of grammar productions. {\em Attribute pattern sets\/} provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis. Attribute pattern sets can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system, making it straightforward to convert many of the practical results from attribute grammar theory to similar results for attribute pattern sets.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @InProceedings{Farnum:1992:PTA, author = "Charles Farnum", title = "Pattern-based tree attribution", crossref = "ACM:1992:CRN", pages = "211--222", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p211-farnum/", abstract = "Attribute grammars have been used for many language-oriented tasks, including the formal description of semantics and the implementation of compilation tasks from simple type checking through code generation. Despite their successful use, attribute grammars have some disadvantages, including the monolithic nature of the grammar and the fixed factoring of all attribute descriptions by a single set of grammar productions. {\em Attribute pattern sets\/} provide a more expressive attribution system by using pattern matching, instead of grammar productions, to perform case analysis. Attribute pattern sets can be implemented in terms of attribute grammars in a way that maintains the dependency structure of the attribute system, making it straightforward to convert many of the practical results from attribute grammar theory to similar results for attribute pattern sets.", acknowledgement = ack-nhfb, keywords = "algorithms; languages; verification", subject = "{\bf F.4.2} Theory of Computation, MATHEMATICAL LOGIC AND FORMAL LANGUAGES, Grammars and Other Rewriting Systems, Grammar types. {\bf G.2.2} Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Trees. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Type structure.", } @Book{Frakes:1992:IRD, editor = "William B. Frakes and Ricardo Baeza-Yates", title = "Information Retrieval: Data Structures and Algorithms", publisher = pub-PH, address = pub-PH:adr, pages = "viii + 504", year = "1992", ISBN = "0-13-463837-9", ISBN-13 = "978-0-13-463837-9", LCCN = "QA76.9.D351543 1992", bibdate = "Wed May 18 19:05:15 1994", bibsource = "https://www.math.utah.edu/pub/tex/bib/hash.bib; https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", price = "US\$56.00", acknowledgement = ack-nhfb, libnote = "Not in my library.", tableofcontents = "Introduction to information storage and retrieval systems / W. B. Frakes \\ Introduction to data structures and algorithms related to information retrieval / R. S. Baeza-Yates \\ Inverted files / D. Harman [and others] \\ Signature files / C. Faloutsos \\ New indices for text: PAT trees and PAT arrays / G. H. Gonnet, R. A. Baeza-Yates, T. Snider \\ File organizations for optical disks / D. A. Ford, S. Christodoulakis \\ Lexical analysis and stoplists / C. Fox \\ Stemming algorithms / W. B. Frakes \\ Thesaurus construction / P. Srinivasan \\ String searching algorithms / R. A. Baeza-Yates \\ Relevance feedback and other query modification techniques / D. Harman \\ Boolean operations / S. Wartik \\ Hashing algorithms / S. Wartik [and others] \\ Ranking algorithms / D. Harman \\ Extended Boolean models / E. Fox [and others] \\ Clustering algorithms / E. Rasmussen \\ Special-purpose hardware for information retrieval / L. Hollaar \\ Parallel information retrieval algorithms / C. Stanfill", } @Article{Fraser:1992:ESE, author = "Christopher W. Fraser and David R. Hanson and Todd A. Proebsting", title = "Engineering a simple, efficient code-generator generator", journal = j-LOPLAS, volume = "1", number = "3", pages = "213--226", month = sep, year = "1992", CODEN = "ALPSE8", DOI = "https://doi.org/10.1145/151640.151642", ISSN = "1057-4514 (print), 1557-7384 (electronic)", ISSN-L = "1057-4514", bibdate = "Fri Feb 17 18:41:11 2006", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://storage.webhop.net/documents/iburg.pdf; http://www.acm.org/pubs/toc/Abstracts/1057-4514/151642.html; http://www.cs.princeton.edu/software/iburg/", abstract = "Many code-generator generators use tree pattern matching and dynamic programming. This paper describes a simple program that generates matchers that are fast, compact, and easy to understand. It is simpler than common alternatives: 200-700 lines of Icon or 950 lines of C versus 3000 lines of C for Twig and 5000 for burg. Its matchers run up to 25 times faster than Twig's. They are necessarily slower than burg's BURS (bottom-up rewrite system) matchers, but they are more flexible and still practical.", acknowledgement = ack-nhfb, fjournal = "ACM Letters on Programming Languages and Systems (LOPLAS)", keywords = "languages", subject = "{\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Code generation. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Compilers.", } @InProceedings{Galil:1992:CTO, author = "Zvi Galil", title = "A constant-time optimal parallel string-matching algorithm", crossref = "ACM:1992:PTF", pages = "69--76", year = "1992", bibdate = "Wed Feb 20 18:34:00 MST 2002", bibsource = "http://portal.acm.org/; http://www.acm.org/pubs/contents/proceedings/series/stoc/; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/stoc/129712/p69-galil/p69-galil.pdf; http://www.acm.org/pubs/citations/proceedings/stoc/129712/p69-galil/", acknowledgement = ack-nhfb, } @Article{Galil:1992:ECS, author = "Zvi Galil and Raffaele Giancarlo", title = "On the Exact Complexity of String Matching: Upper Bounds", journal = j-SIAM-J-COMPUT, volume = "21", number = "3", pages = "407--437", month = jun, year = "1992", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", ISSN-L = "0097-5397", MRclass = "68Q20 (68Q25 68U15)", MRnumber = "93g:68051", MRreviewer = "D. M. Campbell", bibdate = "Mon Nov 29 11:02:00 MST 2010", bibsource = "http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP/21/3; https://www.math.utah.edu/pub/tex/bib/siamjcomput.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "SIAM Journal on Computing", journal-URL = "http://epubs.siam.org/sicomp", } @InProceedings{Galil:1992:TAI, author = "Z. Galil and K. Park", title = "Truly alphabet-independent two-dimensional pattern matching", crossref = "IEEE:1992:ASF", pages = "247--256", year = "1992", bibdate = "Thu Apr 5 06:13:50 MDT 2001", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, } @Article{Garg:1992:CRE, author = "V. K. Garg and M. T. Ragunath", title = "Concurrent regular expressions and their relationship to {Petri} nets", journal = j-THEOR-COMP-SCI, volume = "96", number = "2", pages = "285--304", day = "13", month = apr, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C4210 (Formal logic); C6110B (Software engineering techniques)", corpsource = "Dept. of Electr. and Comput. Eng., Texas Univ., Austin, TX, USA", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "algebraic systems; concurrent regular expressions; concurrent systems specification; formal languages; formal specification; interleaving; interleaving closure; modular description of languages; Petri nets; renaming; synchronous composition", pubcountry = "Netherlands", treatment = "P Practical; T Theoretical or Mathematical", } @Book{Gilly:1992:UN, author = "Daniel Gilly and {the staff of O'Reilly \ and Associates}", title = "{UNIX} in a Nutshell", publisher = pub-ORA, address = pub-ORA:adr, edition = "Second", year = "1992", ISBN = "1-56592-001-5", ISBN-13 = "978-1-56592-001-9", LCCN = "QA76.76.O63 G55 1992", bibdate = "Tue Dec 14 22:53:27 1993", bibsource = "https://www.math.utah.edu/pub/tex/bib/master.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/unix.bib", acknowledgement = ack-nhfb, shorttableofcontents = "Introduction \\ UNIX commands \\ UNIX shell \\ Bourne shell and Korn shell \\ C shell \\ Pattern matching \\ Emacs editor \\ Vi editor \\ Ex editor \\ Sed editor \\ Awk scripting language", tableofcontents = "Commands and shells \\ Introduction \\ UNIX commands \\ The UNIX shell: an overview \\ The Bourne shell and Korn shell \\ The C shell \\ Text editing \\ Pattern matching \\ The emacs editor \\ The Vi editor \\ The ex editor \\ The sed editor \\ The awk scripting language \\ Text formatting \\ nroff and troff \\ mm macros \\ ms macros \\ me macros \\ Preprocessors \\ Software development \\ The SCCS utility \\ The RCS utility \\ The make utility \\ Program debugging \\ Loose ends \\ ASCII character set", } @InProceedings{Ginsburg:1992:PMR, author = "Seymour Ginsburg and Xiaoyang Wang", title = "Pattern matching by {Rs}-operations: towards a unified approach to querying sequenced data", crossref = "ACM:1992:PPE", pages = "293--300", year = "1992", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; https://www.math.utah.edu/pub/tex/bib/pods.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/pods/137097/p293-ginsburg/p293-ginsburg.pdf; http://www.acm.org/pubs/citations/proceedings/pods/137097/p293-ginsburg/; http://www.acm.org:80/pubs/citations/proceedings/pods/137097/p293-ginsburg/", abstract = "A family of sequence operations (rs-operations), based on pattern matching and including most of the ``natural'' operations on sequences, is introduced. In order to apply rs-operations to calculus-like query languages, a logic about sequences (SL) is defined by converting rs-operations to special predicates. To illustrate the applicability of our concepts to database queries, rs-operations and SL are used in an algebra and a calculus, respectively, over an extended relational data model containing sequences.", acknowledgement = ack-nhfb, generalterms = "Languages; Theory", keywords = "languages; theory", subject = "{\bf H.2.3} Information Systems, DATABASE MANAGEMENT, Languages, Query languages. {\bf H.2.1} Information Systems, DATABASE MANAGEMENT, Logical Design, Data models. {\bf F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching.", } @Article{Grosch:1992:TAT, author = "Josef Grosch", title = "Transformation of Attributed Trees Using Pattern Matching", journal = j-LECT-NOTES-COMP-SCI, volume = "641", pages = "1--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Gudeman:1992:DSG, author = "David A. Gudeman", title = "Denotational Semantics of a Goal-Directed Language", journal = j-TOPLAS, volume = "14", number = "1", pages = "107--125", month = jan, year = "1992", CODEN = "ATPSDT", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Fri Jan 5 07:58:42 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0164-0925/104659.html", abstract = "Goal-directed evaluation is a very expressive programming language paradigm that is supported in relatively few languages. It is characterized by evaluation of expressions in an attempt to meet some goal, with resumption of previous expressions on failure. This paradigm is found in SNOBL4 in its pattern-matching facilities, and in Icon as a general part of the language. This paper presents a denotational semantics of Icon and shows how Icon is in fact a combination of two distinct paradigms, goal-directed evaluation and functional application. The two paradigms are not supported separately in different contexts, but integrated fully into a single evaluation mechanism.", acknowledgement = ack-nhfb # " and " # ack-pb, fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", keywords = "languages; theory", subject = "{\bf F.3.2}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Semantics of Programming Languages, Denotational semantics. {\bf D.3.1}: Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, Nonprocedural languages. {\bf D.3.2}: Software, PROGRAMMING LANGUAGES, Language Classifications, ICON. {\bf D.3.3}: Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Control structures. {\bf F.3.3}: Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Control primitives.", } @Article{Gusfield:1992:EAA, author = "Dan Gusfield and Gad M. Landau and Baruch Schieber", title = "An efficient algorithm for the {All Pairs Suffix --- Prefix Problem}", journal = j-INFO-PROC-LETT, volume = "41", number = "4", pages = "181--185", day = "18", month = mar, year = "1992", CODEN = "IFPLAT", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Wed Nov 11 12:16:26 MST 1998", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/infoproc1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Univ of California at Davis", affiliationaddress = "Davis, CA, USA", classification = "723; C4240 (Programming and algorithm theory)", corpsource = "Div. of Comput. Sci., California Univ., Davis, CA, USA", fjournal = "Information Processing Letters", journal-URL = "http://www.sciencedirect.com/science/journal/00200190", journalabr = "Inf Process Lett", keywords = "Algorithms; all pairs suffix-prefix problem; computational complexity; Computer Metatheory --- Computational Complexity; Computer Programming; fixed alphabet; longest suffix; programming theory; String Matching; Suffix-Prefix Matching", treatment = "T Theoretical or Mathematical", } @InProceedings{Hanson:1992:RCT, author = "Eric N. Hanson", title = "Rule condition testing and action execution in {Ariel}", crossref = "Stonebraker:1992:PAS", pages = "49--58", year = "1992", bibdate = "Wed Oct 25 12:40:13 MDT 2000", bibsource = "http://www.acm.org/pubs/contents/proceedings/series/sigmod_pods/; https://www.math.utah.edu/pub/tex/bib/pods.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/articles/proceedings/mod/130283/p49-hanson/p49-hanson.pdf; http://www.acm.org/pubs/citations/proceedings/mod/130283/p49-hanson/", abstract = "This paper describes testing of rule conditions and execution of rule actions in Ariel active DBMS. The Ariel rule system is tightly coupled with query and update processing. Ariel rules can have conditions based on a mix of patterns, events, and transitions. For testing rule conditions, Ariel makes use of a discrimination network composed of a special data structure for testing single-relation selection conditions efficiently, and a modified version of the TREAT algorithm, called A-TREAT, for testing join conditions. The key modification to TREAT (which could also be used in the Rete algorithm) is the use of {\em virtual\/}-memory nodes which save storage since they contain only the predicate associated with the memory node instead of copies of data matching the predicate. The rule-action executor in Ariel binds the data matching a rule's condition to the action of the rule at rule fire time, and executes the rule action using the query processor.", acknowledgement = ack-nhfb, generalterms = "Design; Languages; Measurement; Theory", subject = "Information Systems --- Database Management --- Languages (H.2.3); Computing Methodologies --- Artificial Intelligence --- Knowledge Representation Formalisms and Methods (I.2.4)", } @Article{Hashiguchi:1992:TRS, author = "K. Hashiguchi and K. Yamada", title = "Two recognizable string-matching problems over free partially commutative monoids", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "77--86", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4200 (Computer theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Inf. and Comput. Sci., Toyohashi Univ. of Technol., Japan", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "computation theory; constant-size alphabet; free partially commutative monoids; linear-time algorithms; pattern recognition; recognizable string-matching problems; search problems", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Heering:1992:IGL, author = "J. Heering and P. Klint and J. Rekers", title = "Incremental Generation of Lexical Scanners", journal = j-TOPLAS, volume = "14", number = "4", pages = "490--520", month = oct, year = "1992", CODEN = "ATPSDT", ISSN = "0164-0925 (print), 1558-4593 (electronic)", ISSN-L = "0164-0925", bibdate = "Fri Jan 5 07:58:42 MST 1996", bibsource = "Compiler/TOPLAS.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/toplas.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0164-0925/133240.html", abstract = "It is common practice to specify textual patterns by means of a set of regular expressions and to transform this set into a finite automaton to be used for the scanning of input strings. In many applications, the cost of this preprocessing phase can be amortized over many uses of the constructed automaton. In this paper new techniques for lazy and incremental scanner generation are presented. The lazy technique postpones the construction of parts of the automaton until they are really needed during the scanning of input. The incremental technique allows modifications to the original set of regular expressions to be made and reuses major parts of the previous automaton. This is interesting in applications such as environments for the interactive development of language definitions in which modifications to the definition of lexical syntax and the uses of the generated scanners alternate frequently.", acknowledgement = ack-nhfb # " and " # ack-pb, fjournal = "ACM Transactions on Programming Languages and Systems", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J783", keywords = "algorithms; languages; performance", subject = "{\bf D.1.2}: Software, PROGRAMMING TECHNIQUES, Automatic Programming. {\bf D.3.4}: Software, PROGRAMMING LANGUAGES, Processors, Translator writing systems and compiler generators.", } @Book{Hopcroft:1992:EAF, author = "John E. Hopcroft and Jeffrey D. Ullman", title = "{Einf{\"u}hrung in die Automatentheorie, formale Sprachen und Komplexit{\"a}tstheorie}. ({German}) [{Introduction} to Automata Theory, Formal Languages and Complexity Theory]", publisher = pub-AW, address = pub-AW:adr, edition = "1. Nachdr.", pages = "ix + 461", year = "1992", ISBN = "0-201-02988-X, 3-89319-181-X", ISBN-13 = "978-0-201-02988-8, 978-3-89319-181-9", LCCN = "????", bibdate = "Wed Sep 9 09:30:16 MDT 2020", bibsource = "fsz3950.oclc.org:210/WorldCat; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", series = "Internationale Computer-Bibliothek", acknowledgement = ack-nhfb, language = "German", subject = "Machine theory; Formal languages; Computational complexity; Computational complexity.; Formal languages.; Machine theory.; Automatentheorie; Formale Sprache; Komplexit{\"a}tstheorie; Theoretische Informatik", } @Article{Hudak:1992:RPL, author = "Paul Hudak and Simon Peyton Jones and Philip Wadler and Brian Boutel and Jon Fairbairn and Joseph Fasel and Mar{\'\i}a M. Guzm{\'a}n and Kevin Hammond and John Hughes and Thomas Johnsson and Dick Kieburtz and Rishiyur Nikhil and Will Partain and John Peterson", title = "Report on the programming language {Haskell}: a non-strict, purely functional language (Version 1.2)", journal = j-SIGPLAN, volume = "27", number = "5", pages = "Ri--Rx, R1--R163", month = may, year = "1992", CODEN = "SINODQ", ISSN = "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)", ISSN-L = "0362-1340", bibdate = "Sun Dec 14 09:16:21 MST 2003", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/fparith.bib; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Haskell is a general purpose, purely functional programming language incorporating many recent innovations in programming language research, including higher-order functions, non-strict semantics, static polymorphic typing, user-defined algebraic datatypes, pattern-matching, list comprehensions, a module system, and a rich set of primitive datatypes, including lists, arrays, arbitrary and fixed precision integers, and floating-point numbers. Haskell is both the culmination and solidification of many years of research on functional languages-the design has been influenced by languages as old as ISWIM and as new as Miranda. The report defines the syntax for Haskell programs and an informal abstract semantics for the meaning of such programs.", acknowledgement = ack-nhfb, affiliation = "Yale Univ., New Haven, CT, USA", classification = "C6140D (High level languages)", fjournal = "ACM SIGPLAN Notices", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J706", keywords = "Abstract semantics; Arrays; Fixed precision integers; Floating-point numbers; Functional programming language; Haskell; Higher-order functions; List comprehensions; Lists; Module system; Non-strict semantics; Pattern-matching; Primitive datatypes; Static polymorphic typing; Syntax; User-defined algebraic datatypes", thesaurus = "Functional programming; High level languages", } @Article{Hui:1992:CSS, author = "Lucas C. K. Hui", title = "Color Set Size Problem with Applications to String Matching", journal = j-LECT-NOTES-COMP-SCI, volume = "644", pages = "227--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Jambunathan:1992:DIF, author = "K. Jambunathan and E. Lai and S. L. Hartle and B. L. Button", title = "Development of an intelligent front end using {LISP}", journal = "Applications of Artificial Intelligence in Engineering", pages = "228--243", year = "1992", CODEN = "AAIEEO", bibdate = "Tue Sep 28 07:51:05 MDT 1999", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/common-lisp.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Nottingham Polytechnic", affiliationaddress = "Engl", classification = "631.1; 723.1.1; 723.2; 723.4.1", journalabr = "Appl Artif Intell Eng", keywords = "Advanced information technology; C (programming language); Common Lisp; Computational fluid dynamics (CFD) package; Data structures; Expert systems; Fluid dynamics; Inference engines; Intelligent front end (IFE); Knowledge based systems; Lisp (programming language); Pattern matching; Shell environment", } @Article{Jayaraman:1992:SAL, author = "Bharat Jayaraman", title = "Sublist assertions for listless and lazy evaluation", journal = j-COMP-LANGS, volume = "17", number = "2", pages = "133--146", month = apr, year = "1992", CODEN = "COLADA", ISSN = "0096-0551 (print), 1873-6742 (electronic)", ISSN-L = "0096-0551", bibdate = "Tue Mar 25 14:04:06 MST 1997", bibsource = "Compendex database; https://www.math.utah.edu/pub/tex/bib/complngs.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "State Univ of New York at Buffalo", affiliationaddress = "Buffalo, NY, USA", classcodes = "C6130 (Data handling techniques); C6110L (Logic programming); C6140D (High level languages)", classification = "723.1.1", corpsource = "Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA", fjournal = "Computer Languages", journal-URL = "http://www.sciencedirect.com/science/journal/00960551", journalabr = "Comput Lang", keywords = "answer; eager evaluation; lazy evaluation; list; list pattern; list processing; List processing; List processing languages; list-matching; list-valued function; listless evaluation; listof operation; logic programming; logical form; order; processing; programming languages; PROLOG; Prolog (Programming language); Prolog programming; relational assertions; Relational assertions; sublist assertion; Subset-equational program; unification", treatment = "P Practical", } @InProceedings{Jorgensen:1992:GCL, author = "Jesper J{\o}rgensen", title = "Generating a compiler for a lazy language by partial evaluation", crossref = "ACM:1992:CRN", pages = "258--268", year = "1992", bibdate = "Mon May 3 18:24:44 MDT 1999", bibsource = "http://www.acm.org/pubs/toc/; https://www.math.utah.edu/pub/tex/bib/sigplan1990.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org:80/pubs/citations/proceedings/plan/143165/p258-jorgensen/", abstract = "Compiler generation is often emphasized as being the most important application of partial evaluation. But most of the larger practical applications have, to the best of our knowledge, been outside this field. Especially, no one has generated compilers for languages other than small languages. This paper describes a large application of partial evaluation where a realistic compiler was generated for a strongly typed lazy functional language. The language, that was called BAWL, was modeled after the language in Bird and Wadler [BW88] and is a combinator language with pattern matching, guarded alternatives, local definitions and list comprehensions. The paper describes the most important techniques used, especially the binding time improvements needed in order to get small and efficient target programs. Finally, the performance of the compiler is compared with two compilers for similar languages: Miranda and LML.", acknowledgement = ack-nhfb, keywords = "algorithms; languages", subject = "{\bf D.3.4} Software, PROGRAMMING LANGUAGES, Processors, Compilers. {\bf F.3.3} Theory of Computation, LOGICS AND MEANINGS OF PROGRAMS, Studies of Program Constructs, Functional constructs. {\bf D.3.3} Software, PROGRAMMING LANGUAGES, Language Constructs and Features, Procedures, functions, and subroutines. {\bf D.3.2} Software, PROGRAMMING LANGUAGES, Language Classifications. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Semantics. {\bf D.3.1} Software, PROGRAMMING LANGUAGES, Formal Definitions and Theory, Syntax.", } @Article{Katajainen:1992:ALM, author = "Jyrki Katajainen and Timo Raita", title = "An Analysis of the Longest Match and the Greedy Heuristics in Text Encoding", journal = j-J-ACM, volume = "39", number = "2", pages = "281--294", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128751.html", abstract = "Text compression is often done using a fixed, previously formed dictionary (code book) that expresses which substrings of the text can be replaced by code words. There always exists an optimal solution for text-encoding problem. Due to the long processing times of the various optimal algorithms, several heuristics have been proposed in the literature. In this paper, the worst-case compression gains obtained by the longest match and the greedy heuristics for various types of dictionaries is studied. For general dictionaries, the performance of the heuristics can be almost the weakest possible. In practice, however, the dictionaries have usually properties that lead to a space-optimal or near-space-optimal coding result with the heuristics.", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", keywords = "Algorithms; Data Structures and Algorithms; optimal and heuristic encoding; performance; shortest paths; textual substitution; Theory", subject = "{\bf E.4}: Data, CODING AND INFORMATION THEORY, Data compaction and compression. {\bf G.2.2}: Mathematics of Computing, DISCRETE MATHEMATICS, Graph Theory, Path and circuit problems.", } @Article{Kaufmann:1992:EBM, author = "Matt Kaufmann", title = "An extension of the {Boyer--Moore} Theorem Prover to support first-order quantification", journal = j-J-AUTOM-REASON, volume = "9", number = "3", pages = "355--372", month = dec, year = "1992", CODEN = "JAREEW", DOI = "https://doi.org/10.1007/BF00245295", ISSN = "0168-7433 (print), 1573-0670 (electronic)", ISSN-L = "0168-7433", bibdate = "Sat Apr 2 10:49:35 MDT 2016", bibsource = "https://www.math.utah.edu/pub/tex/bib/jautomreason.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://link.springer.com/article/10.1007/BF00245295", acknowledgement = ack-nhfb, ajournal = "J. Autom. Reason.", fjournal = "Journal of Automated Reasoning", journal-URL = "http://link.springer.com/journal/10817", } @Article{Kim:1992:ASM, author = "J. Y. Kim and J. Shawe-Taylor", title = "An approximate string-matching algorithm", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "107--117", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1160 (Combinatorial mathematics); C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "Dept. of Comput. Sci., R. Holloway and Bedford New Coll., London Univ., UK", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "algorithm theory; approximate searches; approximate string-matching algorithm; attribute-matching algorithms; complexity analysis; computational complexity; data structure; look-up phase; pattern recognition; regularity assumptions; search problems; text string", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Kinber:1992:LCR, author = "Efim Kinber", title = "Learning a Class of Regular Expressions via Restricted Subset Queries", journal = j-LECT-NOTES-COMP-SCI, volume = "642", pages = "232--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Knight:1992:ARE, author = "James R. Knight and Eugene W. Myers", title = "Approximate Regular Expression Pattern Matching with Concave Gap Penalties", journal = j-LECT-NOTES-COMP-SCI, volume = "644", pages = "66--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Kukich:1992:TAC, author = "Karen Kukich", title = "Techniques for Automatically Correcting Words in Text", journal = j-COMP-SURV, volume = "24", number = "4", pages = "377--439", month = dec, year = "1992", CODEN = "CMSVAN", DOI = "https://doi.org/10.1145/146370.146380", ISSN = "0360-0300 (print), 1557-7341 (electronic)", ISSN-L = "0360-0300", bibdate = "Thu Jun 19 09:43:10 MDT 2008", bibsource = "Compendex database; ftp://ftp.ira.uka.de/pub/bibliography/Ai/cmubib.bib; http://www.acm.org/pubs/contents/journals/surveys/; https://www.math.utah.edu/pub/tex/bib/compsurv.bib; https://www.math.utah.edu/pub/tex/bib/spell.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0360-0300/146380.html", abstract = "Research aimed at correcting words in text has focused on three progressively more difficult problems: (1) nonword error detection; (2) isolated-word error correction; and (3) context-dependent word correction. In response to the first problem, efficient pattern matching and $n$-gram analysis techniques have been developed for detecting strings that do not appear in a given word list. In response to the second problem, a variety of general and application-specific spelling correction techniques have been developed. Some of them were based on detailed studies of spelling error patterns. In response to the third problem, a few experiments using natural-language-processing tools or statistical-language models have been carried out. This article surveys documented findings on spelling error patterns, provides descriptions of various nonword detection and isolated-word error correction techniques, reviews the state of the art of context-dependent word correction techniques, and discusses research issues related to all three areas of automatic error correction in text.", acknowledgement = ack-nhfb, affiliation = "Bellcore", affiliationaddress = "Morristown, NJ, USA", classification = "723.1.1; 723.5", fjournal = "ACM Computing Surveys", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J204", journalabr = "ACM Comput Surv", keywords = "$n$-gram analysis; algorithms; Automatic error correction; Computer programming languages; context-dependent spelling correction; Error correction; Error detection; Error patterns; experimentation; grammar checking; human factors; Isolated words; n-gram analysis; natural-language-processing models; neural net classifiers; Optical Character Recognition (OCR); Pattern recognition; performance; spell checking; Spelling correction; spelling error detection; spelling error patterns; statistical-language models; theory; Word correction; Word processing; word recognition and correction", subject = "I.2.6 [Artificial Intelligence]: Learning\emdash connectionism and neural nets; I.2.7 [Artificial Intelligence]: Natural Language Processing\emdash language models; language parsing and understanding; text analysis; I.5.1 [Pattern Recognition]: Models\emdash neural nets; statistical; I.5.4 [Pattern Recognition]: Applications\emdash text processing; I.7.1 [Text Processing]: Text Editing\emdash spelling", } @Article{Lecroq:1992:VBM, author = "T. Lecroq", title = "A variation on the {Boyer--Moore} algorithm", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "119--144", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C4220 (Automata theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "CERIL, Evry, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975/", keywords = "automata theory; Boyer--Moore algorithm; linear-time method; longest prefix; smallest suffix automaton", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Manber:1992:APM, author = "Udi Manber and Sun Wu", title = "Approximate Pattern Matching", journal = j-BYTE, volume = "17", number = "??", pages = "??--??", month = "??", year = "1992", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibdate = "Fri Sep 22 14:23:22 2023", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "BYTE Magazine", } @Article{Manber:1992:SAR, author = "Udi Manber and Sun Wu", title = "Some Assembly Required. Approximate Pattern Matching: Agrep's algorithms let you perform text searches using an approximate pattern", journal = j-BYTE, volume = "17", number = "12", pages = "281--??", month = nov, year = "1992", CODEN = "BYTEDJ", ISSN = "0360-5280 (print), 1082-7838 (electronic)", ISSN-L = "0360-5280", bibdate = "Tue Jan 2 10:01:41 MST 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "BYTE Magazine", } @Article{Muthukrishnan:1992:SMU, author = "S. Muthukrishnan and H. Ramesh", title = "String Matching Under a General Matching Relation", journal = j-LECT-NOTES-COMP-SCI, volume = "652", pages = "356--??", year = "1992", CODEN = "LNCSD9", ISSN = "0020-0190 (print), 1872-6119 (electronic)", ISSN-L = "0020-0190", bibdate = "Mon May 13 11:46:24 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, fjournal = "Lecture Notes in Computer Science", journal-URL = "http://link.springer.com/bookseries/558", } @Article{Myers:1992:FRA, author = "Gene Myers", title = "A Four {Russians} Algorithm for Regular Expression Pattern Matching", journal = j-J-ACM, volume = "39", number = "2", pages = "430--448", month = apr, year = "1992", CODEN = "JACOAH", ISSN = "0004-5411 (print), 1557-735X (electronic)", ISSN-L = "0004-5411", bibdate = "Thu Oct 20 22:42:43 1994", bibsource = "ftp://ftp.ira.uka.de/pub/bibliography/Theory/JACM.bib; https://www.math.utah.edu/pub/tex/bib/jacm.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", URL = "http://www.acm.org/pubs/toc/Abstracts/0004-5411/128755.html", abstract = "Given a regular expression {$R$} of length {$P$} and a word {$A$} of length {$N$}, the membership problem is to determine if {$A$} is in the language denoted by {$R$}. An {$ O(P N / \lg N) $} time algorithm is presented that is based on a {$ \lg N $} speedup of the standard {$ O(P N) $} time simulation of {$R$}'s nondeterministic finite automaton on {$A$} using a combination of the node-listing and ``Four-Russians'' paradigms. This result places a new worst-case upper bound on regular expression pattern matching. Moreover, in practice the method provides an implementation that is faster than existing software for small regular expressions.", acknowledgement = ack-nhfb, fjournal = "Journal of the Association for Computing Machinery", journal-URL = "http://portal.acm.org/browse_dl.cfm?idx=J401", keywords = "Algorithms; finite automaton; Four Russians paradigm; note listing; performance; regular expression; String Processing; Theory", subject = "{\bf F.2.2}: Theory of Computation, ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and Problems, Pattern matching. {\bf I.1.2}: Computing Methodologies, ALGEBRAIC MANIPULATION, Algorithms, Analysis of algorithms. {\bf I.5.0}: Computing Methodologies, PATTERN RECOGNITION, General. {\bf F.1.1}: Theory of Computation, COMPUTATION BY ABSTRACT DEVICES, Models of Computation.", } @Article{Neraud:1992:SMI, author = "J. Neraud and M. Crochemore", title = "A string matching interpretation of the equation $ x^m y^n = z^p $", journal = j-THEOR-COMP-SCI, volume = "92", number = "1", pages = "145--164", day = "06", month = jan, year = "1992", CODEN = "TCSCDI", ISSN = "0304-3975 (print), 1879-2294 (electronic)", ISSN-L = "0304-3975", bibdate = "Sat Nov 22 13:24:22 MST 1997", bibsource = "https://www.math.utah.edu/pub/tex/bib/string-matching.bib; https://www.math.utah.edu/pub/tex/bib/tcs1990.bib", acknowledgement = ack-nhfb, classification = "C1250 (Pattern recognition); C4240P (Parallel programming and algorithm theory)", conflocation = "Paris, France; July 1990", conftitle = "Combinatorial Pattern Matching School", corpsource = "LITP, Rouen Univ., Mont-Saint-Aignan, France", fjournal = "Theoretical Computer Science", journal-URL = "http://www.sciencedirect.com/science/journal/03043975", keywords = "algorithm theory; biprefix code; computational complexity; finite alphabet; maximal factors; NP-complete problem; on-line algorithm; pattern recognition; preprocessing phase; string-matching interpretation; time linear", pubcountry = "Netherlands", treatment = "T Theoretical or Mathematical", } @Article{Ogawa:1992:RDF, author = "R. Ogawa and Y. Kikuchi and K. Takahashi", title = "Recent developments in full text database technologies", journal = j-J-INFO-PROC-SOC-JAPAN, volume = "33", number = "4", pages = "404--412", month = "????", year = "1992", CODEN = "JOSHA4", ISSN = "0447-8053", bibdate = "Wed Sep 11 05:43:28 MDT 1996", bibsource = "https://www.math.utah.edu/pub/tex/bib/sgml.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", abstract = "Discusses CD-ROM; Knuth--Morris--Pratt pattern matching in strings; the Boyer--Moore string searching algorithm; Aho--Corasick string matching; associative memory; variable length don't care; cellular arrays; broadcasting; shift registers; systolic arrays; finite state automata: input control; sequential logic; comparison; dynamic programming; SGML; and PostScript.", acknowledgement = ack-nhfb, affiliation = "NEC Corp., Tokyo, Japan", classification = "C6130D (Document processing techniques); C7250L (Non-bibliographic systems)", fjournal = "Journal of Information Processing Society of Japan = Joho Shori", keywords = "Aho--Corasick string matching; Associative memory; Boyer--Moore string searching algorithm; Broadcasting; CD-ROM; Cellular arrays; Dynamic programming; Finite state automata; Full text database technologies; Input control; Knuth--Morris--Pratt pattern matching; PostScript; Sequential logic; SGML; Shift registers; Systolic arrays; Variable length don't care", language = "Japanese", pubcountry = "Japan", thesaurus = "Cellular arrays; Information retrieval; Information retrieval systems", } @Article{Paredaens:1992:OG, author = "Jan Paredaens and Jan {Van den Bussche} and Marc Andries and Marc Gemis and Marc Gyssens and Inge Thyssens and Dirk {Van Gucht} and Vijay Sarathy and Lawrence Saxton", title = "An overview of {GOOD}", journal = j-SIGMOD, volume = "21", number = "1", pages = "25--31", month = mar, year = "1992", CODEN = "SRECD8", ISSN = "0163-5808 (print), 1943-5835 (electronic)", ISSN-L = "0163-5808", bibdate = "Mon Jan 12 08:45:40 MST 2004", bibsource = "http://portal.acm.org/; https://www.math.utah.edu/pub/tex/bib/sigmod.bib; https://www.math.utah.edu/pub/tex/bib/string-matching.bib", acknowledgement = ack-nhfb, affiliation = "Antwerp Univ., Belgium", classification = "C6160J (Object-oriented databases); C6180 (User interfaces)",