Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Regular expression). Showing records 1 – 30 of 70 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Languages

Country

▼ Search Limiters


Texas A&M University

1. Wang, Hao. Design of Pattern Matching Systems: Pattern, Algorithm, and Scanner.

Degree: 2013, Texas A&M University

 Pattern matching is at the core of many computational problems, e.g., search engine, data mining, network security and information retrieval. In this dissertation, we target… (more)

Subjects/Keywords: Regular expression; Melody matching; Time series; FPGA

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, H. (2013). Design of Pattern Matching Systems: Pattern, Algorithm, and Scanner. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/153804

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Hao. “Design of Pattern Matching Systems: Pattern, Algorithm, and Scanner.” 2013. Thesis, Texas A&M University. Accessed July 14, 2020. http://hdl.handle.net/1969.1/153804.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Hao. “Design of Pattern Matching Systems: Pattern, Algorithm, and Scanner.” 2013. Web. 14 Jul 2020.

Vancouver:

Wang H. Design of Pattern Matching Systems: Pattern, Algorithm, and Scanner. [Internet] [Thesis]. Texas A&M University; 2013. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1969.1/153804.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang H. Design of Pattern Matching Systems: Pattern, Algorithm, and Scanner. [Thesis]. Texas A&M University; 2013. Available from: http://hdl.handle.net/1969.1/153804

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Pretoria

2. De Ridder, Corne. Flexible finite automata-based algorithms for detecting microsatellites in DNA.

Degree: Computer Science, 2010, University of Pretoria

 Apart from contributing to Computer Science, this research also contributes to Bioinformatics, a subset of the subject discipline Computational Biology. The main focus of this… (more)

Subjects/Keywords: Approximate tandem repeats; Regular expression; Finite automata; Microsatellites; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

De Ridder, C. (2010). Flexible finite automata-based algorithms for detecting microsatellites in DNA. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/27335

Chicago Manual of Style (16th Edition):

De Ridder, Corne. “Flexible finite automata-based algorithms for detecting microsatellites in DNA.” 2010. Masters Thesis, University of Pretoria. Accessed July 14, 2020. http://hdl.handle.net/2263/27335.

MLA Handbook (7th Edition):

De Ridder, Corne. “Flexible finite automata-based algorithms for detecting microsatellites in DNA.” 2010. Web. 14 Jul 2020.

Vancouver:

De Ridder C. Flexible finite automata-based algorithms for detecting microsatellites in DNA. [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2263/27335.

Council of Science Editors:

De Ridder C. Flexible finite automata-based algorithms for detecting microsatellites in DNA. [Masters Thesis]. University of Pretoria; 2010. Available from: http://hdl.handle.net/2263/27335


University of Pretoria

3. Coetser, Rayner Johannes Lodewikus. Finite state automaton construction through regular expression hashing.

Degree: Computer Science, 2010, University of Pretoria

 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… (more)

Subjects/Keywords: Regular expression hashing; Finite state; Super-automaton; Approximate automaton; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Coetser, R. J. (2010). Finite state automaton construction through regular expression hashing. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/27536

Chicago Manual of Style (16th Edition):

Coetser, Rayner Johannes. “Finite state automaton construction through regular expression hashing.” 2010. Masters Thesis, University of Pretoria. Accessed July 14, 2020. http://hdl.handle.net/2263/27536.

MLA Handbook (7th Edition):

Coetser, Rayner Johannes. “Finite state automaton construction through regular expression hashing.” 2010. Web. 14 Jul 2020.

Vancouver:

Coetser RJ. Finite state automaton construction through regular expression hashing. [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/2263/27536.

Council of Science Editors:

Coetser RJ. Finite state automaton construction through regular expression hashing. [Masters Thesis]. University of Pretoria; 2010. Available from: http://hdl.handle.net/2263/27536


University of Pretoria

4. De Ridder, Corne. Flexible finite automata-based algorithms for detecting microsatellites in DNA .

Degree: 2010, University of Pretoria

 Apart from contributing to Computer Science, this research also contributes to Bioinformatics, a subset of the subject discipline Computational Biology. The main focus of this… (more)

Subjects/Keywords: Approximate tandem repeats; Regular expression; Finite automata; Microsatellites; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

De Ridder, C. (2010). Flexible finite automata-based algorithms for detecting microsatellites in DNA . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-08172010-202532/

Chicago Manual of Style (16th Edition):

De Ridder, Corne. “Flexible finite automata-based algorithms for detecting microsatellites in DNA .” 2010. Masters Thesis, University of Pretoria. Accessed July 14, 2020. http://upetd.up.ac.za/thesis/available/etd-08172010-202532/.

MLA Handbook (7th Edition):

De Ridder, Corne. “Flexible finite automata-based algorithms for detecting microsatellites in DNA .” 2010. Web. 14 Jul 2020.

Vancouver:

De Ridder C. Flexible finite automata-based algorithms for detecting microsatellites in DNA . [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Jul 14]. Available from: http://upetd.up.ac.za/thesis/available/etd-08172010-202532/.

Council of Science Editors:

De Ridder C. Flexible finite automata-based algorithms for detecting microsatellites in DNA . [Masters Thesis]. University of Pretoria; 2010. Available from: http://upetd.up.ac.za/thesis/available/etd-08172010-202532/


University of Pretoria

5. [No author]. Finite state automaton construction through regular expression hashing .

Degree: 2010, University of Pretoria

 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… (more)

Subjects/Keywords: Regular expression hashing; Finite state; Super-automaton; Approximate automaton; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

author], [. (2010). Finite state automaton construction through regular expression hashing . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-08252010-133710/

Chicago Manual of Style (16th Edition):

author], [No. “Finite state automaton construction through regular expression hashing .” 2010. Masters Thesis, University of Pretoria. Accessed July 14, 2020. http://upetd.up.ac.za/thesis/available/etd-08252010-133710/.

MLA Handbook (7th Edition):

author], [No. “Finite state automaton construction through regular expression hashing .” 2010. Web. 14 Jul 2020.

Vancouver:

author] [. Finite state automaton construction through regular expression hashing . [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Jul 14]. Available from: http://upetd.up.ac.za/thesis/available/etd-08252010-133710/.

Council of Science Editors:

author] [. Finite state automaton construction through regular expression hashing . [Masters Thesis]. University of Pretoria; 2010. Available from: http://upetd.up.ac.za/thesis/available/etd-08252010-133710/


University of Southern California

6. Yang, Yi-Hua Edward. Large scale and high- throughput pattern matching on parallel architectures.

Degree: PhD, Electrical Engineering, 2011, University of Southern California

 Large-scale pattern matching has many applications ranging from text processing to deep packet inspection (DPI) where hundreds or thousands of pre-defined strings or regular expressions… (more)

Subjects/Keywords: DFA; finite automaton; NFA; pattern matching; regular expression; string matching

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yang, Y. E. (2011). Large scale and high- throughput pattern matching on parallel architectures. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195424/rec/3743

Chicago Manual of Style (16th Edition):

Yang, Yi-Hua Edward. “Large scale and high- throughput pattern matching on parallel architectures.” 2011. Doctoral Dissertation, University of Southern California. Accessed July 14, 2020. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195424/rec/3743.

MLA Handbook (7th Edition):

Yang, Yi-Hua Edward. “Large scale and high- throughput pattern matching on parallel architectures.” 2011. Web. 14 Jul 2020.

Vancouver:

Yang YE. Large scale and high- throughput pattern matching on parallel architectures. [Internet] [Doctoral dissertation]. University of Southern California; 2011. [cited 2020 Jul 14]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195424/rec/3743.

Council of Science Editors:

Yang YE. Large scale and high- throughput pattern matching on parallel architectures. [Doctoral Dissertation]. University of Southern California; 2011. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195424/rec/3743


California State University – Sacramento

7. Shah, Jinaliben. Active rule execution in graph databases.

Degree: MS, Computer Science, 2019, California State University – Sacramento

 Active database systems support applications by moving the reactive behavior from applications into database management systems. It is a database system that includes an event-driven… (more)

Subjects/Keywords: Triggers; Alias; Priority logic; Pattern matching; Regular expression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shah, J. (2019). Active rule execution in graph databases. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/210202

Chicago Manual of Style (16th Edition):

Shah, Jinaliben. “Active rule execution in graph databases.” 2019. Masters Thesis, California State University – Sacramento. Accessed July 14, 2020. http://hdl.handle.net/10211.3/210202.

MLA Handbook (7th Edition):

Shah, Jinaliben. “Active rule execution in graph databases.” 2019. Web. 14 Jul 2020.

Vancouver:

Shah J. Active rule execution in graph databases. [Internet] [Masters thesis]. California State University – Sacramento; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10211.3/210202.

Council of Science Editors:

Shah J. Active rule execution in graph databases. [Masters Thesis]. California State University – Sacramento; 2019. Available from: http://hdl.handle.net/10211.3/210202


University of South Carolina

8. Bradshaw, Jordan. Regular Expression Synthesis for BLAST Two-Hit Filtering.

Degree: PhD, Computer Science and Engineering, 2016, University of South Carolina

  Genomic databases are exhibiting a growth rate that is outpacing Moore's Law, which has made database search algorithms a popular application for use on… (more)

Subjects/Keywords: Computer Engineering; Computer Sciences; Engineering; Regular Expression; Synthesis; BLAST; Two-Hit Filtering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Bradshaw, J. (2016). Regular Expression Synthesis for BLAST Two-Hit Filtering. (Doctoral Dissertation). University of South Carolina. Retrieved from https://scholarcommons.sc.edu/etd/3815

Chicago Manual of Style (16th Edition):

Bradshaw, Jordan. “Regular Expression Synthesis for BLAST Two-Hit Filtering.” 2016. Doctoral Dissertation, University of South Carolina. Accessed July 14, 2020. https://scholarcommons.sc.edu/etd/3815.

MLA Handbook (7th Edition):

Bradshaw, Jordan. “Regular Expression Synthesis for BLAST Two-Hit Filtering.” 2016. Web. 14 Jul 2020.

Vancouver:

Bradshaw J. Regular Expression Synthesis for BLAST Two-Hit Filtering. [Internet] [Doctoral dissertation]. University of South Carolina; 2016. [cited 2020 Jul 14]. Available from: https://scholarcommons.sc.edu/etd/3815.

Council of Science Editors:

Bradshaw J. Regular Expression Synthesis for BLAST Two-Hit Filtering. [Doctoral Dissertation]. University of South Carolina; 2016. Available from: https://scholarcommons.sc.edu/etd/3815


University of Georgia

9. Kalimurthy, Aravind. Adapting graph simulation algorithms for graph database query processing.

Degree: MS, Computer Science, 2017, University of Georgia

 With data exponentially increasing in almost all fields in today’s world, there comes the necessity of handling and querying the data efficiently. Recently, many graph… (more)

Subjects/Keywords: Graph Database; Graph Simulation Algorithms; Edge Label; Cardinality; Query Processing; Widcard; Regular Expression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kalimurthy, A. (2017). Adapting graph simulation algorithms for graph database query processing. (Masters Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/37802

Chicago Manual of Style (16th Edition):

Kalimurthy, Aravind. “Adapting graph simulation algorithms for graph database query processing.” 2017. Masters Thesis, University of Georgia. Accessed July 14, 2020. http://hdl.handle.net/10724/37802.

MLA Handbook (7th Edition):

Kalimurthy, Aravind. “Adapting graph simulation algorithms for graph database query processing.” 2017. Web. 14 Jul 2020.

Vancouver:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Internet] [Masters thesis]. University of Georgia; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10724/37802.

Council of Science Editors:

Kalimurthy A. Adapting graph simulation algorithms for graph database query processing. [Masters Thesis]. University of Georgia; 2017. Available from: http://hdl.handle.net/10724/37802


Brigham Young University

10. Kim, Tae Woo. A Green Form-Based Information Extraction System for Historical Documents.

Degree: MS, 2017, Brigham Young University

 Many historical documents are rich in genealogical facts. Extracting these facts by hand is tedious and almost impossible considering the hundreds of thousands of genealogically… (more)

Subjects/Keywords: green systems; self-improving systems; data extraction; regular-expression generation; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, T. W. (2017). A Green Form-Based Information Extraction System for Historical Documents. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7375&context=etd

Chicago Manual of Style (16th Edition):

Kim, Tae Woo. “A Green Form-Based Information Extraction System for Historical Documents.” 2017. Masters Thesis, Brigham Young University. Accessed July 14, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7375&context=etd.

MLA Handbook (7th Edition):

Kim, Tae Woo. “A Green Form-Based Information Extraction System for Historical Documents.” 2017. Web. 14 Jul 2020.

Vancouver:

Kim TW. A Green Form-Based Information Extraction System for Historical Documents. [Internet] [Masters thesis]. Brigham Young University; 2017. [cited 2020 Jul 14]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7375&context=etd.

Council of Science Editors:

Kim TW. A Green Form-Based Information Extraction System for Historical Documents. [Masters Thesis]. Brigham Young University; 2017. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=7375&context=etd

11. LU ZHUO MING. XHaskell - Adding regular expression types to haskell.

Degree: 2009, National University of Singapore

Subjects/Keywords: Type system; regular expression; functional programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

MING, L. Z. (2009). XHaskell - Adding regular expression types to haskell. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/15878

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

MING, LU ZHUO. “XHaskell - Adding regular expression types to haskell.” 2009. Thesis, National University of Singapore. Accessed July 14, 2020. http://scholarbank.nus.edu.sg/handle/10635/15878.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

MING, LU ZHUO. “XHaskell - Adding regular expression types to haskell.” 2009. Web. 14 Jul 2020.

Vancouver:

MING LZ. XHaskell - Adding regular expression types to haskell. [Internet] [Thesis]. National University of Singapore; 2009. [cited 2020 Jul 14]. Available from: http://scholarbank.nus.edu.sg/handle/10635/15878.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

MING LZ. XHaskell - Adding regular expression types to haskell. [Thesis]. National University of Singapore; 2009. Available from: http://scholarbank.nus.edu.sg/handle/10635/15878

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

12. Jachiet, Louis. Sur la compilation des langages de requêtes pour le web des données : optimisation et évaluation distribuée de SPARQL : On the foundations for the compilation of web data queries : optimization and distributed evaluation of SPARQL.

Degree: Docteur es, Informatique, 2018, Université Grenoble Alpes (ComUE)

 Ma thèse porte sur la compilation des langages de requêtes orientés web des données. Plus particulièrement, ma thèse s'intéresse à l'analyse, l'optimisation et l'évaluation distribuée… (more)

Subjects/Keywords: Spark; Web sémantique; Requête récursive; Expression régulière de chemin; Requête; Query; Recursive query; Semantic web; Regular path expression; Spark; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jachiet, L. (2018). Sur la compilation des langages de requêtes pour le web des données : optimisation et évaluation distribuée de SPARQL : On the foundations for the compilation of web data queries : optimization and distributed evaluation of SPARQL. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2018GREAM038

Chicago Manual of Style (16th Edition):

Jachiet, Louis. “Sur la compilation des langages de requêtes pour le web des données : optimisation et évaluation distribuée de SPARQL : On the foundations for the compilation of web data queries : optimization and distributed evaluation of SPARQL.” 2018. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed July 14, 2020. http://www.theses.fr/2018GREAM038.

MLA Handbook (7th Edition):

Jachiet, Louis. “Sur la compilation des langages de requêtes pour le web des données : optimisation et évaluation distribuée de SPARQL : On the foundations for the compilation of web data queries : optimization and distributed evaluation of SPARQL.” 2018. Web. 14 Jul 2020.

Vancouver:

Jachiet L. Sur la compilation des langages de requêtes pour le web des données : optimisation et évaluation distribuée de SPARQL : On the foundations for the compilation of web data queries : optimization and distributed evaluation of SPARQL. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2018. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2018GREAM038.

Council of Science Editors:

Jachiet L. Sur la compilation des langages de requêtes pour le web des données : optimisation et évaluation distribuée de SPARQL : On the foundations for the compilation of web data queries : optimization and distributed evaluation of SPARQL. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2018. Available from: http://www.theses.fr/2018GREAM038


Brno University of Technology

13. Kovařík, David. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.

Degree: 2019, Brno University of Technology

 Spam does not occur as separate messages, but it is sent in so-called campaigns. They are usually generated by a certain template which allows producing… (more)

Subjects/Keywords: SMS; Spam; Spamové kampaně; Extrakce šablony; Indukce regulárních výrazů; Regulární výrazy; SMS; Spam; Spam campaigns; Template extraction; Regular expression induction; Regular expressions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kovařík, D. (2019). Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/84904

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kovařík, David. “Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/84904.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kovařík, David. “Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.” 2019. Web. 14 Jul 2020.

Vancouver:

Kovařík D. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/84904.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kovařík D. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/84904

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

14. Kovařík, David. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.

Degree: 2020, Brno University of Technology

 Spam does not occur as separate messages, but it is sent in so-called campaigns. They are usually generated by a certain template which allows producing… (more)

Subjects/Keywords: SMS; Spam; Spamové kampaně; Extrakce šablony; Indukce regulárních výrazů; Regulární výrazy; SMS; Spam; Spam campaigns; Template extraction; Regular expression induction; Regular expressions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kovařík, D. (2020). Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/188881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kovařík, David. “Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/188881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kovařík, David. “Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.” 2020. Web. 14 Jul 2020.

Vancouver:

Kovařík D. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/188881.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kovařík D. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/188881

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

15. Kovařík, David. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.

Degree: 2020, Brno University of Technology

 Spam does not occur as separate messages, but it is sent in so-called campaigns. They are usually generated by a certain template which allows producing… (more)

Subjects/Keywords: SMS; Spam; Spamové kampaně; Extrakce šablony; Indukce regulárních výrazů; Regulární výrazy; SMS; Spam; Spam campaigns; Template extraction; Regular expression induction; Regular expressions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kovařík, D. (2020). Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/190170

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kovařík, David. “Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/190170.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kovařík, David. “Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition.” 2020. Web. 14 Jul 2020.

Vancouver:

Kovařík D. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/190170.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kovařík D. Automatická identifikace šablony generující spam kampaně: Automatic Template Pattern Recognition. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/190170

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

16. Harun-Or-Rashid, Mohammad. Mining Multiple Web Sources Using Non-Deterministic Finite State Automata.

Degree: MS, Computer Science, 2012, National Library of Canada

 Existing web content extracting systems use unsupervised, supervised, and semi-supervised approaches. The WebOMiner system is an automatic web content data extraction system which models a… (more)

Subjects/Keywords: Communication and the arts; Applied sciences; Nondeterministic finite automata; Regular expression; Web mining; Deterministic finite automata; Dom tree; Frequent pattern

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Harun-Or-Rashid, M. (2012). Mining Multiple Web Sources Using Non-Deterministic Finite State Automata. (Masters Thesis). National Library of Canada. Retrieved from http://scholar.uwindsor.ca/etd/4814

Chicago Manual of Style (16th Edition):

Harun-Or-Rashid, Mohammad. “Mining Multiple Web Sources Using Non-Deterministic Finite State Automata.” 2012. Masters Thesis, National Library of Canada. Accessed July 14, 2020. http://scholar.uwindsor.ca/etd/4814.

MLA Handbook (7th Edition):

Harun-Or-Rashid, Mohammad. “Mining Multiple Web Sources Using Non-Deterministic Finite State Automata.” 2012. Web. 14 Jul 2020.

Vancouver:

Harun-Or-Rashid M. Mining Multiple Web Sources Using Non-Deterministic Finite State Automata. [Internet] [Masters thesis]. National Library of Canada; 2012. [cited 2020 Jul 14]. Available from: http://scholar.uwindsor.ca/etd/4814.

Council of Science Editors:

Harun-Or-Rashid M. Mining Multiple Web Sources Using Non-Deterministic Finite State Automata. [Masters Thesis]. National Library of Canada; 2012. Available from: http://scholar.uwindsor.ca/etd/4814


Universidade do Rio Grande do Sul

17. Leipnitz, Marcos Tomazzoli. Resilient regular expression matching on FPGAs with fast error repair.

Degree: 2017, Universidade do Rio Grande do Sul

The Network Function Virtualization (NFV) paradigm promises to make computer networks more scalable and flexible by decoupling the network functions (NFs) from dedicated and vendor-specific… (more)

Subjects/Keywords: Microeletrônica; Field-Programmable Gate Array; Repair Time; Tolerancia : Falhas; Fpga; Fault-Tolerance; Regular Expression Matching; Network Function Virtualization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Leipnitz, M. T. (2017). Resilient regular expression matching on FPGAs with fast error repair. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/168788

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Leipnitz, Marcos Tomazzoli. “Resilient regular expression matching on FPGAs with fast error repair.” 2017. Thesis, Universidade do Rio Grande do Sul. Accessed July 14, 2020. http://hdl.handle.net/10183/168788.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Leipnitz, Marcos Tomazzoli. “Resilient regular expression matching on FPGAs with fast error repair.” 2017. Web. 14 Jul 2020.

Vancouver:

Leipnitz MT. Resilient regular expression matching on FPGAs with fast error repair. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2017. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10183/168788.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leipnitz MT. Resilient regular expression matching on FPGAs with fast error repair. [Thesis]. Universidade do Rio Grande do Sul; 2017. Available from: http://hdl.handle.net/10183/168788

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Cambridge

18. Townsend, Joseph A. Automated Analysis and Validation of Chemical Literature.

Degree: PhD, 2008, University of Cambridge

 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… (more)

Subjects/Keywords: MOPAC; GAMESS; CIF; Calculation; OSCAR; Regular Expression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Townsend, J. A. (2008). Automated Analysis and Validation of Chemical Literature. (Doctoral Dissertation). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/197570https://www.repository.cam.ac.uk/bitstream/1810/197570/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/7/jatthesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/8/jatthesis.pdf.jpg

Chicago Manual of Style (16th Edition):

Townsend, Joseph A. “Automated Analysis and Validation of Chemical Literature.” 2008. Doctoral Dissertation, University of Cambridge. Accessed July 14, 2020. http://www.dspace.cam.ac.uk/handle/1810/197570https://www.repository.cam.ac.uk/bitstream/1810/197570/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/7/jatthesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/8/jatthesis.pdf.jpg.

MLA Handbook (7th Edition):

Townsend, Joseph A. “Automated Analysis and Validation of Chemical Literature.” 2008. Web. 14 Jul 2020.

Vancouver:

Townsend JA. Automated Analysis and Validation of Chemical Literature. [Internet] [Doctoral dissertation]. University of Cambridge; 2008. [cited 2020 Jul 14]. Available from: http://www.dspace.cam.ac.uk/handle/1810/197570https://www.repository.cam.ac.uk/bitstream/1810/197570/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/7/jatthesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/8/jatthesis.pdf.jpg.

Council of Science Editors:

Townsend JA. Automated Analysis and Validation of Chemical Literature. [Doctoral Dissertation]. University of Cambridge; 2008. Available from: http://www.dspace.cam.ac.uk/handle/1810/197570https://www.repository.cam.ac.uk/bitstream/1810/197570/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/7/jatthesis.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/197570/8/jatthesis.pdf.jpg


Uppsala University

19. David, Samer. Testtäckningsstruktur för fälttestning av SDP3 : Skapande och visualisering av testtäckningsstruktur för SDP3 med hjälp av användardata.

Degree: Mathematics, 2017, Uppsala University

  A big part of software development is testing and quality assurance. At the department of service market, Scania R&D, the software Scania Diagnose and… (more)

Subjects/Keywords: Kombinatorik; statistik; fordonskonfiguration; mjukvarutestning; SPD3; Scania; Splunk; Databaser; Regular Expression; Probability Theory and Statistics; Sannolikhetsteori och statistik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

David, S. (2017). Testtäckningsstruktur för fälttestning av SDP3 : Skapande och visualisering av testtäckningsstruktur för SDP3 med hjälp av användardata. (Thesis). Uppsala University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-320302

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

David, Samer. “Testtäckningsstruktur för fälttestning av SDP3 : Skapande och visualisering av testtäckningsstruktur för SDP3 med hjälp av användardata.” 2017. Thesis, Uppsala University. Accessed July 14, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-320302.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

David, Samer. “Testtäckningsstruktur för fälttestning av SDP3 : Skapande och visualisering av testtäckningsstruktur för SDP3 med hjälp av användardata.” 2017. Web. 14 Jul 2020.

Vancouver:

David S. Testtäckningsstruktur för fälttestning av SDP3 : Skapande och visualisering av testtäckningsstruktur för SDP3 med hjälp av användardata. [Internet] [Thesis]. Uppsala University; 2017. [cited 2020 Jul 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-320302.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

David S. Testtäckningsstruktur för fälttestning av SDP3 : Skapande och visualisering av testtäckningsstruktur för SDP3 med hjälp av användardata. [Thesis]. Uppsala University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-320302

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

20. Fransson, Tobias. Simulators for formal languages, automata and theory of computation with focus on JFLAP.

Degree: Design and Engineering, 2013, Mälardalen University

  This report discusses simulators in automata theory and which one should be best for use in laboratory assignments. Currently, the Formal Languages, Automata and… (more)

Subjects/Keywords: automata simulator pushdown turing grammar regular expression

…states around. You have to specify each item trough adding them or create a regular expression… …10 CONVERT FA TO REGULAR EXPRESSION… …and transitions but there is also creation of Grammar and Regular Expression which is made… …automata to grammar or regular expressions. User Friendliness Making automata is easy and… …the interface is so restrictive. It is faster to create regular expressions that you input… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fransson, T. (2013). Simulators for formal languages, automata and theory of computation with focus on JFLAP. (Thesis). Mälardalen University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-18351

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fransson, Tobias. “Simulators for formal languages, automata and theory of computation with focus on JFLAP.” 2013. Thesis, Mälardalen University. Accessed July 14, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-18351.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fransson, Tobias. “Simulators for formal languages, automata and theory of computation with focus on JFLAP.” 2013. Web. 14 Jul 2020.

Vancouver:

Fransson T. Simulators for formal languages, automata and theory of computation with focus on JFLAP. [Internet] [Thesis]. Mälardalen University; 2013. [cited 2020 Jul 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-18351.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fransson T. Simulators for formal languages, automata and theory of computation with focus on JFLAP. [Thesis]. Mälardalen University; 2013. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-18351

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

21. Kaštil, Jan. OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA: OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY.

Degree: 2018, Brno University of Technology

 This thesis deals with fast regular expression matching using FPGA. Regular expression matching in high speed computer networks is computationally intensive operation used mostly in… (more)

Subjects/Keywords: Regulární výraz; vyhledávání; deterministický konečný automat; FPGA; perfektní hashovací funkce; Regular expression; searching; deterministic finite automaton; FPGA; perfect hash function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kaštil, J. (2018). OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA: OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/63231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kaštil, Jan. “OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA: OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/63231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kaštil, Jan. “OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA: OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY.” 2018. Web. 14 Jul 2020.

Vancouver:

Kaštil J. OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA: OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/63231.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kaštil J. OPTIMALIZACE ALGORITMŮ A DATOVÝCH STRUKTUR PRO VYHLEDÁVÁNÍ REGULÁRNÍCH VÝRAZŮ S VYUŽITÍM TECHNOLOGIE FPGA: OPTIMIZATION OF ALGORITHMS AND DATA STRUCTURES FOR REGULAR EXPRESSION MATCHING USING FPGA TECHNOLOGY. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/63231

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Cambridge

22. Townsend, Joseph A. Automated analysis and validation of chemical literature.

Degree: PhD, 2008, University of Cambridge

 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… (more)

Subjects/Keywords: 540; MOPAC; GAMESS; CIF; Calculation; OSCAR; Regular Expression

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Townsend, J. A. (2008). Automated analysis and validation of chemical literature. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/197570 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541801

Chicago Manual of Style (16th Edition):

Townsend, Joseph A. “Automated analysis and validation of chemical literature.” 2008. Doctoral Dissertation, University of Cambridge. Accessed July 14, 2020. https://www.repository.cam.ac.uk/handle/1810/197570 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541801.

MLA Handbook (7th Edition):

Townsend, Joseph A. “Automated analysis and validation of chemical literature.” 2008. Web. 14 Jul 2020.

Vancouver:

Townsend JA. Automated analysis and validation of chemical literature. [Internet] [Doctoral dissertation]. University of Cambridge; 2008. [cited 2020 Jul 14]. Available from: https://www.repository.cam.ac.uk/handle/1810/197570 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541801.

Council of Science Editors:

Townsend JA. Automated analysis and validation of chemical literature. [Doctoral Dissertation]. University of Cambridge; 2008. Available from: https://www.repository.cam.ac.uk/handle/1810/197570 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541801

23. Kakkar, Himesh. Automated Grading and Feedback of Regular Expressions.

Degree: MS, Computer Science (GCCIS), 2017, Rochester Institute of Technology

  To keep up with the current spread of education, there has arisen the need to have automated tools to evaluate assignments. As a part… (more)

Subjects/Keywords: Edit distance; Evaluation; Grade; Regular expression

expression (regex). Also, any language that can be represented as a regex is a regular… …been explained in depth under the heading REGULAR EXPRESSION EQUIVALENCE, see Section 8. Just… …computer science called “Regular Expressions” (aka regexes). We studied two tools… …be constructed is called a regular language. 1.3 REGEX Regex is another form of… …representation for regular languages. Every regular language can also be presented as a regular… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kakkar, H. (2017). Automated Grading and Feedback of Regular Expressions. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9394

Chicago Manual of Style (16th Edition):

Kakkar, Himesh. “Automated Grading and Feedback of Regular Expressions.” 2017. Masters Thesis, Rochester Institute of Technology. Accessed July 14, 2020. https://scholarworks.rit.edu/theses/9394.

MLA Handbook (7th Edition):

Kakkar, Himesh. “Automated Grading and Feedback of Regular Expressions.” 2017. Web. 14 Jul 2020.

Vancouver:

Kakkar H. Automated Grading and Feedback of Regular Expressions. [Internet] [Masters thesis]. Rochester Institute of Technology; 2017. [cited 2020 Jul 14]. Available from: https://scholarworks.rit.edu/theses/9394.

Council of Science Editors:

Kakkar H. Automated Grading and Feedback of Regular Expressions. [Masters Thesis]. Rochester Institute of Technology; 2017. Available from: https://scholarworks.rit.edu/theses/9394


Brno University of Technology

24. Šafář, Martin. Implementace shlukování regulárních výrazů pomocí MapReduce přístupu: Implementation of Regular Expression Grouping in MapReduce Paradigm.

Degree: 2018, Brno University of Technology

 The greatest contribution of this thesis is design and implementation of program, that uses MapReduce paradigm and Apache Hadoop for acceleration of regular expression grouping.… (more)

Subjects/Keywords: Intrusion Detection System; MapReduce; Hadoop; Shlukování regulárních výrazů; Intrusion Detection System; MapReduce; Hadoop; Regular expression grouping

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Šafář, M. (2018). Implementace shlukování regulárních výrazů pomocí MapReduce přístupu: Implementation of Regular Expression Grouping in MapReduce Paradigm. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53052

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Šafář, Martin. “Implementace shlukování regulárních výrazů pomocí MapReduce přístupu: Implementation of Regular Expression Grouping in MapReduce Paradigm.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/53052.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Šafář, Martin. “Implementace shlukování regulárních výrazů pomocí MapReduce přístupu: Implementation of Regular Expression Grouping in MapReduce Paradigm.” 2018. Web. 14 Jul 2020.

Vancouver:

Šafář M. Implementace shlukování regulárních výrazů pomocí MapReduce přístupu: Implementation of Regular Expression Grouping in MapReduce Paradigm. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/53052.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Šafář M. Implementace shlukování regulárních výrazů pomocí MapReduce přístupu: Implementation of Regular Expression Grouping in MapReduce Paradigm. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/53052

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

25. Ježek, Lukáš. Paralelní lexikální analyzátor: Parallel Lexical Analyzer.

Degree: 2019, Brno University of Technology

 This bachelor thesis deals with generating a lexical analyzer which analyzes a file in parallel, i.e. by several threads at a time. The analyzer is… (more)

Subjects/Keywords: Paralelní lexikální analyzátor; konečný automat; regulární výraz; vlákna.; Parallel lexical analyzer; finite automaton; regular expression; threads.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ježek, L. (2019). Paralelní lexikální analyzátor: Parallel Lexical Analyzer. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55977

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ježek, Lukáš. “Paralelní lexikální analyzátor: Parallel Lexical Analyzer.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/55977.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ježek, Lukáš. “Paralelní lexikální analyzátor: Parallel Lexical Analyzer.” 2019. Web. 14 Jul 2020.

Vancouver:

Ježek L. Paralelní lexikální analyzátor: Parallel Lexical Analyzer. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/55977.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ježek L. Paralelní lexikální analyzátor: Parallel Lexical Analyzer. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/55977

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

26. Hatina, Peter. Kontextem řízený lexikální analyzátor: Context-Dependent Scanner.

Degree: 2019, Brno University of Technology

 This paper is devoted to principles of a lexical analysis and to a means of context resolution of a lexeme type, depending on its source… (more)

Subjects/Keywords: Lexikální analýza; regulární výraz; konečný automat; lexém; token; Lexical analysis; regular expression; finite automata; lexeme; token

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hatina, P. (2019). Kontextem řízený lexikální analyzátor: Context-Dependent Scanner. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/56172

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hatina, Peter. “Kontextem řízený lexikální analyzátor: Context-Dependent Scanner.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/56172.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hatina, Peter. “Kontextem řízený lexikální analyzátor: Context-Dependent Scanner.” 2019. Web. 14 Jul 2020.

Vancouver:

Hatina P. Kontextem řízený lexikální analyzátor: Context-Dependent Scanner. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/56172.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hatina P. Kontextem řízený lexikální analyzátor: Context-Dependent Scanner. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/56172

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Université Paris-Sorbonne – Paris IV

27. Ghoul, Dhaou. Classifications et grammaires des invariants lexicaux arabes en prévision d’un traitement informatique de cette langue. Construction d’un modèle théorique de l’arabe : la grammaire des invariants lexicaux temporels : Classifications and grammars of Arab lexical invariants in anticipation of an automatic processing of this language. Construction of a theoretical model of Arabic : grammar of temporal lexical invariants.

Degree: Docteur es, Linguistique, 2016, Université Paris-Sorbonne – Paris IV

Cette thèse porte sur la classification et le traitement des invariants lexicaux arabes qui expriment un aspect temporel afin de créer un modèle qui présente… (more)

Subjects/Keywords: Corpus; Classification; Environnement syntaxique; Expression régulière; Langue arabe; Invariants lexicaux; Règles linguistiques; Schémas de grammaires; Corpus; Classification; Syntactic environment; Regular expression; Arabic language; Lexical invariants; Linguistic rules; Diagrams of grammars

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghoul, D. (2016). Classifications et grammaires des invariants lexicaux arabes en prévision d’un traitement informatique de cette langue. Construction d’un modèle théorique de l’arabe : la grammaire des invariants lexicaux temporels : Classifications and grammars of Arab lexical invariants in anticipation of an automatic processing of this language. Construction of a theoretical model of Arabic : grammar of temporal lexical invariants. (Doctoral Dissertation). Université Paris-Sorbonne – Paris IV. Retrieved from http://www.theses.fr/2016PA040184

Chicago Manual of Style (16th Edition):

Ghoul, Dhaou. “Classifications et grammaires des invariants lexicaux arabes en prévision d’un traitement informatique de cette langue. Construction d’un modèle théorique de l’arabe : la grammaire des invariants lexicaux temporels : Classifications and grammars of Arab lexical invariants in anticipation of an automatic processing of this language. Construction of a theoretical model of Arabic : grammar of temporal lexical invariants.” 2016. Doctoral Dissertation, Université Paris-Sorbonne – Paris IV. Accessed July 14, 2020. http://www.theses.fr/2016PA040184.

MLA Handbook (7th Edition):

Ghoul, Dhaou. “Classifications et grammaires des invariants lexicaux arabes en prévision d’un traitement informatique de cette langue. Construction d’un modèle théorique de l’arabe : la grammaire des invariants lexicaux temporels : Classifications and grammars of Arab lexical invariants in anticipation of an automatic processing of this language. Construction of a theoretical model of Arabic : grammar of temporal lexical invariants.” 2016. Web. 14 Jul 2020.

Vancouver:

Ghoul D. Classifications et grammaires des invariants lexicaux arabes en prévision d’un traitement informatique de cette langue. Construction d’un modèle théorique de l’arabe : la grammaire des invariants lexicaux temporels : Classifications and grammars of Arab lexical invariants in anticipation of an automatic processing of this language. Construction of a theoretical model of Arabic : grammar of temporal lexical invariants. [Internet] [Doctoral dissertation]. Université Paris-Sorbonne – Paris IV; 2016. [cited 2020 Jul 14]. Available from: http://www.theses.fr/2016PA040184.

Council of Science Editors:

Ghoul D. Classifications et grammaires des invariants lexicaux arabes en prévision d’un traitement informatique de cette langue. Construction d’un modèle théorique de l’arabe : la grammaire des invariants lexicaux temporels : Classifications and grammars of Arab lexical invariants in anticipation of an automatic processing of this language. Construction of a theoretical model of Arabic : grammar of temporal lexical invariants. [Doctoral Dissertation]. Université Paris-Sorbonne – Paris IV; 2016. Available from: http://www.theses.fr/2016PA040184

28. Darborg, Alex. Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors.

Degree: Information Systems and Technology, 2018, Mid Sweden University

General Data Protection Regulation, GDPR, is a regulation coming into effect on May 25th 2018. Due to this, organizations face large decisions concerning how… (more)

Subjects/Keywords: GDPR; Machine Learning; Regular Expression; kNN; Python; GDPR; Maskininlärning; Regular Expression; kNN; Python; Software Engineering; Programvaruteknik

…Regexp Regular Expression, reguljära uttryck (sv) Recall Mätvärde för att kolla… …även regular expression att implementeras. 1.4 Konkreta och verifierbara mål Projektets… …enligt · Jämföra regular expression med k-nearest neighbor. · Verktyget ska kunna… …i projektet och implementationen av regular expression gjordes tillsammans med Gabriel… …Därmed har jag använt regular expression för att hitta e-post och IP-nummer i databaser medans… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Darborg, A. (2018). Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors. (Thesis). Mid Sweden University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34070

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Darborg, Alex. “Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors.” 2018. Thesis, Mid Sweden University. Accessed July 14, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34070.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Darborg, Alex. “Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors.” 2018. Web. 14 Jul 2020.

Vancouver:

Darborg A. Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors. [Internet] [Thesis]. Mid Sweden University; 2018. [cited 2020 Jul 14]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34070.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Darborg A. Identifiera känslig data inom ramen för GDPR : Med K-Nearest Neighbors. [Thesis]. Mid Sweden University; 2018. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-34070

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

29. Podhorský, Michal. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata.

Degree: 2020, Brno University of Technology

This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented. Advisors/Committee Members: Masopust, Tomáš (advisor), Techet, Jiří (referee).

Subjects/Keywords: Teorie jazyků; konečné automaty; regulární gramatiky; regulární výrazy; webová aplikace; Java; Java EE; JavaServer Pages; Apache Tomcat.; Formal Language Theory; Finite Automaton; Regular Grammar; Regular Expression; Web Application; Java; Java EE; JavaServer Pages; Apache Tomcat.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Podhorský, M. (2020). Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187763

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Podhorský, Michal. “Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/187763.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Podhorský, Michal. “Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata.” 2020. Web. 14 Jul 2020.

Vancouver:

Podhorský M. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/187763.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Podhorský M. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187763

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brno University of Technology

30. Podhorský, Michal. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata.

Degree: 2020, Brno University of Technology

This work describes models of modern language theory - finite automata, regular grammars and regular expressions. A web application converting among these models is implemented. Advisors/Committee Members: Masopust, Tomáš (advisor), Techet, Jiří (referee).

Subjects/Keywords: Teorie jazyků; konečné automaty; regulární gramatiky; regulární výrazy; webová aplikace; Java; Java EE; JavaServer Pages; Apache Tomcat.; Formal Language Theory; Finite Automaton; Regular Grammar; Regular Expression; Web Application; Java; Java EE; JavaServer Pages; Apache Tomcat.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Podhorský, M. (2020). Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/53963

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Podhorský, Michal. “Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/53963.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Podhorský, Michal. “Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata.” 2020. Web. 14 Jul 2020.

Vancouver:

Podhorský M. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/53963.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Podhorský M. Převody mezi regulárními gramatikami, regulárními výrazy a konečnými automaty: Mutual Transformations of Regular Grammars, Regular Expressions and Finite Automata. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/53963

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3]

.