Bille, Philip

Online Research Database In Technology

                       General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights.  • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal   If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.     Downloaded from orbit.dtu.dk on: Nov 08, 2017On Regular Expression Matching and Deterministic Finite AutomataBille, PhilipPublished in:Tiny ToCSPublication date:2015Document VersionPublisher's PDF, also known as Version of recordLink back to DTU OrbitCitation (APA):Bille, P. (2015). On Regular Expression Matching and Deterministic Finite Automata. Tiny ToCS , 3, 1.On Regular Expression Matching andDeterministic Finite AutomataPhilip Bille∗Technical University of Denmark, DTU ComputeABSTRACTGiven a regular expression R and a string T the regular expression matching problem is to determineif T matches any string in the language generated by R. The best known solution to the problemuses linear space and O(nm log lognlog3/2 n+n+m)time in the worst-case [2], where m and n are the lengthsof R and T , respectively. A common misconception is that we can solve the problem efficientlyby building a deterministic finite automaton (DFA) for R using 2O(m) space and then run it on Tin O(n) time [1]. However, this analysis completely ignores issues of addressing into exponentialsized data structures. An address in a DFA of size 2Ω(m) requires Ω(m) bits. Hence, on a standardunit-cost word RAM with word length Θ(logn) [3], we need at least Ω(m/ logn) time to simply writean address in the DFA. It follows that traversing the DFA for R uses at least Ω(nm/ logn+n+m)worst-case time (note that we do not even include DFA construction time). This bound can onlybe O(n) when m= O(logn) and is never better than the above best known bound.BODYEven ignoring construction time, deterministic finite automata do not solveregular expression matching in worst-case linear time.REFERENCES[1] Regular expression, Wikipedia. http://en.wikipedia.org/wiki/Regular_expression.Accessed Jan. 2015.[2] P. Bille and M. Thorup. Faster regular expression matching. In Proc. 36th ICALP, pages171–182, 2009.[3] T. Hagerup. Sorting and searching on the word RAM. In Proc. 15th STACS, pages 366–398,1998.∗Supported by the Danish Research Council (DFF 4005-00267, DFF 1323-00178) and the AdvancedTechnology Foundation.Volume 3 of Tiny Transactions on Computer ScienceThis content is released under the Creative Commons Attribution-NonCommercial ShareAlike License. Permission tomake digital or hard copies of all or part of this work is granted without fee provided that copies are not made ordistributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.CC BY-NC-SA 3.0: http://creativecommons.org/licenses/by-nc-sa/3.0/.

On Regular Expression Matching and Deterministic Finite Automata

http://orbit.dtu.dk/ws/files/118471863/TinyToCS_3_bille.pdf

On Regular Expression Matching and Deterministic Finite Automata

Abstract

Similar works

Full text

Available Versions

Online Research Database In Technology