To see the other types of publications on this topic, follow the link: Regular expressions.

Journal articles on the topic 'Regular expressions'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

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.

1

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 text
Abstract:
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have <em>lookaheads</em>. We show how to translate regular expressions with lookaheads (<em>REwLA</em>) to equivalent Boolean automata having at most 3 states more than the length of the <em>REwLA</em>. We also investigate the state complexity when translating <em>REwLA </em>to equivalent deterministic finite automata (DFA).
APA, Harvard, Vancouver, ISO, and other styles
2

Monaco, Mike. "Regular Expressions 101." Technical Services Quarterly 35, no. 3 (2018): 305–6. http://dx.doi.org/10.1080/07317131.2018.1456868.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Della 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 text
APA, Harvard, Vancouver, ISO, and other styles
4

Wentworth, E. P. "Generalized regular expressions." ACM SIGPLAN Notices 28, no. 5 (1993): 49–54. http://dx.doi.org/10.1145/152819.152825.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hashiguchi, 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 text
APA, Harvard, Vancouver, ISO, and other styles
6

Deev, 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 text
APA, Harvard, Vancouver, ISO, and other styles
7

Berglund, 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 text
Abstract:
This paper investigates regular expressions which in addition to the standard operators of union, concatenation, and Kleene star, have lookaheads. We show how to translate regular expressions with lookaheads (REwLA) to equivalent Boolean automata having at most 3 states more than the length of the REwLA. We also investigate the state complexity when translating REwLA to equivalent deterministic finite automata (DFA).
APA, Harvard, Vancouver, ISO, and other styles
8

Kahrs, 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 text
APA, Harvard, Vancouver, ISO, and other styles
9

Spinellis, Diomidis. "Refactoring With Regular Expressions." IEEE Software 41, no. 6 (2024): 29–33. http://dx.doi.org/10.1109/ms.2024.3439028.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Xuandong, 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 text
APA, Harvard, Vancouver, ISO, and other styles
11

Sperberg-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 text
APA, Harvard, Vancouver, ISO, and other styles
12

Thomo, 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 text
APA, Harvard, Vancouver, ISO, and other styles
13

Antimirov, 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 text
APA, Harvard, Vancouver, ISO, and other styles
14

KARTTUNEN, 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 text
Abstract:
Many of the processing steps in natural language engineering can be performed using finite state transducers. An optimal way to create such transducers is to compile them from regular expressions. This paper is an introduction to the regular expression calculus, extended with certain operators that have proved very useful in natural language applications ranging from tokenization to light parsing. The examples in the paper illustrate in concrete detail some of these applications.
APA, Harvard, Vancouver, ISO, and other styles
15

Xu, 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 text
Abstract:
Abstract Deterministic regular expressions are a core part of XML Schema and used in other applications. But unlike regular expressions, deterministic regular expressions do not have a simple syntax, instead they are defined in a semantic manner. Moreover, not every regular expression can be rewritten to an equivalent deterministic regular expression. These properties of deterministic regular expressions put a burden on the user to develop XML Schema Definitions and to use deterministic regular expressions. In this paper, we propose a syntax for deterministic standard regular expressions (DREG
APA, Harvard, Vancouver, ISO, and other styles
16

Calvanese, 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 text
APA, Harvard, Vancouver, ISO, and other styles
17

Wesley, 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 text
APA, Harvard, Vancouver, ISO, and other styles
18

Bealle, 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 text
APA, Harvard, Vancouver, ISO, and other styles
19

Chebotarev, 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 text
APA, Harvard, Vancouver, ISO, and other styles
20

Suzuki, 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 text
APA, Harvard, Vancouver, ISO, and other styles
21

Prather, Ronald E. "Regular Expressions for Program Computations." American Mathematical Monthly 104, no. 2 (1997): 120. http://dx.doi.org/10.2307/2974979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
22

Fischer, 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 text
APA, Harvard, Vancouver, ISO, and other styles
23

Pan, 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 text
APA, Harvard, Vancouver, ISO, and other styles
24

Li, 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 text
APA, Harvard, Vancouver, ISO, and other styles
25

Sharpe, D. "Adding regular expressions to Pascal." ACM SIGPLAN Notices 23, no. 12 (1988): 125–33. http://dx.doi.org/10.1145/57669.57682.

Full text
APA, Harvard, Vancouver, ISO, and other styles
26

Gramlich, 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 text
APA, Harvard, Vancouver, ISO, and other styles
27

Howland, 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 text
APA, Harvard, Vancouver, ISO, and other styles
28

Prather, 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 text
APA, Harvard, Vancouver, ISO, and other styles
29

MYERS, 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 text
APA, Harvard, Vancouver, ISO, and other styles
30

Libkin, 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 text
APA, Harvard, Vancouver, ISO, and other styles
31

Brü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 text
APA, Harvard, Vancouver, ISO, and other styles
32

Myers, 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 text
APA, Harvard, Vancouver, ISO, and other styles
33

Corradini, 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 text
APA, Harvard, Vancouver, ISO, and other styles
34

Chida, 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 text
Abstract:
While synthesizing and repairing regular expressions (regexes) based on Programming-by-Examples (PBE) methods have seen rapid progress in recent years, all existing works only support synthesizing or repairing regexes for membership testing, and the support for extraction is still an open problem. This paper fills the void by proposing the first PBE-based method for synthesizing and repairing regexes for extraction. Our work supports regexes that have real-world extensions such as backreferences and lookarounds. The extensions significantly affect the PBE-based synthesis and repair problem. In
APA, Harvard, Vancouver, ISO, and other styles
35

Soufi, 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 text
Abstract:
Generally, programming problems are formally described as function computation problems. In this paper they are viewed as language recognition problems. More precisely, we sugget to specify types, and programs using the concept of languages of concatenation of level n, i.e, languages built from regular languages on which language transformation operations are applied to them. Regular languages denoted by regular expressions allow an easy connection between those languages of concatenation and programming. This connection is naturally done via recurrence relations. We explain our approach throu
APA, Harvard, Vancouver, ISO, and other styles
36

Hashiguchi, 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 text
APA, Harvard, Vancouver, ISO, and other styles
37

BAETEN, 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 text
Abstract:
The languages accepted by finite automata are precisely the languages denoted by regular expressions. In contrast, finite automata may exhibit behaviours that cannot be described by regular expressions up to bisimilarity. In this paper, we consider extensions of the theory of regular expressions with various forms of parallel composition and study the effect on expressiveness. First we prove that adding pure interleaving to the theory of regular expressions strictly increases its expressiveness modulo bisimilarity. Then, we prove that replacing the operation for pure interleaving by ACP-style
APA, Harvard, Vancouver, ISO, and other styles
38

Gruber, 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 text
Abstract:
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and lower bounds on the conversion of finite automata to regular expressions and vice versa. As an interesting special case also one-unambiguous regular expressions, a sort of a deterministic version of a regular expression, are considered. We also briefly recall the known bounds for the removal of spontaneous transitions (ε-transitions) on non-ε-free n
APA, Harvard, Vancouver, ISO, and other styles
39

HOSAYA, HARUO. "Regular expression filters for XML." Journal of Functional Programming 16, no. 6 (2006): 711–50. http://dx.doi.org/10.1017/s0956796806005909.

Full text
Abstract:
XML data are described by types involving regular expressions. This raises the question of what language feature is convenient for manipulating such data. Previously, we have given an answer to this question by proposing regular expression pattern matching. However, since this construct is derived from ML pattern matching, it does not have an iteration functionality in itself, which makes it cumbersome to process data typed by Kleene stars. In this paper, we propose a novel programming feature regular expression filters. This construct extends the previous proposal by permitting pattern clause
APA, Harvard, Vancouver, ISO, and other styles
40

GRUBER, 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 text
Abstract:
Based on recent results from extremal graph theory, we prove that every n-state binary deterministic finite automaton can be converted into an equivalent regular expression of size O(1.742n) using state elimination. Furthermore, we give improved upper bounds on the language operations intersection and interleaving on regular expressions.
APA, Harvard, Vancouver, ISO, and other styles
41

Mamouras, 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 text
Abstract:
Regular expressions are commonly used for finding and extracting matches from sequence data. Due to the inherent ambiguity of regular expressions, a disambiguation policy must be considered for the match extraction problem, in order to uniquely determine the desired match out of the possibly many matches. The most common disambiguation policies are the POSIX policy and the greedy (PCRE) policy. The POSIX policy chooses the longest match out of the leftmost ones. The greedy policy chooses a leftmost match and further disambiguates using a greedy interpretation of Kleene iteration to match as ma
APA, Harvard, Vancouver, ISO, and other styles
42

CHAMPARNAUD, 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 text
Abstract:
In this article we generalize concepts of the position automaton and ZPC-structure to the regular [Formula: see text]-expressions. We show that the extended ZPC-structure can be built in linear time w.r.t. the size of the [Formula: see text]-expression and that the associated position automaton can be deduced from it in quadratic time.
APA, Harvard, Vancouver, ISO, and other styles
43

Nicaud, 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 text
Abstract:
In this article, we study some properties of random regular expressions of size [Formula: see text], when the cardinality of the alphabet also depends on [Formula: see text]. For this, we revisit and improve the classical Transfer Theorem from the field of analytic combinatorics. This provides precise estimations for the number of regular expressions, the probability of recognizing the empty word and the expected number of Kleene stars in a random expression. For all these statistics, we show that there is a threshold when the size of the alphabet approaches [Formula: see text], at which point
APA, Harvard, Vancouver, ISO, and other styles
44

HOLZER, 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 text
Abstract:
We summarize results on the complexity of regular(-like) expressions and tour a fragment of the literature. In particular we focus on the descriptional complexity of the conversion of regular expressions to equivalent finite automata and vice versa, to the computational complexity of problems on regular-like expressions such as, e.g., membership, inequivalence, and non-emptiness of complement, and finally on the operation problem measuring the required size for transforming expressions with additional language operations (built-in or not) into equivalent ordinary regular expressions.
APA, Harvard, Vancouver, ISO, and other styles
45

HAN, 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 text
Abstract:
We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that w
APA, Harvard, Vancouver, ISO, and other styles
46

TAN, 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 text
Abstract:
The standard regular expressions over finite alphabets have been widely accepted as the most basic formalism to query graph databases. However, the major drawback of this approach is that it ignores the presence of data. In this paper we study the so called regular expressions with binding (REWB), that is, regular expressions equipped with variables to store data within a well defined scope. In particular, we study the complexity of the query evaluation of REWB queries over graph databases.
APA, Harvard, Vancouver, ISO, and other styles
47

Wesley, 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 text
Abstract:
The author creates a fictional vignette to illustrate how a medical director can use data analysis to help review cases comparing attending physician statement (APS) values for build vs those reported by the paramedical examiners for the same lives. In this first of two articles, a method for extracting suitable data is explored.
APA, Harvard, Vancouver, ISO, and other styles
48

Getir 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 text
Abstract:
In this article, we introduce a probabilistic verification algorithm for stochastic regular expressions over a probabilistic extension of the Action based Computation Tree Logic (ACTL*). The main results include a novel model checking algorithm and a semantics on the probabilistic action logic for stochastic regular expressions (SREs). Specific to our model checking algorithm is that SREs are defined via local probabilistic functions. Such functions are beneficial since they enable to verify properties locally for sub-components. This ability provides a flexibility to reuse the local results f
APA, Harvard, Vancouver, ISO, and other styles
49

Abahussain, 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 text
APA, Harvard, Vancouver, ISO, and other styles
50

Vilander, 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
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!