Relevant bibliographies by topics / Regular expressions

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Regular expressions'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Regular expressions"

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
More sources

Dissertations / Theses on the topic "Regular expressions"

1

Andersson, Adam, and Ludwig Hansson. "Modernizing the Syntax of Regular Expressions." Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-19895.

Full text
Abstract:
Context Writing and working with regular expressions could be a slow and tedious task,which is mainly because of its syntax, but also because there exist several different dialectswhich easily could cause confusion. Even though regular expression has been widely used forparsing and programming language design, they are now frequently used for input validationand seen in common applications such as text editors. Objectives The main objectives of our thesis are to determine whether or not a regularexpression language that is more like the surrounding programming language would increaseusability,
APA, Harvard, Vancouver, ISO, and other styles
2

Micciancio, Daniele. "The validity problem for extended regular expressions." Thesis, Massachusetts Institute of Technology, 1996. http://hdl.handle.net/1721.1/11046.

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

Weidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic." Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.

Full text
Abstract:
The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking. Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obt
APA, Harvard, Vancouver, ISO, and other styles
4

Feng, Yuan. "Improve Data Quality By Using Dependencies And Regular Expressions." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-35620.

Full text
Abstract:
The objective of this study has been to answer the question of finding ways to improve the quality of database. There exists a lot of problems of the data stored in the database, like missing or spelling errors. To deal with the dirty data in the database, this study adopts the conditional functional dependencies and regular expressions to detect and correct data. Based on the former studies of data cleaning methods, this study considers the more complex conditions of database and combines the efficient algorithms to deal with the data. The study shows that by using these methods, the database
APA, Harvard, Vancouver, ISO, and other styles
5

Memeti, Suejb. "Automatic Java Code Generator for Regular Expressions and Finite Automata." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20486.

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

Michael, Louis Guy IV. "Exploring the Process and Challenges of Programming with Regular Expressions." Thesis, Virginia Tech, 2019. http://hdl.handle.net/10919/90778.

Full text
Abstract:
Regular expressions (regexes) are a powerful mechanism for solving string-matching problems and are supported by all modern programming languages. While regular expressions are highly expressive, they are also often perceived to be highly complex and hard to read. While existing studies have focused on improving the readability of regular expressions, little is known about any other difficulties that developers face when programming with regular expressions. In this paper, we aim to provide a deeper understanding of the process of programming regular expressions by studying: (1) how developers
APA, Harvard, Vancouver, ISO, and other styles
7

Miklarz, Clément. "Etude d'extensions des langages déterministes." Thesis, Normandie, 2019. http://www.theses.fr/2019NORMR059/document.

Full text
Abstract:
Cette thèse a pour but d’étudier des propriétés structurelles d’automates étendant celle du déterminisme, et les langages pouvant être dénotés par une expression rationnelle dont l’automate des positions présente l’une de ces propriétés. Si Book et al. ont montré que tous les langages rationnels peuvent être reconnus par un automate des positions non-ambigu, Brüggemann-Klein et Wood ont montré que ceux pouvant l’être par un automate des positions déterministe forment une famille strictement incluse dans celle des rationnels. Nous nous intéressons aux extensions de cette famille, en cherchant à
APA, Harvard, Vancouver, ISO, and other styles
8

Duvenage, Eugene. "miRNAMatcher: High throughput miRNA discovery using regular expressions obtained via a genetic algorithm." Thesis, University of the Western Cape, 2008. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_5752_1266536340.

Full text
Abstract:
<p>In summary there currently exist techniques to discover miRNA however both require many calculations to be performed during the identification limiting their use at a genomic level. Machine learning techniques are currently providing the best results by combining a number of calculated and statistically derived features to identify miRNA candidates, however almost all of these still include computationally intensive secondary-structure calculations. It is the aim of this project to produce a miRNA identification process that minimises and simplifies the number of computational elements requ
APA, Harvard, Vancouver, ISO, and other styles
9

Volden, Kjetil. "Compiling Regular Expressions into Non-Deterministic State Machines for Simulation in SystemC." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for elektronikk og telekommunikasjon, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-15083.

Full text
Abstract:
With Moore&#146;s law exponentially increasing the number of transistors on inte-grated circuits, developers fail to keep up. This makes chip area an increasinglycheap resource. At the same time, researchers and developers are trying to findways to dynamically reconfigure FPGAs, preferably at run time, so as to in-crease the flexibility of hardware solutions, and close the gap between the speedof hardware and flexibility of software. A proposed way of solving both of theseissues at once is by using nondeterministic finite-state machines as a fundamen-tal unit of design. This could provide grea
APA, Harvard, Vancouver, ISO, and other styles
10

Aljaloud, Saud. "An investigation into the performance of regular expressions within SPARQL query language." Thesis, University of Southampton, 2019. https://eprints.soton.ac.uk/428044/.

Full text
Abstract:
SPARQL has not simply been the standard querying language for the Resource Description Framework (RDF) within the Semantic Web, but it has also gradually become one of the main querying languages for the graph model, in general. To be able to process SPARQL in a more efficient manner, an RDF store (as a DBMS) has to be used. However, SPARQL faces huge performance challenges for various reasons: the high exibility of RDF model, the fact that the SPARQL standardisation does not always focus on the performance side, or the immaturity of RDF and SPARQL in comparison to some other models such as SQ
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Regular expressions"

1

Krause, Jörg. Introducing Regular Expressions. Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-2508-0.

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

Oram, Andy, ed. Mastering Regular Expressions. 3rd ed. O'Reilly Media, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Oram, Andy, ed. Mastering Regular Expressions. 2nd ed. O'Reilly, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Steven, Levithan, ed. Regular expressions cookbook. Oreilly, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Watt, Andrew. Beginning Regular Expressions. John Wiley & Sons, Ltd., 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Friedl, Jeffrey E. F. Mastering Regular Expressions. 3rd ed. O'Reilly, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Friedl, Jeffrey E. F. Mastering Regular Expressions. 3rd ed. O'Reilly, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Peter, Linsley, ed. Oracle Regular Expressions: Pocket Reference. O'Reilly, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Baeza-Yates, R. Efficient text searching of regular expressions. UW Centre for the New Oxford English Dictionary, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Habibi, Mehran. Java Regular Expressions: Taming the java.util.regex Engine. Apress, 2004. http://dx.doi.org/10.1007/978-1-4302-0709-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Regular expressions"

1

Friesen, Jeff. "Regular Expressions." In Java I/O, NIO and NIO.2. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-1565-4_9.

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

Both, David. "Regular Expressions." In Using and Administering Linux: Volume 2. Apress, 2019. http://dx.doi.org/10.1007/978-1-4842-5455-4_6.

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

Lischner, Ray. "Regular Expressions." In Exploring C++20. Apress, 2020. http://dx.doi.org/10.1007/978-1-4842-5961-0_63.

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

Richardson, Darren, and Paul Milbourne. "Regular Expressions." In Foundation ActionScript 3. Apress, 2014. http://dx.doi.org/10.1007/978-1-4842-0583-9_10.

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

Kromann, Frank M. "Regular Expressions." In PHP and MySQL Recipes. Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-0605-8_9.

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

van Rossum, Joost, and Régis Baccaro. "Regular Expressions." In Extending SSIS with .NET Scripting. Apress, 2015. http://dx.doi.org/10.1007/978-1-4842-0638-6_13.

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

Sharan, Kishori. "Regular Expressions." In Beginning Java 8 Fundamentals. Apress, 2014. http://dx.doi.org/10.1007/978-1-4302-6653-2_14.

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

Mandal, Malay. "Regular Expressions." In Ruby Recipes. Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-2469-4_7.

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

Sinha, Sanjib. "Regular Expressions." In Beginning Ethical Hacking with Python. Apress, 2016. http://dx.doi.org/10.1007/978-1-4842-2541-7_12.

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

Sharan, Kishori. "Regular Expressions." In Beginning Java 9 Fundamentals. Apress, 2017. http://dx.doi.org/10.1007/978-1-4842-2902-6_18.

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

Conference papers on the topic "Regular expressions"

1

Chowdhury, Rahul, M. Rajasekhara Babu, Vatsal Mishra, and Harshit Jain. "Expression of Concern for: Regular expressions in big data analytics." In 2017 International Conference on Intelligent Computing and Control (I2C2). IEEE, 2017. http://dx.doi.org/10.1109/i2c241136.2017.10702661.

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

Figueira, Diego, S. Krishna, Om Swostik Mishra, and Anantha Padmanabha. "Boundedness for Unions of Conjunctive Regular Path Queries over Simple Regular Expressions." In 21st International Conference on Principles of Knowledge Representation and Reasoning {KR-2023}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/kr.2024/34.

Full text
Abstract:
The problem of whether a recursive query can be rewritten as query without recursion is a fundamental reasoning task, known as the boundedness problem. Here we study the boundedness problem for Unions of Conjunctive Regular Path Queries (UCRPQs), a navigational query language extensively used in ontology and graph database querying. The boundedness problem for UCRPQs is known to be decidable, ExpSpace-complete. Here we focus our analysis on UCRPQs using simple regular expressions, which are of high practical relevance and enjoy a lower reasoning complexity. We show that the complexity for the
APA, Harvard, Vancouver, ISO, and other styles
3

Chennupalle, Divya, Thanmai Gaddam, and Kavitha C R. "Intelligent Resume Parser and Classifier Using Regular Expressions." In 2025 Fourth International Conference on Smart Technologies, Communication and Robotics (STCR). IEEE, 2025. https://doi.org/10.1109/stcr62650.2025.11019250.

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

Søgaard, Anders, Hector Martinez, Jakob Elming, and Anders Johannsen. "Using Crowdsourcing to get Representations based on Regular Expressions." In Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2013. http://dx.doi.org/10.18653/v1/d13-1154.

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

Wu, Yun, Shuangbo Cao, Tianyue Liu, Xiao Yang, and Guang Yang. "RegexExplainer: Automatic Description Generation for Regular Expressions via Transformer." In 2024 4th International Conference on Communication Technology and Information Technology (ICCTIT). IEEE, 2024. https://doi.org/10.1109/icctit64404.2024.10928415.

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

Dave, Vrunda, Paul Gastin, and Shankara Narayanan Krishna. "Regular Transducer Expressions for Regular Transformations." In LICS '18: 33rd Annual ACM/IEEE Symposium on Logic in Computer Science. ACM, 2018. http://dx.doi.org/10.1145/3209108.3209182.

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

Sicak, Michal. "Higher order regular expressions." In 2015 13th International Conference on Engineering of Modern Electric Systems (EMES). IEEE, 2015. http://dx.doi.org/10.1109/emes.2015.7158427.

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

Magyar, David, and Sandor Szenasi. "Parsing via Regular Expressions." In 2021 IEEE 19th World Symposium on Applied Machine Intelligence and Informatics (SAMI). IEEE, 2021. http://dx.doi.org/10.1109/sami50585.2021.9378647.

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

Huang, Xiaofeng, Zhiwen Mo, and Lan Shu. "Fuzzy regular tree expressions." In 2013 Joint IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS). IEEE, 2013. http://dx.doi.org/10.1109/ifsa-nafips.2013.6608486.

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

Estrade, Brett D., A. Louise Perkins, and John M. Harris. "Explicitly Parallel Regular Expressions." In 2006 International Multi-Symposiums on Computer and Computational Sciences (IMSCCS). IEEE, 2006. http://dx.doi.org/10.1109/imsccs.2006.60.

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

Reports on the topic "Regular expressions"

1

Hestir, K., and J. Long. Analytical expressions for the permeability of random two-dimensional Poisson fracture networks based on regular lattice percolation and equivalent media theories. Office of Scientific and Technical Information (OSTI), 1990. http://dx.doi.org/10.2172/5923972.

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

Bormann, C., and T. Bray. I-Regexp: An Interoperable Regular Expression Format. RFC Editor, 2023. http://dx.doi.org/10.17487/rfc9485.

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

Chory, Joanne. Signal Transduction Pathways that Regulate CAB Gene Expression. Office of Scientific and Technical Information (OSTI), 2006. http://dx.doi.org/10.2172/862356.

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

Chory, Joanne. Signal Transduction Pathways that Regulate CAB Gene Expression. Office of Scientific and Technical Information (OSTI), 2004. http://dx.doi.org/10.2172/862358.

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

Reecy, James M., та David Morris. β-agonist Regulate Skeletal Actin Gene Expression Post-transcriptionally. Iowa State University, 2004. http://dx.doi.org/10.31274/ans_air-180814-616.

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

Chory, J. Signal transduction pathways that regulate CAB gene expression. Progress report. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10134838.

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

Splitter, Gary, Zeev Trainin, and Yacov Brenner. Lymphocyte Response to Genetically Engineered Bovine Leukemia Virus Proteins in Persistently Lymphocytic Cattle from Israel and the U.S. United States Department of Agriculture, 1995. http://dx.doi.org/10.32747/1995.7570556.bard.

Full text
Abstract:
The goal of this proposal was to identify proteins of BLV recognized by lymphocyte subpopulations and determine the contribution of these proteins to viral pathogenesis. Our hypothesis was that BLV pathogenesis is governed by the T-cell response and that the immune system likely plays an important role in controlling the utcome of infection. Our studies presented in ths final report demonstrate that T cell competency declines with advancing stages of infection. Dramatic differences were observed in lymphocyte proliferation to recombinant proteins encoded by BLV gag (p12, p15, and p24) and env
APA, Harvard, Vancouver, ISO, and other styles
8

McClintock, Martha. Pubertal Social Isolation and Hypervigilance Regulate Gene Expression Mechanisms of Mammary Differentiation and Cancer Risks. Defense Technical Information Center, 2010. http://dx.doi.org/10.21236/ada560196.

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

Barkan, Alice, and Zach Adam. The Role of Proteases in Regulating Gene Expression and Assembly Processes in the Chloroplast. United States Department of Agriculture, 2003. http://dx.doi.org/10.32747/2003.7695852.bard.

Full text
Abstract:
Chloroplasts house many biochemical processes that are essential for plant viability. Foremost, among these is photosynthesis, which requires the protein-rich thylakoid membrane system. The activation of chloroplast genes encoding thylakoid membrane proteins and the targeting and assembly of these proteins together with their nuclear-encoded partners are essential for the elaboration of the thylakoid membrane. Several nuclear-encoded proteins that regulate chloroplast gene expression and that mediate the targeting of proteins to the thylakoid membrane have been identified in recent years, and
APA, Harvard, Vancouver, ISO, and other styles
10

Prusky, Dov, and Jeffrey Rollins. Modulation of pathogenicity of postharvest pathogens by environmental pH. United States Department of Agriculture, 2006. http://dx.doi.org/10.32747/2006.7587237.bard.

Full text
Abstract:
Until recently, environmental pH was not considered a factor in determining pathogen compatibility. Our hypothesis was that the environmental pH at the infection site, which is dynamically controlled by activities of both the host and the pathogen, regulates the expression of genes necessary for disease development in Colletotrichum gloeosporioides and Sclerotinia sclerotiorum. This form of regulation ensures that genes are expressed at optimal conditions for their encoded activities.Pectate lyase encoded by pelB, has been demonstrated to play a key role in virulence of C. gloeosporioides in a
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Regular expressions' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography