Journal articles on the topic 'Regular expressions'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Regular expressions.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Berglund, Martin, der Merwe Brink van, and Litsenborgh Steyn van. "Regular Expressions with Lookahead." JUCS - Journal of Universal Computer Science 27, no. (4) (2021): 324–40. https://doi.org/10.3897/jucs.66330.
Full textMonaco, Mike. "Regular Expressions 101." Technical Services Quarterly 35, no. 3 (2018): 305–6. http://dx.doi.org/10.1080/07317131.2018.1456868.
Full textDella Penna, Giuseppe, Benedetto Intrigila, Enrico Tronci, and Marisa Venturini Zilli. "Synchronized regular expressions." Acta Informatica 39, no. 1 (2003): 31–70. http://dx.doi.org/10.1007/s00236-002-0099-y.
Full textWentworth, E. P. "Generalized regular expressions." ACM SIGPLAN Notices 28, no. 5 (1993): 49–54. http://dx.doi.org/10.1145/152819.152825.
Full textHashiguchi, Kosaburo, Yoshito Wada, and Shuji Jimbo. "Regular binoid expressions and regular binoid languages." Theoretical Computer Science 304, no. 1-3 (2003): 291–313. http://dx.doi.org/10.1016/s0304-3975(03)00137-3.
Full textDeev, K. S., and Yu V. Boyko. "Determine point-to-point networking interactions using regular expressions." Odes’kyi Politechnichnyi Universytet. Pratsi, no. 2 (June 15, 2015): 119–23. http://dx.doi.org/10.15276/opu.2.46.2015.21.
Full textBerglund, Martin, Brink van der Merwe, and Steyn van Litsenborgh. "Regular Expressions with Lookahead." JUCS - Journal of Universal Computer Science 27, no. 4 (2021): 324–40. http://dx.doi.org/10.3897/jucs.66330.
Full textKahrs, Stefan, and Colin Runciman. "Simplifying regular expressions further." Journal of Symbolic Computation 109 (March 2022): 124–43. http://dx.doi.org/10.1016/j.jsc.2021.08.003.
Full textSpinellis, Diomidis. "Refactoring With Regular Expressions." IEEE Software 41, no. 6 (2024): 29–33. http://dx.doi.org/10.1109/ms.2024.3439028.
Full textXuandong, Li, Zhao Jianhua, Zheng Tao, Li Yong, and Zheng Guoliang. "Duration-constrained regular expressions." Formal Aspects of Computing 16, no. 2 (2004): 155–63. http://dx.doi.org/10.1007/s00165-004-0033-x.
Full textSperberg-McQueen, C. M. "Regular expressions for dates." Markup Languages: Theory and Practice 1, no. 4 (1999): 20–26. http://dx.doi.org/10.1162/109966299760283166.
Full textThomo, Alex. "Implication of regular expressions." Applied Mathematics Letters 25, no. 10 (2012): 1394–98. http://dx.doi.org/10.1016/j.aml.2011.12.009.
Full textAntimirov, Valentin M., and Peter D. Mosses. "Rewriting extended regular expressions." Theoretical Computer Science 143, no. 1 (1995): 51–72. http://dx.doi.org/10.1016/0304-3975(95)80024-4.
Full textKARTTUNEN, L., J.-P. CHANOD, G. GREFENSTETTE, and A. SCHILLE. "Regular expressions for language engineering." Natural Language Engineering 2, no. 4 (1996): 305–28. http://dx.doi.org/10.1017/s1351324997001563.
Full textXu, Zhiwu, Ping Lu, and Haiming Chen. "Towards an Effective Syntax and a Generator for Deterministic Standard Regular Expressions." Computer Journal 62, no. 9 (2018): 1322–41. http://dx.doi.org/10.1093/comjnl/bxy110.
Full textCalvanese, Diego, Giuseppe De Giacomo, Maurizio Lenzerini, and Moshe Y. Vardi. "Rewriting of Regular Expressions and Regular Path Queries." Journal of Computer and System Sciences 64, no. 3 (2002): 443–65. http://dx.doi.org/10.1006/jcss.2001.1805.
Full textWesley, David. "Regular Expressions: Mixed Effects Models." Journal of Insurance Medicine 47, no. 1 (2017): 23–30. http://dx.doi.org/10.17849/insm-47-01-23-30.1.
Full textBealle, John. "Saving time with regular expressions." Indexer: The International Journal of Indexing 29, no. 2 (2011): 70–72. http://dx.doi.org/10.3828/indexer.2011.16.
Full textChebotarev, A. N. "Intersection of -ω-Regular Expressions". Cybernetics and Systems Analysis 57, № 5 (2021): 676–84. http://dx.doi.org/10.1007/s10559-021-00393-3.
Full textSuzuki, Taro, and Satoshi Okui. "Product Derivatives of Regular Expressions." IPSJ Online Transactions 1 (2008): 53–65. http://dx.doi.org/10.2197/ipsjtrans.1.53.
Full textPrather, Ronald E. "Regular Expressions for Program Computations." American Mathematical Monthly 104, no. 2 (1997): 120. http://dx.doi.org/10.2307/2974979.
Full textFischer, Sebastian, Frank Huch, and Thomas Wilke. "A play on regular expressions." ACM SIGPLAN Notices 45, no. 9 (2010): 357–68. http://dx.doi.org/10.1145/1932681.1863594.
Full textPan, Rong, Qinheping Hu, Gaowei Xu, and Loris D'Antoni. "Automatic repair of regular expressions." Proceedings of the ACM on Programming Languages 3, OOPSLA (2019): 1–29. http://dx.doi.org/10.1145/3360565.
Full textLi, Zeyu, Hongzhi Wang, Wei Shao, Jianzhong Li, and Hong Gao. "Repairing data through regular expressions." Proceedings of the VLDB Endowment 9, no. 5 (2016): 432–43. http://dx.doi.org/10.14778/2876473.2876478.
Full textSharpe, D. "Adding regular expressions to Pascal." ACM SIGPLAN Notices 23, no. 12 (1988): 125–33. http://dx.doi.org/10.1145/57669.57682.
Full textGramlich, Gregor, and Georg Schnitger. "Minimizing nfa's and regular expressions." Journal of Computer and System Sciences 73, no. 6 (2007): 908–23. http://dx.doi.org/10.1016/j.jcss.2006.11.002.
Full textHowland, Eric. "Regular expressions for checking dates." Markup Languages: Theory and Practice 2, no. 2 (2000): 126–32. http://dx.doi.org/10.1162/10996620052104258.
Full textPrather, Ronald E. "Regular Expressions for Program Computations." American Mathematical Monthly 104, no. 2 (1997): 120–30. http://dx.doi.org/10.1080/00029890.1997.11990610.
Full textMYERS, E., and W. MILLER. "Approximate matching of regular expressions." Bulletin of Mathematical Biology 51, no. 1 (1989): 5–37. http://dx.doi.org/10.1016/s0092-8240(89)80046-1.
Full textLibkin, Leonid, Tony Tan, and Domagoj Vrgoč. "Regular expressions for data words." Journal of Computer and System Sciences 81, no. 7 (2015): 1278–97. http://dx.doi.org/10.1016/j.jcss.2015.03.005.
Full textBrüggemann-Klein, Anne. "Regular expressions into finite automata." Theoretical Computer Science 120, no. 2 (1993): 197–213. http://dx.doi.org/10.1016/0304-3975(93)90287-4.
Full textMyers, Eugene W., and Webb Miller. "Approximate matching of regular expressions." Bulletin of Mathematical Biology 51, no. 1 (1989): 5–37. http://dx.doi.org/10.1007/bf02458834.
Full textCorradini, Flavio, Rocco De Nicola, and Anna Labella. "Models of Nondeterministic Regular Expressions." Journal of Computer and System Sciences 59, no. 3 (1999): 412–49. http://dx.doi.org/10.1006/jcss.1999.1636.
Full textChida, Nariyoshi, and Tachio Terauchi. "Repairing Regular Expressions for Extraction." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1633–56. http://dx.doi.org/10.1145/3591287.
Full textSoufi, Loutfi. "Type Specification by Regular Expressions." JUCS - Journal of Universal Computer Science 5, no. (9) (1999): 622–31. https://doi.org/10.3217/jucs-005-09-0622.
Full textHashiguchi, Kosaburo, Naoto Sakakibara, and Shuji Jimbo. "Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids." Theoretical Computer Science 312, no. 2-3 (2004): 251–66. http://dx.doi.org/10.1016/j.tcs.2003.09.005.
Full textBAETEN, JOS C. M., BAS LUTTIK, TIM MULLER, and PAUL VAN TILBURG. "Expressiveness modulo bisimilarity of regular expressions with parallel composition." Mathematical Structures in Computer Science 26, no. 6 (2015): 933–68. http://dx.doi.org/10.1017/s0960129514000309.
Full textGruber, Hermann, and Markus Holzer. "From Finite Automata to Regular Expressions and Back — A Summary on Descriptional Complexity." International Journal of Foundations of Computer Science 26, no. 08 (2015): 1009–40. http://dx.doi.org/10.1142/s0129054115400110.
Full textHOSAYA, HARUO. "Regular expression filters for XML." Journal of Functional Programming 16, no. 6 (2006): 711–50. http://dx.doi.org/10.1017/s0956796806005909.
Full textGRUBER, HERMANN, and MARKUS HOLZER. "PROVABLY SHORTER REGULAR EXPRESSIONS FROM FINITE AUTOMATA." International Journal of Foundations of Computer Science 24, no. 08 (2013): 1255–79. http://dx.doi.org/10.1142/s0129054113500330.
Full textMamouras, Konstantinos, Alexis Le Glaunec, Wu Angela Li, and Agnishom Chattopadhyay. "Static Analysis for Checking the Disambiguation Robustness of Regular Expressions." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 2073–97. http://dx.doi.org/10.1145/3656461.
Full textCHAMPARNAUD, JEAN-MARC, ÉRIC LAUGEROTTE, FAISSAL OUARDI, and DJELLOUL ZIADI. "FROM REGULAR WEIGHTED EXPRESSIONS TO FINITE AUTOMATA." International Journal of Foundations of Computer Science 15, no. 05 (2004): 687–700. http://dx.doi.org/10.1142/s0129054104002698.
Full textNicaud, Cyril, and Pablo Rotondo. "Random Regular Expression Over Huge Alphabets." International Journal of Foundations of Computer Science 32, no. 05 (2021): 419–38. http://dx.doi.org/10.1142/s012905412141001x.
Full textHOLZER, MARKUS, and MARTIN KUTRIB. "THE COMPLEXITY OF REGULAR(-LIKE) EXPRESSIONS." International Journal of Foundations of Computer Science 22, no. 07 (2011): 1533–48. http://dx.doi.org/10.1142/s0129054111008866.
Full textHAN, YO-SUB, YAJUN WANG, and DERICK WOOD. "INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES." International Journal of Foundations of Computer Science 17, no. 02 (2006): 379–93. http://dx.doi.org/10.1142/s0129054106003887.
Full textTAN, TONY, and DOMAGOJ VRGOČ. "REGULAR EXPRESSIONS FOR QUERYING DATA GRAPHS." International Journal of Foundations of Computer Science 25, no. 08 (2014): 971–85. http://dx.doi.org/10.1142/s0129054114400188.
Full textWesley, David. "Regular Expressions: The Build Study Vignette." Journal of Insurance Medicine 46, no. 1 (2016): 20–26. http://dx.doi.org/10.17849/0743-6661-46.1.20.
Full textGetir Yaman, Sinem, Esteban Pavese, and Lars Grunske. "Quantitative Verification of Stochastic Regular Expressions." Fundamenta Informaticae 179, no. 2 (2021): 135–63. http://dx.doi.org/10.3233/fi-2021-2018.
Full textAbahussain, Omar, Mustafa Hammad, and Fawzi Albalooshi. "Software Security Validation through Regular Expressions." International Journal of Computing and Digital Systems 11, no. 1 (2022): 695–702. http://dx.doi.org/10.12785/ijcds/110156.
Full textVilander, Miikka. "Games for Succinctness of Regular Expressions." Electronic Proceedings in Theoretical Computer Science 346 (September 16, 2021): 258–72. http://dx.doi.org/10.4204/eptcs.346.17.
Full text