Log in

Relevant bibliographies by topics / Regular expressions / Dissertations / Theses

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

Dissertations / Theses 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 top 50 dissertations / theses 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 dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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

11

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

12

Davis, James Collins. "On the Impact and Defeat of Regular Expression Denial of Service." Diss., Virginia Tech, 2020. http://hdl.handle.net/10919/98593.

Full text

Abstract:

Regular expressions (regexes) are a widely-used yet little-studied software component. Engineers use regexes to match domain-specific languages of strings. Unfortunately, many regex engine implementations perform these matches with worst-case polynomial or exponential time complexity in the length of the string. Because they are commonly used in user-facing contexts, super-linear regexes are a potential denial of service vector known as Regular expression Denial of Service (ReDoS). Part I gives the necessary background to understand this problem. In Part II of this dissertation, I present the

APA, Harvard, Vancouver, ISO, and other styles

13

Kovařík, David. "Automatická identifikace šablony generující spam kampaně." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2018. http://www.nusl.cz/ntk/nusl-385921.

Full text

Abstract:

Spam se typicky nevyskytuje ve formě samostatných zpráv, ale často bývá sdružován do takzvaných kampaní. Ty bývají automaticky generovány pomocí šablon. Díky tomu jsou jednotlivé zprávy sémanticky, ale ne syntakticky, ekvivalentní. Cílem práce je navrhnout algoritmus schopný z množiny zpráv jedné kampaně zpětně extrahovat šablonu, ze které tyto zprávy byly generovány. Práce se zaměřuje na spam v SMS komunikaci, ale navržené postupy jsou dostatečně obecné pro širší použití. Algoritmus je postaven na metodě zarovnávání dvou sekvencí, používané v bioinformatice pro nalezení podobných oblastí prot

APA, Harvard, Vancouver, ISO, and other styles

14

Strauss, Marthinus David. "Process-based decomposition and multicore performance : case studies from Stringology." Thesis, University of Pretoria, 2017. http://hdl.handle.net/2263/61273.

Full text

Abstract:

Current computing hardware supports parallelism at various levels. Conventional programming techniques, however, do not utilise efficiently this growing resource. This thesis seeks a better fit between software and current hardware while following a hardware-agnostic software development approach. This allows the programmer to remain focussed on the problem domain. The thesis proposes process-based problem decomposition as a natural way to structure a concurrent implementation that may also improve multicore utilisation and, consequently, run-time performance. The thesis presents four alg

APA, Harvard, Vancouver, ISO, and other styles

15

Gulan, Stefan [Verfasser], and Henning [Akademischer Betreuer] Fernau. "On the Relative Descriptional Complexity of Regular Expressions and Finite Automata / Stefan Gulan ; Betreuer: Henning Fernau." Trier : Universität Trier, 2012. http://d-nb.info/1197697942/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Siau, Nor Zainah. "A teachable semi-automatic web information extraction system based on evolved regular expression patterns." Thesis, Loughborough University, 2014. https://dspace.lboro.ac.uk/2134/14687.

Full text

Abstract:

This thesis explores Web Information Extraction (WIE) and how it has been used in decision making and to support businesses in their daily operations. The research focuses on a WIE system based on Genetic Programming (GP) with an extensible model to enhance the automatic extractor. This uses a human as a teacher to identify and extract relevant information from the semi-structured HTML webpages. Regular expressions, which have been chosen as the pattern matching tool, are automatically generated based on the training data to provide an improved grammar and lexicon. This particularly benefits t

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

Weidner, Thomas [Verfasser], Manfred [Akademischer Betreuer] Droste, Manfred [Gutachter] Droste, and Benedikt [Gutachter] Bollig. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic / Thomas Weidner ; Gutachter: Manfred Droste, Benedikt Bollig ; Betreuer: Manfred Droste." Leipzig : Universitätsbibliothek Leipzig, 2016. http://d-nb.info/1240627777/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Košař, Vlastimil. "Implementace jednotky pro vyhledávání vzorů v FPGA." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237092.

Full text

Abstract:

This term project focuses on algorithms for pattern matching used in modern IDS. The main focus is on regular expression matching. It deals with methods based on deterministic and nondeterministic finite automata, hybrid methods and with method based on regular expressions as programing langue for specialised processors. Implementation of pattern matching units based on some of described methodologies is described in next part. Methodology for resource consumption estimation is also described. Developed software system for unit generation is described in the next part. In the final part result

APA, Harvard, Vancouver, ISO, and other styles

20

Getir, Yaman Sinem. "Quantitative Modeling and Verification of Evolving Software." Doctoral thesis, Humboldt-Universität zu Berlin, 2021. http://dx.doi.org/10.18452/23310.

Full text

Abstract:

Mit der steigenden Nachfrage nach Innovationen spielt Software in verschiedenenWirtschaftsbereichen eine wichtige Rolle, wie z.B. in der Automobilindustrie, bei intelligenten Systemen als auch bei Kommunikationssystemen. Daher ist die Qualität für die Softwareentwicklung von großer Bedeutung. Allerdings ändern sich die probabilistische Modelle (die Qualitätsbewertungsmodelle) angesichts der dynamischen Natur moderner Softwaresysteme. Dies führt dazu, dass ihre Übergangswahrscheinlichkeiten im Laufe der Zeit schwanken, welches zu erheblichen Problemen führt. Dahingehend werden probabi

APA, Harvard, Vancouver, ISO, and other styles

21

Pellissier, Muriel. "Anomaly detection technique for sequential data." Thesis, Grenoble, 2013. http://www.theses.fr/2013GRENM078/document.

Full text

Abstract:

De nos jours, beaucoup de données peuvent être facilement accessibles. Mais toutes ces données ne sont pas utiles si nous ne savons pas les traiter efficacement et si nous ne savons pas extraire facilement les informations pertinentes à partir d'une grande quantité de données. Les techniques de détection d'anomalies sont utilisées par de nombreux domaines afin de traiter automatiquement les données. Les techniques de détection d'anomalies dépendent du domaine d'application, des données utilisées ainsi que du type d'anomalie à détecter.Pour cette étude nous nous intéressons seulement aux donnée

APA, Harvard, Vancouver, ISO, and other styles

22

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

23

Xhemali, Daniela. "Automated retrieval and extraction of training course information from unstructured web pages." Thesis, Loughborough University, 2010. https://dspace.lboro.ac.uk/2134/7022.

Full text

Abstract:

Web Information Extraction (WIE) is the discipline dealing with the discovery, processing and extraction of specific pieces of information from semi-structured or unstructured web pages. The World Wide Web comprises billions of web pages and there is much need for systems that will locate, extract and integrate the acquired knowledge into organisations practices. There are some commercial, automated web extraction software packages, however their success comes from heavily involving their users in the process of finding the relevant web pages, preparing the system to recognise items of interes

APA, Harvard, Vancouver, ISO, and other styles

24

Miranda, Nuno Filipe Roque. "Normalização automática de descrições de hotéis." Master's thesis, Universidade de Évora, 2010. http://hdl.handle.net/10174/20712.

Full text

Abstract:

As descrições de produtos turísticos na área da hotelaria, aviação, rent-a-car e pacotes de férias baseiam-se sobretudo em descrições textuais em língua natural muito heterogénea com estilos, apresentações e conteúdos muito diferentes entre si. Uma vez que o sector do turismo é bastante dinâmico e que os seus produtos e ofertas estão constantemente em alteração, o tratamento manual de normalização de toda essa informação não é possível. Neste trabalho construiu-se um protótipo que permite a classificação e extracção automática de informação a partir de descrições de produtos de turismo. Inicia

APA, Harvard, Vancouver, ISO, and other styles

25

Bertrand, Clément. "Reconnaissance de motifs dynamiques par automates temporisés à mémoire." Electronic Thesis or Diss., université Paris-Saclay, 2020. http://www.theses.fr/2020UPASG034.

Full text

Abstract:

L'utilisation toujours plus importante de l'informatique et d'internet mène à une génération toujours plus importante de donnés et de communications. Ces données peuvent être par exemple des historiques de communication dans des réseaux sociaux ou encore des traces du trafic internet. De tels historiques de communications sont une forme de graphe dynamique formalisable par des flots de liens. De nombreux travaux s'articulent autour de la supervision et l'analyse de ces systèmes afin de détecter l'apparition de certains phénomènes ou scénarios spécifiques. Par exemple, dans le cadre de la sécur

APA, Harvard, Vancouver, ISO, and other styles

26

Arafailova, Ekaterina. "Functional description of sequence constraints and synthesis of combinatorial objects." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2018. http://www.theses.fr/2018IMTA0089/document.

Full text

Abstract:

A l’opposé de l’approche consistant à concevoir aucas par cas des contraintes et des algorithmes leur étant dédiés, l’objet de cette thèse concerne d’une part la description de familles de contraintes en termes de composition de fonctions, et d’autre part la synthèse d’objets combinatoires pour de telles contraintes. Les objets concernés sont des bornes précises, des coupes linéaires, des invariants non-linéaires et des automates finis ; leur but principal est de prendre en compte l’aspect combinatoire d’une seule contrainte ou d’une conjonction de contraintes. Ces objets sont obtenus d’une fa

APA, Harvard, Vancouver, ISO, and other styles

27

Brunet, Paul. "Algebras of Relations : from algorithms to formal proofs." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSE1198/document.

Full text

Abstract:

Les algèbres de relations apparaissent naturellement dans de nombreux cadres, en informatique comme en mathématiques. Elles constituent en particulier un formalisme tout à fait adapté à la sémantique des programmes impératifs. Les algèbres de Kleene constituent un point de départ : ces algèbres jouissent de résultats de décidabilités très satisfaisants, et admettent une axiomatisation complète. L'objectif de cette thèse a été d'étendre les résultats connus sur les algèbres de Kleene à des extensions de celles-ci.Nous nous sommes tout d'abord intéressés à une extension connue : les algèbres de

APA, Harvard, Vancouver, ISO, and other styles

28

Чернявський, Олексій Ігорович, Алексей Игоревич Чернявский та Oleksii Igorovych Cherniavskyi. "Розробка модуля функцій парсингу XML і регулярних виразів як важливої технологічної складової АРМ в автосервісі (на прикладі ТОВ “ДА ТЕХ Рівне”)". Master's thesis, Міжнародний економіко-гуманітарний університет імені академіка Степана Дем'янчука, 2012. http://essuir.sumdu.edu.ua/handle/123456789/25216.

Full text

Abstract:

XML і регулярні вирази широко використовуються в області зберігання, передачі і пошуку текстової інформації, що свідчить про необхідність та актуальність даних технологій для індустрії програмного забезпечення. Мета роботи. Метою даної роботи є розробка алгоритму швидкого парсингу XML і регулярних виразів.<br>XML і регулярні вирази відносяться до області зберігання, передачі, пошуку і обробки текстової інформації. Оскільки XML є найбільш популярним форматом зберігання даних, очевидним є необхідність програмного модуля функцій парсингу XML. Даний модуль може повторно використовуватись в зовн

APA, Harvard, Vancouver, ISO, and other styles

29

Haglund, Robin. "Automated analysis of battery articles." Thesis, Uppsala universitet, Strukturkemi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-403738.

Full text

Abstract:

Journal articles are the formal medium for the communication of results among scientists, and often contain valuable data. However, manually collecting article data from a large field like lithium-ion battery chemistry is tedious and time consuming, which is an obstacle when searching for statistical trends and correlations to inform research decisions. To address this a platform for the automatic retrieval and analysis of large numbers of articles is created and applied to the field of lithium-ion battery chemistry. Example data produced by the platform is presented and evaluated and sources

APA, Harvard, Vancouver, ISO, and other styles

30

Helmersson, Benjamin. "Definition Extraction From Swedish Technical Documentation : Bridging the gap between industry and academy approaches." Thesis, Linköpings universitet, Institutionen för datavetenskap, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-131057.

Full text

Abstract:

Terminology is concerned with the creation and maintenance of concept systems, terms and definitions. Automatic term and definition extraction is used to simplify this otherwise manual and sometimes tedious process. This thesis presents an integrated approach of pattern matching and machine learning, utilising feature vectors in which each feature is a Boolean function of a regular expression. The integrated approach is compared with the two more classic approaches, showing a significant increase in recall while maintaining a comparable precision score. Less promising is the negative correlati

APA, Harvard, Vancouver, ISO, and other styles

31

Crowfoot, Norman C. "A visual aid for designing regular expression parsers /." Online version of thesis, 1988. http://hdl.handle.net/1850/10446.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Coetser, Rayner Johannes Lodewikus. "Finite state automaton construction through regular expression hashing." Diss., University of Pretoria, 2009. http://hdl.handle.net/2263/27536.

Full text

Abstract:

In this study, the regular expressions forming abstract states in Brzozowski’s algorithm are not remapped to sequential state transition table addresses as would be the case in the classical approach, but are hashed to integers. Two regular expressions that are hashed to the same hash code are assigned the same integer address in the state transition table, reducing the number of states in the automaton. This reduction does not necessarily lead to the construction of a minimal automaton: no restrictions are placed on the hash function hashing two regular expressions to the same code. Depending

APA, Harvard, Vancouver, ISO, and other styles

33

Darborg, Alex. "Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34070.

Full text

Abstract:

General Data Protection Regulation, GDPR, is a regulation coming into effect on May 25th 2018. Due to this, organizations face large decisions concerning how sensitive data, stored in databases, are to be identified. Meanwhile, there is an expansion of machine learning on the software market. The goal of this project has been to develop a tool which, through machine learning, can identify sensitive data. The development of this tool has been accomplished through the use of agile methods and has included comparisions of various algorithms and the development of a prototype. This by using tools

APA, Harvard, Vancouver, ISO, and other styles

34

Пістун, Д. В. "Лексико-семантичні особливості усталених виразів у сучасній англійській мові". Thesis, Сумський державний університет, 2021. https://essuir.sumdu.edu.ua/handle/123456789/83547.

Full text

Abstract:

Усталені вирази – лінгвістичний феномен, який знаходиться у фокусі дослідження багатьох науковців. Науковий інтерес до проблеми усталених виразів не вщухає протягом тривалого часу, з огляду на те, що наразі, незважаючи на високий ступінь розробленості різноманітних аспектів усталених виразів, не існує єдиного уніфікованого визначення цього поняття, обсяг та зміст поняття все ще є об’єктом наукових дискусій. Джерелами походження усталених словосполучень є жива народна мова (усне побутове спілкування й усна народна творчість), біблійні вислови, вислови з античної міфології, крилаті вислови відо

APA, Harvard, Vancouver, ISO, and other styles

35

Lin, Ye. "Internet data extraction based on automatic regular expression inference." [Ames, Iowa : Iowa State University], 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

Rathnayake, Asiri. "Semantics, analysis and security of backtracking regular expression matchers." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/6011/.

Full text

Abstract:

Regular expressions are ubiquitous in computer science. Originally defined by Kleene in 1956, they have become a staple of the computer science undergraduate curriculum. Practical applications of regular expressions are numerous, ranging from compiler construction through smart text editors to network intrusion detection systems. Despite having been vigorously studied and formalized in many ways, recent practical implementations of regular expressions have drawn criticism for their use of a non-standard backtracking algorithm. In this research, we investigate the reasons for this deviation and

APA, Harvard, Vancouver, ISO, and other styles

37

TARLAO, FABIANO. "Genetic Programming Techniques for Regular Expression inference from Examples." Doctoral thesis, Università degli Studi di Trieste, 2017. http://hdl.handle.net/11368/2908187.

Full text

Abstract:

In the recent years, Machine Learning techniques have emerged as a new way to obtain solutions for a given problem, the novelty of the Machine Learning approach lies in the ability to automatically learn solutions by only looking at the observations of phenomena or examples of the expected behaviour. Besides, Machine Learning techniques may be adopted when the problem exceeds the human ability to find out a solution and are, at the present time, a viable solution also in fields that were previously dominated by the human intelligence. In this thesis we will describe the work developed at the M

APA, Harvard, Vancouver, ISO, and other styles

38

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

39

Leipnitz, Marcos Tomazzoli. "Resilient regular expression matching on FPGAs with fast error repair." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/168788.

Full text

Abstract:

O paradigma Network Function Virtualization (NFV) promete tornar as redes de computadores mais escaláveis e flexíveis, através do desacoplamento das funções de rede de hardware dedicado e fornecedor específico. No entanto, funções de rede computacionalmente intensivas podem ser difíceis de virtualizar sem degradação de desempenho. Neste contexto, Field-Programmable Gate Arrays (FPGAs) têm se mostrado uma boa opção para aceleração por hardware de funções de rede virtuais que requerem alta vazão, sem se desviar do conceito de uma infraestrutura NFV que visa alta flexibilidade. A avaliação de exp

APA, Harvard, Vancouver, ISO, and other styles

40

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

41

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

42

Juhlin, Cory Michael. "Developing a Compiler for a Regular Expression Based Policy Specification Language." Scholar Commons, 2015. http://scholarcommons.usf.edu/etd/5885.

Full text

Abstract:

Security policy specification languages are a response to today's complex and vulnerable software climate. These languages allow an individual or organization to restrict and modify the behavior of third-party applications such that they adhere to the rules specified in the policy. As software grows in complexity, so do the security policies that govern them. Existing policy specification languages have not adapted to the growing complexity of the software they govern and as a result do not scale well, often resulting in code that is overly complex or unreadable. Writing small, isolated polici

APA, Harvard, Vancouver, ISO, and other styles

43

Roued-Cunliffe, Henriette. "A decision support system for the reading of ancient documents." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:9d547661-4dea-4c54-832b-b2f862ec7b25.

Full text

Abstract:

The research presented in this thesis is based in the Humanities discipline of Ancient History and begins by attempting to understand the interpretation process involved in reading ancient documents and how this process can be aided by computer systems such as Decision Support Systems (DSS). The thesis balances between the use of IT tools to aid Humanities research and the understanding that Humanities research must involve human beings. It does not attempt to develop a system that can automate the reading of ancient documents. Instead it seeks to demonstrate and develop tools that can support

APA, Harvard, Vancouver, ISO, and other styles

44

Townsend, Joseph A. "Automated analysis and validation of chemical literature." Thesis, University of Cambridge, 2008. https://www.repository.cam.ac.uk/handle/1810/197570.

Full text

Abstract:

Methods to automatically extract and validate data from the chemical literature in legacy formats to machine-understandable forms are examined. The work focuses of three types of data: analytical data reported in articles, computational chemistry output files and crystallographic information files (CIFs). It is shown that machines are capable of reading and extracting analytical data from the current legacy formats with high recall and precision. Regular expressions cannot identify chemical names with high precision or recall but non-deterministic methods perform significantly better. The lack

APA, Harvard, Vancouver, ISO, and other styles

45

Carlsson, Emil. "Matching in MySQL : A comparison between REGEXP and LIKE." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20598.

Full text

Abstract:

When needing to search for data in multiple datasets there is a risk that not all da-tasets are of the same type. Some might be in XML-format; others might use a re-lational database. This could frighten developers from using two separate datasets to search for the data in, because of the fact that crafting different search methods for different datasets can be time consuming. One option that is greatly overlooked is the usage of regular expressions. If a search expression is created it can be used in a majority of database engines as a “WHERE” statement and also in other form of data sources

APA, Harvard, Vancouver, ISO, and other styles

46

Modi, Bala. "FPGA-based high throughput regular expression pattern matching for network intrusion detection systems." Thesis, University of Kent, 2015. https://kar.kent.ac.uk/56664/.

Full text

Abstract:

Network speeds and bandwidths have improved over time. However, the frequency of network attacks and illegal accesses have also increased as the network speeds and bandwidths improved over time. Such attacks are capable of compromising the privacy and confidentiality of network resources belonging to even the most secure networks. Currently, general-purpose processor based software solutions used for detecting network attacks have become inadequate in coping with the current network speeds. Hardware-based platforms are designed to cope with the rising network speeds measured in several gigabit

APA, Harvard, Vancouver, ISO, and other styles

47

Mutňanský, Filip. "Ověřování parametrických vlastností nad záznamy běhů programů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417229.

Full text

Abstract:

The goal of this thesis is to implement a tool that based on user defined properties can verify sequences of events in the traces of the program, or the log file. Properties are defined in extended regular expressions. The tool is able to verify parametric properties. User can define relations between parameters of events. Input of this tool is the definition of properties and constraints of parameters. Output of the tool is the report of violated properties with its sequences of events that caused the error.

APA, Harvard, Vancouver, ISO, and other styles

48

Richard, Catherine. "Deletion analysis of the sequences that regulate HEM13 expression." Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=59289.

Full text

Abstract:

In the yeast Saccharomyces cerevisiae, HEM13 codes for coproporphyrinogen oxidase which catalyses the sixth enzymatic step in the heme biosynthetic pathway. Coproporphyrinogen oxidase synthesis has been shown to be regulated negatively by heme and oxygen at the transcriptional level. We are interested in defining the HEM13 cis-acting upstream sequences that mediate regulation by heme. HEM13-lacZ and HEM13-CYC1-lacZ hybrid fusions were made and expression of the resulting $ beta$-galactosidase activity was determined in vivo, under conditions of varying levels of heme. Deletion analysis of the

APA, Harvard, Vancouver, ISO, and other styles

49

Lu, Ko-Ting. "Identification of nuclear receptors that regulate renin gene expression." Thesis, University of Iowa, 2014. https://ir.uiowa.edu/etd/1877.

Full text

Abstract:

Renin (REN) expression is required to maintain blood pressure and electrolyte homeostasis. However, the mechanisms by which REN is transcriptionally regulated remain elusive. We reported a functional role for several nuclear receptors (NRs) on REN gene transcription. To identify other candidate NRs that regulate REN, we analyzed a publicly available microarray dataset (GUDMAP Developing Kidney ST1) to compare the expression pattern of REN and the 48 NRs across different kidney cell types. Our analysis revealed 14 NRs exhibiting a similar pattern as REN. We hypothesized that these NRs are co-re

APA, Harvard, Vancouver, ISO, and other styles

50

Afram, Gabriel. "Genomsökning av filsystem för att hitta personuppgifter : Med Linear chain conditional random field och Regular expression." Thesis, Mittuniversitetet, Avdelningen för informationssystem och -teknologi, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34069.

Full text

Abstract:

The new General Data Protection Regulation (GDPR) Act will apply to all companies within the European Union after 25 May. This means stricter legal requirements for companies that in some way store personal data. The goal of this project is therefore to make it easier for companies to meet the new legal requirements. This by creating a tool that searches file systems and visually shows the user in a graphical user interface which files contain personal data. The tool uses Named entity recognition with the Linear chain conditional random field algorithm which is a type of supervised learning me

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!