Relevant bibliographies by topics / Regular expressions and languages

Contents

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

Academic literature on the topic 'Regular expressions and languages'

Author: Grafiati
Published: 7 September 2021
Last updated: 4 February 2022

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 and languages.'

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 and languages"

1

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
2

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
3

Nagy, Benedek. "Union-Freeness Revisited — Between Deterministic and Nondeterministic Union-Free Languages." International Journal of Foundations of Computer Science 32, no. 05 (2021): 551–73. http://dx.doi.org/10.1142/s0129054121410070.

Full text
Abstract:
Union-free expressions are regular expressions without using the union operation. Consequently, (nondeterministic) union-free languages are described by regular expressions using only concatenation and Kleene star. The language class is also characterised by a special class of finite automata: 1CFPAs have exactly one cycle-free accepting path from each of their states. Obviously such an automaton has exactly one accepting state. The deterministic counterpart of such class of automata defines the deterministic union-free (d-union-free, for short) languages. In this paper [Formula: see text]-fre
APA, Harvard, Vancouver, ISO, and other styles
4

Barceló, Pablo, Juan Reutter, and Leonid Libkin. "Parameterized regular expressions and their languages." Theoretical Computer Science 474 (February 2013): 21–45. http://dx.doi.org/10.1016/j.tcs.2012.12.036.

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

CÂMPEANU, CEZAR, KAI SALOMAA, and SHENG YU. "A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS." International Journal of Foundations of Computer Science 14, no. 06 (2003): 1007–18. http://dx.doi.org/10.1142/s012905410300214x.

Full text
Abstract:
Regular expressions are used in many practical applications. Practical regular expressions are commonly called "regex". It is known that regex are different from regular expressions. In this paper, we give regex a formal treatment. We make a distinction between regex and extended regex; while regex represent regular languages, extended regex represent a family of languages larger than regular languages. We prove a pumping lemma for the languages expressed by extended regex. We show that the languages represented by extended regex are incomparable with context-free languages and a proper subset
APA, Harvard, Vancouver, ISO, and other styles
6

Kutrib, Martin, and Matthias Wendlandt. "Expressive capacity of subregular expressions." RAIRO - Theoretical Informatics and Applications 52, no. 2-3-4 (2018): 201–18. http://dx.doi.org/10.1051/ita/2018014.

Full text
Abstract:
Different types of subregular expressions are studied. Each type is obtained by either omitting one of the regular operations or replacing it by complementation or intersection. For uniformity and in order to allow non-trivial languages to be expressed, the set of literals is a finite set of words instead of letters. The power and limitations as well as relations with each other are considered, which is often done in terms of unary languages. Characterizations of some of the language families are obtained. A finite hierarchy is shown that reveals that the operation complementation is generally
APA, Harvard, Vancouver, ISO, and other styles
7

Gelle, Kitti, and Szabolcs Iván. "Regular Expressions for Muller Context-Free Languages." Acta Cybernetica 23, no. 1 (2017): 349–69. http://dx.doi.org/10.14232/actacyb.23.1.2017.19.

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

Breveglieri, L. "Fair expressions and regular languages over lists." RAIRO - Theoretical Informatics and Applications 31, no. 1 (1997): 15–66. http://dx.doi.org/10.1051/ita/1997310100151.

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

Sakharov, Alexander. "Annotated regular expressions and input-driven languages." Information Processing Letters 159-160 (July 2020): 105958. http://dx.doi.org/10.1016/j.ipl.2020.105958.

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

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

Dissertations / Theses on the topic "Regular expressions and languages"

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

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
3

Teichmann, Markus. "Expressing Context-Free Tree Languages by Regular Tree Grammars." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-224756.

Full text
Abstract:
In this thesis, three methods are investigated to express context-free tree languages by regular tree grammars. The first method is a characterization. We show restrictions to context-free tree grammars such that, for each restricted context-free tree grammar, a regular tree grammar can be constructed that induces the same tree language. The other two methods are approximations. An arbitrary context-free tree language can be approximated by a regular tree grammar with a restricted pushdown storage. Furthermore, we approximate weighted context-free tree languages, induced by weighted linear non
APA, Harvard, Vancouver, ISO, and other styles
4

Chandrasekhar, Muthyala. "Area efficient PLA's for the recognition of regular expression languages." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=65399.

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

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
6

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
7

Fransson, Tobias. "Simulators for formal languages, automata and theory of computation with focus on JFLAP." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-18351.

Full text
Abstract:
This report discusses simulators in automata theory and which one should be best for use in laboratory assignments. Currently, the Formal Languages, Automata and Theory of Computation course (FABER) at Mälardalen University uses the JFLAP simulator for extra exercises. To see if any other simulators would be useful either along with JFLAP or standalone, tests were made with nine programs that are able to graphically simulate automata and formal languages. This thesis work started by making an overview of simulators currently available.After the reviews it has become clear to the author that JF
APA, Harvard, Vancouver, ISO, and other styles
8

Ulus, Dogan. "Pattern Matching with Time : Theory and Applications." Thesis, Université Grenoble Alpes (ComUE), 2018. http://www.theses.fr/2018GREAM003/document.

Full text
Abstract:
Les systèmes dynamiques présentent des comportements temporels qui peuvent être exprimés sous diverses formes séquentielles telles que des signaux, des ondes, des séries chronologiques et des suites d'événements. Détecter des motifs sur de tels comportements temporels est une tâche fondamentale pour comprendre et évaluer ces systèmes. Étant donné que de nombreux comportements du système impliquent certaines caractéristiques temporelles, le besoin de spécifier et de détecter des motifs de comportements qui implique des exigences de synchronisation, appelées motifs temporisés, est évidente.Cepen
APA, Harvard, Vancouver, ISO, and other styles
9

Berglund, Martin. "Complexities of Order-Related Formal Language Extensions." Doctoral thesis, Umeå universitet, Institutionen för datavetenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-88235.

Full text
Abstract:
The work presented in this thesis discusses various formal language formalisms that extend classical formalisms like regular expressions and context-free grammars with additional abilities, most relating to order. This is done while focusing on the impact these extensions have on the efficiency of parsing the languages generated. That is, rather than taking a step up on the Chomsky hierarchy to the context-sensitive languages, which makes parsing very difficult, a smaller step is taken, adding some mechanisms which permit interesting spatial (in)dependencies to be modeled. The most immediate e
APA, Harvard, Vancouver, ISO, and other styles
10

Teichmann, Markus [Verfasser], Heiko [Akademischer Betreuer] [Gutachter] Vogler, and Frank [Gutachter] Drewes. "Expressing Context-Free Tree Languages by Regular Tree Grammars / Markus Teichmann ; Gutachter: Heiko Vogler, Frank Drewes ; Betreuer: Heiko Vogler." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://d-nb.info/1133109616/34.

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

Books on the topic "Regular expressions and languages"

1

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

Find 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

Automating InDesign with regular expressions. O'Reilly, 2006.

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

Sams teach yourself regular expressions in 10 minutes. Sams, 2004.

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

Habibi, Mehran. Java regular expressions: Taming the java.util.regex engine. Apress, 2004.

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

Friedl, Jeffrey E. F. Mastering Regular Expressions: Powerful techniques for Perl and other tools. Edited by Andy Oram. O'Reilly, 1998.

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

Friedl, Jeffrey E. F. Mastering Regular Expressions: Powerful techniques for Perl and other tools. O'Reilly, 1997.

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

Oram, Andy, ed. Regular Expression: Pocket Reference. 2nd ed. O’Reilly Media, 2009.

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

Regular Expression: Pocket Reference. O’Reilly Media, 2003.

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

Regular expression recipes: A problem-solution approach. Apress, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Regular expressions and languages"

1

Wang, Jiacun, and William Tepfenhart. "Regular Expressions and Languages." In Formal Methods in Computer Science. Chapman and Hall/CRC, 2019. http://dx.doi.org/10.1201/9780429184185-3.

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

Aiken, Alexander, and Brian R. Murphy. "Implementing regular tree expressions." In Functional Programming Languages and Computer Architecture. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3540543961_21.

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

Lopes, Raul, Rodrigo Ribeiro, and Carlos Camarão. "Certified Derivative-Based Parsing of Regular Expressions." In Programming Languages. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-45279-1_7.

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

Baeza-Yates, Ricardo A., and Gaston H. Gonnet. "Efficient text searching of regular expressions." In Automata, Languages and Programming. Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/bfb0035751.

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

Gruber, Hermann, and Stefan Gulan. "Simplifying Regular Expressions." In Language and Automata Theory and Applications. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13089-2_24.

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

Sulzmann, Martin, and Peter Thiemann. "Forkable Regular Expressions." In Language and Automata Theory and Applications. Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30000-9_15.

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

Lee, Jonathan, and Jeffrey Shallit. "Enumerating Regular Expressions and Their Languages." In Implementation and Application of Automata. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/978-3-540-30500-2_2.

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

Gruber, Hermann, Jonathan Lee, and Jeffrey Shallit. "Enumerating regular expressions and their languages." In Handbook of Automata Theory. European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/13.

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

Berglund, Martin, Henrik Björklund, Frank Drewes, Brink van der Merwe, and Bruce Watson. "Cuts in Regular Expressions." In Developments in Language Theory. Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-38771-5_8.

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

Kaminski, Michael, and Tony Tan. "Regular Expressions for Languages over Infinite Alphabets." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-27798-9_20.

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

Conference papers on the topic "Regular expressions and languages"

1

Losemann, Katja. "Foundations of regular expressions in XML schema languages and SPARQL." In the. ACM Press, 2012. http://dx.doi.org/10.1145/2213598.2213609.

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

Alquezar, R., and A. Sanfeliu. "Learning of context-sensitive languages described by augmented regular expressions." In Proceedings of 13th International Conference on Pattern Recognition. IEEE, 1996. http://dx.doi.org/10.1109/icpr.1996.547663.

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

Yongming Li and W. Pedrycz. "Regular expressions with truth values in lattice-monoid and their languages." In IEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04. IEEE, 2004. http://dx.doi.org/10.1109/nafips.2004.1337364.

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

Sakharov, Alexander. "Input-driven regular expressions (vision paper)." In SLE '18: 11th ACM SIGPLAN International Conference on Software Language Engineering. ACM, 2018. http://dx.doi.org/10.1145/3276604.3276606.

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

Chen, Qiaochu, Xinyu Wang, Xi Ye, Greg Durrett, and Isil Dillig. "Multi-modal synthesis of regular expressions." In PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation. ACM, 2020. http://dx.doi.org/10.1145/3385412.3385988.

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

Ribeiro, Rodrigo, and André Du Bois. "Certified Bit-Coded Regular Expression Parsing." In SBLP 2017: 21st Brazilian Symposium on Programming Languages. ACM, 2017. http://dx.doi.org/10.1145/3125374.3125381.

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

Duru, Ismail, Banu Diri, M. Emir Özçevik, Kerim Ataseven, Gülüstan Dogan, and Su White. "Analysis of English Language Groups with Regular Expressions." In 2018 Innovations in Intelligent Systems and Applications Conference (ASYU). IEEE, 2018. http://dx.doi.org/10.1109/asyu.2018.8554018.

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

Ranta, Aarne. "A multilingual natural-language interface to regular expressions." In the International Workshop. Association for Computational Linguistics, 1998. http://dx.doi.org/10.3115/1611533.1611541.

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

Radanne, Gabriel, and Peter Thiemann. "Regenerate: a language generator for extended regular expressions." In GPCE '18: 17th ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences. ACM, 2018. http://dx.doi.org/10.1145/3278122.3278133.

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

Ruiqi Song, Han Liu, and Tianming Xia. "Study on signatures of P2P protocols based on regular expressions." In 2008 International Conference on Audio, Language and Image Processing (ICALIP). IEEE, 2008. http://dx.doi.org/10.1109/icalip.2008.4590279.

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

Reports on the topic "Regular expressions and languages"

1

Leung, Hing. Regular Languages and Finite Automata. The MAA Mathematical Sciences Digital Library, 2013. http://dx.doi.org/10.4169/loci003993.

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

Firoiu, Laura, Tim Oates, and Paul R. Cohen. Learning Regular Languages from Positive Evidence. Defense Technical Information Center, 1998. http://dx.doi.org/10.21236/ada459428.

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

Benson, Vivienne, and Jenny C. Aker. Improving Adult Literacy in Niger Through Mobile Calls to Teachers. Institute of Development Studies and The Impact Initiative, 2021. http://dx.doi.org/10.35648/20.500.12413/11781/ii368.

Full text
Abstract:
In Niger, one of the poorest countries in the world, 85 per cent of adults are unable to read or write, even in local languages. Adult education programmes can be a route to improving adult literacy rates, but non-governmental organisation (NGO) and government schemes are characterised with low enrolment, high dropout, and poor teacher attendance. In partnership with the Ministry of Education, Catholic Relief Services, the Sahel Group, and Tufts University, regular phone calls and motivational support were given to teachers to encourage and monitor attendance of adult education programmes betw
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Regular expressions and languages' 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