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: 29 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 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

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

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
4

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
5

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
6

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
7

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
8

JIRÁSKOVÁ, GALINA, and TOMÁŠ MASOPUST. "COMPLEXITY IN UNION-FREE REGULAR LANGUAGES." International Journal of Foundations of Computer Science 22, no. 07 (2011): 1639–53. http://dx.doi.org/10.1142/s0129054111008933.

Full text
Abstract:
We continue the investigation of union-free regular languages that are described by regular expressions without the union operation. We also define deterministic union-free languages as languages accepted by one-cycle-free-path deterministic finite automata, and show that they are properly included in the class of union-free languages. We prove that (deterministic) union-freeness of languages does not accelerate regular operations, except for the reversal in the nondeterministic case.
APA, Harvard, Vancouver, ISO, and other styles
9

Kaminski, Michael, and Tony Tan. "Regular Expressions for Languages over Infinite Alphabets." Fundamenta Informaticae 69, no. 3 (2006): 301–18. https://doi.org/10.3233/fun-2006-69304.

Full text
Abstract:
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if it is accepted by finite-state unification based automaton – a model of computation that is tightly related to other models of automata over infinite alphabets.
APA, Harvard, Vancouver, ISO, and other styles
10

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

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

1

Soyez-Martin, Claire. "From semigroup theory to vectorization : recognizing regular languages." Electronic Thesis or Diss., Université de Lille (2022-....), 2023. http://www.theses.fr/2023ULILB052.

Full text
Abstract:
L'évaluation efficace des expressions régulières constitue un défi persistant depuis de nombreuses décennies. Au fil du temps, des progrès substantiels ont été réalisés grâce à une variété d'approches, allant de nouveaux et ingénieux algorithmes à des optimisations complexes de bas niveau.Les outils de pointe de ce domaine utilisent ces techniques d'optimisation, et repoussent constamment les limites de leur efficacité. Une avancée notoire réside dans l'intégration de la vectorisation, qui exploite une forme de parallélisme de bas niveau pour traiter l'entrée par blocs, entraînant ainsi d'impo
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

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
4

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
5

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
6

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
7

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
8

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
9

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
10

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

Books on the topic "Regular expressions and languages"

1

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

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

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

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

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

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

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

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. O'Reilly, 1997.

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. Edited by Andy Oram. O'Reilly, 1998.

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

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
10

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

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

Kim, Su-Hyeon, Youngwook Kim, Yo-Sub Han, Hyeonseung Im, and Sang-Ki Ko. "Automated Grading of Regular Expressions." In Programming Languages and Systems. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_4.

Full text
Abstract:
AbstractWith the rapid transition to distance learning, automatic grading software becomes more important to both teachers and students. We study the problem of automatically grading the regular expressions submitted by students in courses related to automata and formal language theory. In order to utilize the semantic information of the regular expression, we define a declarative logic that can be described by regular language and at the same time has natural language characteristics, and use it for the following tasks: 1) to assign partial grades for incorrect regular expressions and 2) to p
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Lall, Ashwin. "Equivalence of Regular Languages and Regular Expressions." In Mathematical Foundations of Computer Science. Chapman and Hall/CRC, 2024. http://dx.doi.org/10.1201/9781003383284-6.

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

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
6

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
7

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
8

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
9

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
10

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

Conference papers on the topic "Regular expressions and languages"

1

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
2

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
3

Melnikov, Boris Feliksovich, and Alexandra Alexandrovna Melnikova. "Pseudoatuomata for generalized regular expressions." In Academician O.B. Lupanov 14th International Scientific Seminar "Discrete Mathematics and Its Applications". Keldysh Institute of Applied Mathematics, 2022. http://dx.doi.org/10.20948/dms-2022-70.

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

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
5

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
6

Amadini, Roberto, and Peter J. Stuckey. "A Regular Matching Constraint for String Variables." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/207.

Full text
Abstract:
Using a regular language as a pattern for string matching is nowadays a common -and sometimes unsafe- operation, provided as a built-in feature by most programming languages. A proper constraint solver over string variables should support most of the operations over regular expressions and related constructs. However, state-of-the-art string solvers natively support only the membership relation of a string variable to a regular language. Here we take a step forward by defining a specialised propagator for the match operation, returning the leftmost position where a pattern can match a given st
APA, Harvard, Vancouver, ISO, and other styles
7

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
8

Valizadeh, Mojtaba, Philip John Gorinski, Ignacio Iacobacci, and Martin Berger. "Correct and Optimal: The Regular Expression Inference Challenge." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/717.

Full text
Abstract:
We propose regular expression inference (REI) as a challenge for code/language modelling, and the wider machine learning community. REI is a supervised machine learning (ML) and program optimisation task, and poses the problem of finding minimal regular expressions from examples: Given two finite sets of strings P and N and a cost function cost(·), the task is to generate an expression r that accepts all strings in P and rejects all strings in N , while no other such expression r′ exists with cost(r′) < cost(r). REI has advantages as a challenge problem: (i) regular expressions are well-kno
APA, Harvard, Vancouver, ISO, and other styles
9

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
10

Jiang, Chengyue, Zijian Jin, and Kewei Tu. "Neuralizing Regular Expressions for Slot Filling." In Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.emnlp-main.747.

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

Shaba, Varteen Hannah. Translating North-Eastern Neo-Aramaic Idioms into English. Institute of Development Studies, 2023. http://dx.doi.org/10.19088/creid.2023.002.

Full text
Abstract:
North-eastern Neo-Aramaic (also known as NENA) languages and literature are a prosperous and encouraging field of research. They abound with oral traditions and expressions that incorporate various spoken forms including everyday language, tales, songs, chants, prayers, proverbs, and more. These are used to transfer culture, knowledge, and community values. Some types of oral forms are idioms and fixed expressions. Idioms are extremely problematic to translate for a number of reasons, including: cultural and linguistic differences between languages; their specific connection to cultural practi
APA, Harvard, Vancouver, ISO, and other styles
4

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
5

Baader, Franz, and Ralf Küsters. Unification in a Description Logic with Transitive Closure of Roles. Aachen University of Technology, 2001. http://dx.doi.org/10.25368/2022.115.

Full text
Abstract:
Unification of concept descriptions was introduced by Baader and Narendran as a tool for detecting redundancies in knowledge bases. It was shown that unification in the small description logic FL₀, which allows for conjunction, value restriction, and the top concept only, is already ExpTime-complete. The present paper shows that the complexity does not increase if one additionally allows for composition, union, and transitive closure of roles. It also shows that matching (which is polynomial in FL₀) is PSpace-complete in the extended description logic. These results are proved via a reduction
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

Borgwardt, Stefan, Walter Forkel, and Alisa Kovtunova. Finding New Diamonds: Temporal Minimal-World Query Answering over Sparse ABoxes. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.223.

Full text
Abstract:
Lightweight temporal ontology languages have become a very active field of research in recent years. Many real-world applications, like processing electronic health records (EHRs), inherently contain a temporal dimension, and require efficient reasoning algorithms. Moreover, since medical data is not recorded on a regular basis, reasoners must deal with sparse data with potentially large temporal gaps. In this paper, we introduce a temporal extension of the tractable language ELH⊥, which features a new class of convex diamond operators that can be used to bridge temporal gaps. We develop a com
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