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 languages). Showing records 1 – 30 of 32 total matches.

[1] [2]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of St. Andrews

1. Carey, Rachael Marie. Graph automatic semigroups .

Degree: 2016, University of St. Andrews

 In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider… (more)

Subjects/Keywords: Semigroups; Regular languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carey, R. M. (2016). Graph automatic semigroups . (Thesis). University of St. Andrews. Retrieved from http://hdl.handle.net/10023/8645

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

Carey, Rachael Marie. “Graph automatic semigroups .” 2016. Thesis, University of St. Andrews. Accessed October 15, 2019. http://hdl.handle.net/10023/8645.

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

MLA Handbook (7th Edition):

Carey, Rachael Marie. “Graph automatic semigroups .” 2016. Web. 15 Oct 2019.

Vancouver:

Carey RM. Graph automatic semigroups . [Internet] [Thesis]. University of St. Andrews; 2016. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10023/8645.

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

Council of Science Editors:

Carey RM. Graph automatic semigroups . [Thesis]. University of St. Andrews; 2016. Available from: http://hdl.handle.net/10023/8645

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


University of Waterloo

2. Lidbetter, Thomas. Counting, Adding, and Regular Languages.

Degree: 2018, University of Waterloo

 In this thesis we consider two mostly disjoint topics in formal language theory that both involve the study and use of regular languages. The first… (more)

Subjects/Keywords: automata theory; regular languages; additive number theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lidbetter, T. (2018). Counting, Adding, and Regular Languages. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14254

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

Lidbetter, Thomas. “Counting, Adding, and Regular Languages.” 2018. Thesis, University of Waterloo. Accessed October 15, 2019. http://hdl.handle.net/10012/14254.

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

MLA Handbook (7th Edition):

Lidbetter, Thomas. “Counting, Adding, and Regular Languages.” 2018. Web. 15 Oct 2019.

Vancouver:

Lidbetter T. Counting, Adding, and Regular Languages. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10012/14254.

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

Council of Science Editors:

Lidbetter T. Counting, Adding, and Regular Languages. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/14254

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


University of Waterloo

3. Ang, Thomas. Problems Related to Shortest Strings in Formal Languages.

Degree: 2010, University of Waterloo

 In formal language theory, studying shortest strings in languages, and variations thereof, can be useful since these strings can serve as small witnesses for properties… (more)

Subjects/Keywords: automata theory; algorithms and complexity; finite state machine; regular languages; regular expressions; formal languages; theory of computation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ang, T. (2010). Problems Related to Shortest Strings in Formal Languages. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5162

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

Ang, Thomas. “Problems Related to Shortest Strings in Formal Languages.” 2010. Thesis, University of Waterloo. Accessed October 15, 2019. http://hdl.handle.net/10012/5162.

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

MLA Handbook (7th Edition):

Ang, Thomas. “Problems Related to Shortest Strings in Formal Languages.” 2010. Web. 15 Oct 2019.

Vancouver:

Ang T. Problems Related to Shortest Strings in Formal Languages. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10012/5162.

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

Council of Science Editors:

Ang T. Problems Related to Shortest Strings in Formal Languages. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5162

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


University of Pennsylvania

4. Raghothaman, Mukund. Regular Programming Over Data Streams.

Degree: 2017, University of Pennsylvania

 Data streams arise in a variety of applications, such as feeds from financial markets, event streams from sensors and medical devices, logs produced by long-running… (more)

Subjects/Keywords: Data streams; Programming languages; Quantitative analysis; Regular expressions; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Raghothaman, M. (2017). Regular Programming Over Data Streams. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/2540

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

Raghothaman, Mukund. “Regular Programming Over Data Streams.” 2017. Thesis, University of Pennsylvania. Accessed October 15, 2019. https://repository.upenn.edu/edissertations/2540.

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

MLA Handbook (7th Edition):

Raghothaman, Mukund. “Regular Programming Over Data Streams.” 2017. Web. 15 Oct 2019.

Vancouver:

Raghothaman M. Regular Programming Over Data Streams. [Internet] [Thesis]. University of Pennsylvania; 2017. [cited 2019 Oct 15]. Available from: https://repository.upenn.edu/edissertations/2540.

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

Council of Science Editors:

Raghothaman M. Regular Programming Over Data Streams. [Thesis]. University of Pennsylvania; 2017. Available from: https://repository.upenn.edu/edissertations/2540

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

5. TAN WAI YEAN. Reducibilities between Regular Languages.

Degree: 2010, National University of Singapore

Subjects/Keywords: automata; transducer; reducible; injective; regular; languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

YEAN, T. W. (2010). Reducibilities between Regular Languages. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/22105

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

YEAN, TAN WAI. “Reducibilities between Regular Languages.” 2010. Thesis, National University of Singapore. Accessed October 15, 2019. http://scholarbank.nus.edu.sg/handle/10635/22105.

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

MLA Handbook (7th Edition):

YEAN, TAN WAI. “Reducibilities between Regular Languages.” 2010. Web. 15 Oct 2019.

Vancouver:

YEAN TW. Reducibilities between Regular Languages. [Internet] [Thesis]. National University of Singapore; 2010. [cited 2019 Oct 15]. Available from: http://scholarbank.nus.edu.sg/handle/10635/22105.

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

Council of Science Editors:

YEAN TW. Reducibilities between Regular Languages. [Thesis]. National University of Singapore; 2010. Available from: http://scholarbank.nus.edu.sg/handle/10635/22105

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


Stockholm University

6. Haglund, Tore. Irregular English verbs with regular variants in the past tense and/or the past participle : A corpus-based study of light, speed, and prove.

Degree: English, 2019, Stockholm University

  About fifty out of approximately 250 irregular English verbs have regular alternatives in the past tense and/or the past participle. There are often marked… (more)

Subjects/Keywords: Verb; morphology; regular; irregular; past; tense; participle; corpus; English; Specific Languages; Studier av enskilda språk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Haglund, T. (2019). Irregular English verbs with regular variants in the past tense and/or the past participle : A corpus-based study of light, speed, and prove. (Thesis). Stockholm University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-170048

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

Haglund, Tore. “Irregular English verbs with regular variants in the past tense and/or the past participle : A corpus-based study of light, speed, and prove.” 2019. Thesis, Stockholm University. Accessed October 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-170048.

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

MLA Handbook (7th Edition):

Haglund, Tore. “Irregular English verbs with regular variants in the past tense and/or the past participle : A corpus-based study of light, speed, and prove.” 2019. Web. 15 Oct 2019.

Vancouver:

Haglund T. Irregular English verbs with regular variants in the past tense and/or the past participle : A corpus-based study of light, speed, and prove. [Internet] [Thesis]. Stockholm University; 2019. [cited 2019 Oct 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-170048.

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

Council of Science Editors:

Haglund T. Irregular English verbs with regular variants in the past tense and/or the past participle : A corpus-based study of light, speed, and prove. [Thesis]. Stockholm University; 2019. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-170048

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

7. Karakoidas, Vassilios. Ενσωμάτωση γλωσσών ειδικού πεδίου με γενικές γλώσσες προγραμματισμού γενικού σκοπού.

Degree: 2015, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών

Domain-specific Languages (DSL), also known as micro-languages or little languages, are programming languages designed to specifically solve problems within a particular do- main. They are… (more)

Subjects/Keywords: Γλώσσες προγραμαματισμού; Γλώσσες ειδικού σκοπού; Java; SQL; Κανονικές εκφράσεις; Programming languages; Domain - specific languages; Java; SQL; Regular expressions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Karakoidas, V. (2015). Ενσωμάτωση γλωσσών ειδικού πεδίου με γενικές γλώσσες προγραμματισμού γενικού σκοπού. (Thesis). Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Retrieved from http://hdl.handle.net/10442/hedi/43147

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

Karakoidas, Vassilios. “Ενσωμάτωση γλωσσών ειδικού πεδίου με γενικές γλώσσες προγραμματισμού γενικού σκοπού.” 2015. Thesis, Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών. Accessed October 15, 2019. http://hdl.handle.net/10442/hedi/43147.

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

MLA Handbook (7th Edition):

Karakoidas, Vassilios. “Ενσωμάτωση γλωσσών ειδικού πεδίου με γενικές γλώσσες προγραμματισμού γενικού σκοπού.” 2015. Web. 15 Oct 2019.

Vancouver:

Karakoidas V. Ενσωμάτωση γλωσσών ειδικού πεδίου με γενικές γλώσσες προγραμματισμού γενικού σκοπού. [Internet] [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2015. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10442/hedi/43147.

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

Council of Science Editors:

Karakoidas V. Ενσωμάτωση γλωσσών ειδικού πεδίου με γενικές γλώσσες προγραμματισμού γενικού σκοπού. [Thesis]. Athens University Economics and Business (AUEB); Οικονομικό Πανεπιστήμιο Αθηνών; 2015. Available from: http://hdl.handle.net/10442/hedi/43147

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


University of Waterloo

8. Krawetz, Bryan. Monoids and the State Complexity of the Operation root(<i>L</i>).

Degree: 2004, University of Waterloo

 In this thesis, we cover the general topic of state complexity. In particular, we examine the bounds on the state complexity of some different representations… (more)

Subjects/Keywords: Computer Science; state complexity; monoids; formal languages; regular languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krawetz, B. (2004). Monoids and the State Complexity of the Operation root(<i>L</i>). (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1034

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

Krawetz, Bryan. “Monoids and the State Complexity of the Operation root(<i>L</i>).” 2004. Thesis, University of Waterloo. Accessed October 15, 2019. http://hdl.handle.net/10012/1034.

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

MLA Handbook (7th Edition):

Krawetz, Bryan. “Monoids and the State Complexity of the Operation root(<i>L</i>).” 2004. Web. 15 Oct 2019.

Vancouver:

Krawetz B. Monoids and the State Complexity of the Operation root(<i>L</i>). [Internet] [Thesis]. University of Waterloo; 2004. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10012/1034.

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

Council of Science Editors:

Krawetz B. Monoids and the State Complexity of the Operation root(<i>L</i>). [Thesis]. University of Waterloo; 2004. Available from: http://hdl.handle.net/10012/1034

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


Queens University

9. Ng, Timothy. Distances Between Languages: Algorithms and Descriptional Complexity .

Degree: Computing, Queens University

 We consider the descriptional complexity of neighbourhoods of regular languages and the computational complexity of computing the distance between languages. Distance measures are defined on… (more)

Subjects/Keywords: Regular Languages; Automata Theory; Formal Languages; Descriptional Complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ng, T. (n.d.). Distances Between Languages: Algorithms and Descriptional Complexity . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/22018

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ng, Timothy. “Distances Between Languages: Algorithms and Descriptional Complexity .” Thesis, Queens University. Accessed October 15, 2019. http://hdl.handle.net/1974/22018.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ng, Timothy. “Distances Between Languages: Algorithms and Descriptional Complexity .” Web. 15 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Ng T. Distances Between Languages: Algorithms and Descriptional Complexity . [Internet] [Thesis]. Queens University; [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1974/22018.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Ng T. Distances Between Languages: Algorithms and Descriptional Complexity . [Thesis]. Queens University; Available from: http://hdl.handle.net/1974/22018

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.


University of Western Ontario

10. Gao, Yuan. Advanced Topics on State Complexity of Combined Operations.

Degree: 2010, University of Western Ontario

 State complexity is a fundamental topic in formal languages and automata theory. The study of state complexity is also strongly motivated by applications of finite… (more)

Subjects/Keywords: state complexity; regular languages; combined operations; deterministic finite automata; estimation of state complexity; approximation of state complexity; Theory and Algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gao, Y. (2010). Advanced Topics on State Complexity of Combined Operations. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/65

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

Gao, Yuan. “Advanced Topics on State Complexity of Combined Operations.” 2010. Thesis, University of Western Ontario. Accessed October 15, 2019. https://ir.lib.uwo.ca/etd/65.

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

MLA Handbook (7th Edition):

Gao, Yuan. “Advanced Topics on State Complexity of Combined Operations.” 2010. Web. 15 Oct 2019.

Vancouver:

Gao Y. Advanced Topics on State Complexity of Combined Operations. [Internet] [Thesis]. University of Western Ontario; 2010. [cited 2019 Oct 15]. Available from: https://ir.lib.uwo.ca/etd/65.

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

Council of Science Editors:

Gao Y. Advanced Topics on State Complexity of Combined Operations. [Thesis]. University of Western Ontario; 2010. Available from: https://ir.lib.uwo.ca/etd/65

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

11. Wagner, Mitchell James. Reconstructing Signaling Pathways Using Regular-Language Constrained Paths.

Degree: MS, Computer Science, 2018, Virginia Tech

 Signaling pathways are widely studied in systems biology. Several databases catalog our knowledge of these pathways, including the proteins and interactions that comprise them. However,… (more)

Subjects/Keywords: Regular Languages; Shortest Paths; Signaling Networks

…47 5.6 Regular Expression Performance and Redundancy . . . . . . . . . . . . . . . 48… …satisfy a regular language . . . . . . . . . . . . 19 3.2 An illustration of the proposed… …7 4.1 Description and shorthand for the primary, prioritized regular expressions used in… …that satisfies a provided regular language constraint, such that the concatenated label… …sequence of “known” and “unknown” edges forms a word in the regular language. The regular… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wagner, M. J. (2018). Reconstructing Signaling Pathways Using Regular-Language Constrained Paths. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/85044

Chicago Manual of Style (16th Edition):

Wagner, Mitchell James. “Reconstructing Signaling Pathways Using Regular-Language Constrained Paths.” 2018. Masters Thesis, Virginia Tech. Accessed October 15, 2019. http://hdl.handle.net/10919/85044.

MLA Handbook (7th Edition):

Wagner, Mitchell James. “Reconstructing Signaling Pathways Using Regular-Language Constrained Paths.” 2018. Web. 15 Oct 2019.

Vancouver:

Wagner MJ. Reconstructing Signaling Pathways Using Regular-Language Constrained Paths. [Internet] [Masters thesis]. Virginia Tech; 2018. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/10919/85044.

Council of Science Editors:

Wagner MJ. Reconstructing Signaling Pathways Using Regular-Language Constrained Paths. [Masters Thesis]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/85044

12. Ulus, Dogan. Pattern Matching with Time : Theory and Applications : Filtrage par motif temporisé : Théorie et Applications.

Degree: Docteur es, Mathématiques et Informatique, 2018, Grenoble Alpes

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

Subjects/Keywords: Vérification; Surveillance; Langages temporisés; Expressions rationnelles; Des circuits analogiques; Verificaton; Monitoring; Timed languages; Regular expressions; Analog circuits; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ulus, D. (2018). Pattern Matching with Time : Theory and Applications : Filtrage par motif temporisé : Théorie et Applications. (Doctoral Dissertation). Grenoble Alpes. Retrieved from http://www.theses.fr/2018GREAM003

Chicago Manual of Style (16th Edition):

Ulus, Dogan. “Pattern Matching with Time : Theory and Applications : Filtrage par motif temporisé : Théorie et Applications.” 2018. Doctoral Dissertation, Grenoble Alpes. Accessed October 15, 2019. http://www.theses.fr/2018GREAM003.

MLA Handbook (7th Edition):

Ulus, Dogan. “Pattern Matching with Time : Theory and Applications : Filtrage par motif temporisé : Théorie et Applications.” 2018. Web. 15 Oct 2019.

Vancouver:

Ulus D. Pattern Matching with Time : Theory and Applications : Filtrage par motif temporisé : Théorie et Applications. [Internet] [Doctoral dissertation]. Grenoble Alpes; 2018. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2018GREAM003.

Council of Science Editors:

Ulus D. Pattern Matching with Time : Theory and Applications : Filtrage par motif temporisé : Théorie et Applications. [Doctoral Dissertation]. Grenoble Alpes; 2018. Available from: http://www.theses.fr/2018GREAM003

13. Pelletier, Vivien. Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité : Non-regular over-approximations and termination for reachability analysis.

Degree: Docteur es, Informatique, 2017, Université d'Orléans

L’analyse d’accessibilité est une des composantes de l’analyse de modèles. Elle consiste à modéliser un système complexe par trois ensembles : le langage initial, le… (more)

Subjects/Keywords: Langages non réguliers d’arbres; Réécriture; Stratégie de réécriture; Analyse d’accessibilité; Non regular tree languages; Rewriting; Rewriting strategies; Reachability analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pelletier, V. (2017). Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité : Non-regular over-approximations and termination for reachability analysis. (Doctoral Dissertation). Université d'Orléans. Retrieved from http://www.theses.fr/2017ORLE2044

Chicago Manual of Style (16th Edition):

Pelletier, Vivien. “Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité : Non-regular over-approximations and termination for reachability analysis.” 2017. Doctoral Dissertation, Université d'Orléans. Accessed October 15, 2019. http://www.theses.fr/2017ORLE2044.

MLA Handbook (7th Edition):

Pelletier, Vivien. “Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité : Non-regular over-approximations and termination for reachability analysis.” 2017. Web. 15 Oct 2019.

Vancouver:

Pelletier V. Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité : Non-regular over-approximations and termination for reachability analysis. [Internet] [Doctoral dissertation]. Université d'Orléans; 2017. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2017ORLE2044.

Council of Science Editors:

Pelletier V. Sur-approximations non régulières et terminaison pour l’analyse d’accessibilité : Non-regular over-approximations and termination for reachability analysis. [Doctoral Dissertation]. Université d'Orléans; 2017. Available from: http://www.theses.fr/2017ORLE2044


Queens University

14. Palioudakis, Alexandros. State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism .

Degree: Computing, 2014, Queens University

 Various approaches of quantifying nondeterminism in nondeterministic finite automata (NFA) are considered. We consider nondeterministic finite automata having finite tree width (ftw-NFA) where the computation… (more)

Subjects/Keywords: unary regular languages; finite automata; limited nondeterminism; deterministic automata with multiple initial states; language operations; state complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Palioudakis, A. (2014). State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/12453

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

Palioudakis, Alexandros. “State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism .” 2014. Thesis, Queens University. Accessed October 15, 2019. http://hdl.handle.net/1974/12453.

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

MLA Handbook (7th Edition):

Palioudakis, Alexandros. “State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism .” 2014. Web. 15 Oct 2019.

Vancouver:

Palioudakis A. State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism . [Internet] [Thesis]. Queens University; 2014. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1974/12453.

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

Council of Science Editors:

Palioudakis A. State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism . [Thesis]. Queens University; 2014. Available from: http://hdl.handle.net/1974/12453

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

15. Van Rooijen, Lorijn. Une approche combinatoire du problème de séparation pour les langages réguliers : A combinatorial approach to the separation problem for regular languages.

Degree: Docteur es, Informatique, 2014, Bordeaux

Le problème de séparation pour une classe de langages S est le suivant : étant donnés deux langages L1 et L2, existe-t-il un langage appartenant… (more)

Subjects/Keywords: Langages réguliers; Séparation; Logiques; Automates; Monoïdes; Langages testables par morceaux; Langages non-ambigus; Langages localement testables; Langages localement testables à seuil; Langages algébriques; Regular languages; Separation; Logics; Automata; Monoids; Piecewise testable languages; Unambiguous languages; Locally testable languages; Locally threshold testable languages; Context-free languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Rooijen, L. (2014). Une approche combinatoire du problème de séparation pour les langages réguliers : A combinatorial approach to the separation problem for regular languages. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2014BORD0229

Chicago Manual of Style (16th Edition):

Van Rooijen, Lorijn. “Une approche combinatoire du problème de séparation pour les langages réguliers : A combinatorial approach to the separation problem for regular languages.” 2014. Doctoral Dissertation, Bordeaux. Accessed October 15, 2019. http://www.theses.fr/2014BORD0229.

MLA Handbook (7th Edition):

Van Rooijen, Lorijn. “Une approche combinatoire du problème de séparation pour les langages réguliers : A combinatorial approach to the separation problem for regular languages.” 2014. Web. 15 Oct 2019.

Vancouver:

Van Rooijen L. Une approche combinatoire du problème de séparation pour les langages réguliers : A combinatorial approach to the separation problem for regular languages. [Internet] [Doctoral dissertation]. Bordeaux; 2014. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2014BORD0229.

Council of Science Editors:

Van Rooijen L. Une approche combinatoire du problème de séparation pour les langages réguliers : A combinatorial approach to the separation problem for regular languages. [Doctoral Dissertation]. Bordeaux; 2014. Available from: http://www.theses.fr/2014BORD0229

16. Akkara, Pinto. Applying DNA Self-assembly in Formal Language Theory.

Degree: MS, Engineering and Applied Science: Computer Engineering, 2013, University of Cincinnati

 The emerging field of DNA computing has found numerous applications in different areas including digital storage, intelligent systems and nanotechnology. DNA computing is capable of… (more)

Subjects/Keywords: Computer Science; DNA Self-assembly; Formal Languages; Regular Languages; Context-Free Languages

…This thesis focuses on the association of DNA self-assembly with regular languages which can… …implemented to realize DNA complexes analogous to regular languages and also to linear context-free… …sticky-ends is considered. Winfree’s first theorem states that “For all regular languages L… …17 Figure 2. 14: A regular language with derivation based on Winfree’s first theorem [… …languages including finite state automata, pushdown automata, and Turing machines [1]… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Akkara, P. (2013). Applying DNA Self-assembly in Formal Language Theory. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1368014016

Chicago Manual of Style (16th Edition):

Akkara, Pinto. “Applying DNA Self-assembly in Formal Language Theory.” 2013. Masters Thesis, University of Cincinnati. Accessed October 15, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1368014016.

MLA Handbook (7th Edition):

Akkara, Pinto. “Applying DNA Self-assembly in Formal Language Theory.” 2013. Web. 15 Oct 2019.

Vancouver:

Akkara P. Applying DNA Self-assembly in Formal Language Theory. [Internet] [Masters thesis]. University of Cincinnati; 2013. [cited 2019 Oct 15]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1368014016.

Council of Science Editors:

Akkara P. Applying DNA Self-assembly in Formal Language Theory. [Masters Thesis]. University of Cincinnati; 2013. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1368014016

17. Mens, Irini-Eleftheria. Learning regular languages over large alphabets : Apprentissage de langages réguliers sur des alphabets de grandes tailles.

Degree: Docteur es, Mathématiques et Informatique, 2017, Grenoble Alpes

L'apprentissage de langages réguliers est un sous-ensemble de l'apprentissage automatique qui s'est révélé utile dans de nombreux domaines tels que l'intelli-gence artificielle, les réseaux de… (more)

Subjects/Keywords: Automate; Langages reguliers; Apprentissage automatique; Alphabets de grandes tailles; Alphabets infinis; Automata; Regular languages; Automata learning; Large alphabets; Infinite alphabets; Machine learning; 004

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mens, I. (2017). Learning regular languages over large alphabets : Apprentissage de langages réguliers sur des alphabets de grandes tailles. (Doctoral Dissertation). Grenoble Alpes. Retrieved from http://www.theses.fr/2017GREAM052

Chicago Manual of Style (16th Edition):

Mens, Irini-Eleftheria. “Learning regular languages over large alphabets : Apprentissage de langages réguliers sur des alphabets de grandes tailles.” 2017. Doctoral Dissertation, Grenoble Alpes. Accessed October 15, 2019. http://www.theses.fr/2017GREAM052.

MLA Handbook (7th Edition):

Mens, Irini-Eleftheria. “Learning regular languages over large alphabets : Apprentissage de langages réguliers sur des alphabets de grandes tailles.” 2017. Web. 15 Oct 2019.

Vancouver:

Mens I. Learning regular languages over large alphabets : Apprentissage de langages réguliers sur des alphabets de grandes tailles. [Internet] [Doctoral dissertation]. Grenoble Alpes; 2017. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2017GREAM052.

Council of Science Editors:

Mens I. Learning regular languages over large alphabets : Apprentissage de langages réguliers sur des alphabets de grandes tailles. [Doctoral Dissertation]. Grenoble Alpes; 2017. Available from: http://www.theses.fr/2017GREAM052


Penn State University

18. Chattopadhyay, Ishanu. Quantitative Control of Probabilistic Discrete Event Systems: A Measure-theoretic Approach.

Degree: PhD, Mechanical Engineering, 2006, Penn State University

 The theory of Supervisory Control for Discrete Event Systems (DES), originally initiated by Ramadge and Wonham, is based on a non-probabilistic language framework. However, any… (more)

Subjects/Keywords: Discrete Event Systems; Regular Languages; Language Measure; Optimal Control; Partial Observation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chattopadhyay, I. (2006). Quantitative Control of Probabilistic Discrete Event Systems: A Measure-theoretic Approach. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/7161

Chicago Manual of Style (16th Edition):

Chattopadhyay, Ishanu. “Quantitative Control of Probabilistic Discrete Event Systems: A Measure-theoretic Approach.” 2006. Doctoral Dissertation, Penn State University. Accessed October 15, 2019. https://etda.libraries.psu.edu/catalog/7161.

MLA Handbook (7th Edition):

Chattopadhyay, Ishanu. “Quantitative Control of Probabilistic Discrete Event Systems: A Measure-theoretic Approach.” 2006. Web. 15 Oct 2019.

Vancouver:

Chattopadhyay I. Quantitative Control of Probabilistic Discrete Event Systems: A Measure-theoretic Approach. [Internet] [Doctoral dissertation]. Penn State University; 2006. [cited 2019 Oct 15]. Available from: https://etda.libraries.psu.edu/catalog/7161.

Council of Science Editors:

Chattopadhyay I. Quantitative Control of Probabilistic Discrete Event Systems: A Measure-theoretic Approach. [Doctoral Dissertation]. Penn State University; 2006. Available from: https://etda.libraries.psu.edu/catalog/7161


Universiteit Hasselt

19. GELADE, Wouter. Optimization of XML schema languages: complexity of counting and the shuffle operator.

Degree: 2006, Universiteit Hasselt

Subjects/Keywords: Turing machine; Tiling; regular expressions; tree languages; unranked tree automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

GELADE, W. (2006). Optimization of XML schema languages: complexity of counting and the shuffle operator. (Thesis). Universiteit Hasselt. Retrieved from http://hdl.handle.net/1942/1063

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

GELADE, Wouter. “Optimization of XML schema languages: complexity of counting and the shuffle operator.” 2006. Thesis, Universiteit Hasselt. Accessed October 15, 2019. http://hdl.handle.net/1942/1063.

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

MLA Handbook (7th Edition):

GELADE, Wouter. “Optimization of XML schema languages: complexity of counting and the shuffle operator.” 2006. Web. 15 Oct 2019.

Vancouver:

GELADE W. Optimization of XML schema languages: complexity of counting and the shuffle operator. [Internet] [Thesis]. Universiteit Hasselt; 2006. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1942/1063.

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

Council of Science Editors:

GELADE W. Optimization of XML schema languages: complexity of counting and the shuffle operator. [Thesis]. Universiteit Hasselt; 2006. Available from: http://hdl.handle.net/1942/1063

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

20. Pierron, Théo. Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings.

Degree: Docteur es, Informatique, 2019, Bordeaux

Cette thèse présente des résultats obtenus dans deux domaines : la théorie des langages, et la théorie des graphes. En théorie des langages, on s’intéresse… (more)

Subjects/Keywords: Coloration de graphe; Graphe planaire; Méthode de déchargement; Langage régulier; Séparation de langages; Graph coloring; Planar graph; Discharging method; Regular language; Languages separation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pierron, T. (2019). Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings. (Doctoral Dissertation). Bordeaux. Retrieved from http://www.theses.fr/2019BORD0119

Chicago Manual of Style (16th Edition):

Pierron, Théo. “Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings.” 2019. Doctoral Dissertation, Bordeaux. Accessed October 15, 2019. http://www.theses.fr/2019BORD0119.

MLA Handbook (7th Edition):

Pierron, Théo. “Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings.” 2019. Web. 15 Oct 2019.

Vancouver:

Pierron T. Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings. [Internet] [Doctoral dissertation]. Bordeaux; 2019. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2019BORD0119.

Council of Science Editors:

Pierron T. Induction Schemes : From Language Separation to Graph Colorings : Schémas d'induction : from languages separation to graph colorings. [Doctoral Dissertation]. Bordeaux; 2019. Available from: http://www.theses.fr/2019BORD0119


Université de Montréal

21. Cadilhac, Michaël. Automates à contraintes semilinéaires = Automata with a semilinear constraint .

Degree: 2013, Université de Montréal

 Cette thèse présente une étude dans divers domaines de l'informatique théorique de modèles de calculs combinant automates finis et contraintes arithmétiques. Nous nous intéressons aux… (more)

Subjects/Keywords: Automates; Automata; Automates de Parikh; Parikh automata; Ensembles semilinéaires; Semilinear sets; Fonctions affines; Affine functions; Decidabilité; Decidability; Langages bornés; Bounded languages; Langages réguliers; Regular languages; Monoïdes typés; Typed monoids; Series rationnelles; Rational series; Model-checking; Model-checking

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cadilhac, M. (2013). Automates à contraintes semilinéaires = Automata with a semilinear constraint . (Thesis). Université de Montréal. Retrieved from http://hdl.handle.net/1866/10485

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

Cadilhac, Michaël. “Automates à contraintes semilinéaires = Automata with a semilinear constraint .” 2013. Thesis, Université de Montréal. Accessed October 15, 2019. http://hdl.handle.net/1866/10485.

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

MLA Handbook (7th Edition):

Cadilhac, Michaël. “Automates à contraintes semilinéaires = Automata with a semilinear constraint .” 2013. Web. 15 Oct 2019.

Vancouver:

Cadilhac M. Automates à contraintes semilinéaires = Automata with a semilinear constraint . [Internet] [Thesis]. Université de Montréal; 2013. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1866/10485.

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

Council of Science Editors:

Cadilhac M. Automates à contraintes semilinéaires = Automata with a semilinear constraint . [Thesis]. Université de Montréal; 2013. Available from: http://hdl.handle.net/1866/10485

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

22. Lomsak, Daniel. Toward More Composable Software-Security Policies: Tools and Techniques.

Degree: 2013, University of South Florida

 Complex software-security policies are dicult to specify, understand, and update. The same is true for complex software in general, but while many tools and techniques… (more)

Subjects/Keywords: Policy Composition; Policy-Specification Languages; Signed Regular Languages; Software Engineering; Visual Specification; Computer Sciences

…common policy-combination strategies, and regular languages are closed under intersection… …additional burden. Policy-specification languages exist in which policy intent is more readily… …that sequence. Aspect-oriented languages, such as AspectJ, allow program code to be… …of which a security policy is one. Although most programming languages have some means of… …portable to other policy-specification languages with first-class and parameterized policies… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lomsak, D. (2013). Toward More Composable Software-Security Policies: Tools and Techniques. (Thesis). University of South Florida. Retrieved from https://scholarcommons.usf.edu/etd/4531

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

Lomsak, Daniel. “Toward More Composable Software-Security Policies: Tools and Techniques.” 2013. Thesis, University of South Florida. Accessed October 15, 2019. https://scholarcommons.usf.edu/etd/4531.

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

MLA Handbook (7th Edition):

Lomsak, Daniel. “Toward More Composable Software-Security Policies: Tools and Techniques.” 2013. Web. 15 Oct 2019.

Vancouver:

Lomsak D. Toward More Composable Software-Security Policies: Tools and Techniques. [Internet] [Thesis]. University of South Florida; 2013. [cited 2019 Oct 15]. Available from: https://scholarcommons.usf.edu/etd/4531.

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

Council of Science Editors:

Lomsak D. Toward More Composable Software-Security Policies: Tools and Techniques. [Thesis]. University of South Florida; 2013. Available from: https://scholarcommons.usf.edu/etd/4531

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

23. Foster, John Nathan. Bidirectional Programming Languages.

Degree: 2009, University of Pennsylvania

 The need to edit source data through a view arises in a host of applications across many different areas of computing. Unfortunately, few existing systems… (more)

Subjects/Keywords: bidirectional languages; lenses; view update; regular expression types; Databases and Information Systems; Programming Languages and Compilers

…13 2.3 Regular Languages… …functions, etc.) and notions from formal language theory (strings, languages, regular… …vn ) then m = n and ui = vi for every i from 1 to n. 2.3 Regular Languages This… …section reviews the regular languages, which enjoy many nice properties including closure under… …regular languages. We give a syntactic characterization in terms of regular expressions here… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foster, J. N. (2009). Bidirectional Programming Languages. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/56

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

Foster, John Nathan. “Bidirectional Programming Languages.” 2009. Thesis, University of Pennsylvania. Accessed October 15, 2019. https://repository.upenn.edu/edissertations/56.

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

MLA Handbook (7th Edition):

Foster, John Nathan. “Bidirectional Programming Languages.” 2009. Web. 15 Oct 2019.

Vancouver:

Foster JN. Bidirectional Programming Languages. [Internet] [Thesis]. University of Pennsylvania; 2009. [cited 2019 Oct 15]. Available from: https://repository.upenn.edu/edissertations/56.

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

Council of Science Editors:

Foster JN. Bidirectional Programming Languages. [Thesis]. University of Pennsylvania; 2009. Available from: https://repository.upenn.edu/edissertations/56

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

24. Brunet, Paul. Algebras of Relations : from algorithms to formal proofs : Algèbres de relations : des algorithmes aux preuves formelles.

Degree: Docteur es, Informatique, 2016, Lyon

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

Subjects/Keywords: Algèbre de relations; Algèbre de Kleene; Expressions régulières; Langages formels; Théorie des automates; Sémantique des programmes; Preuve assistée par ordinateur; Relation algebra; Kleene algebra; Regular expressions; Formal languages; Automata theory; Program semantics; Proof assistant; 004.015 1

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brunet, P. (2016). Algebras of Relations : from algorithms to formal proofs : Algèbres de relations : des algorithmes aux preuves formelles. (Doctoral Dissertation). Lyon. Retrieved from http://www.theses.fr/2016LYSE1198

Chicago Manual of Style (16th Edition):

Brunet, Paul. “Algebras of Relations : from algorithms to formal proofs : Algèbres de relations : des algorithmes aux preuves formelles.” 2016. Doctoral Dissertation, Lyon. Accessed October 15, 2019. http://www.theses.fr/2016LYSE1198.

MLA Handbook (7th Edition):

Brunet, Paul. “Algebras of Relations : from algorithms to formal proofs : Algèbres de relations : des algorithmes aux preuves formelles.” 2016. Web. 15 Oct 2019.

Vancouver:

Brunet P. Algebras of Relations : from algorithms to formal proofs : Algèbres de relations : des algorithmes aux preuves formelles. [Internet] [Doctoral dissertation]. Lyon; 2016. [cited 2019 Oct 15]. Available from: http://www.theses.fr/2016LYSE1198.

Council of Science Editors:

Brunet P. Algebras of Relations : from algorithms to formal proofs : Algèbres de relations : des algorithmes aux preuves formelles. [Doctoral Dissertation]. Lyon; 2016. Available from: http://www.theses.fr/2016LYSE1198

25. Krebs, T.J.P. Automatic maps on the Gaussian integers:.

Degree: 2013, Delft University of Technology

 How can you define automatic maps on the Gaussian integers? The two key components of an automatic map are an automaton, and a numeration system… (more)

Subjects/Keywords: automata; numeration systems; gaussian integers; automatic sequences; automatic maps; regular languages; radix systems; cobham; ring

Regular Languages An import family of languages that has proven to be of both theoretical and… …practical value are the regular languages. Definition 2.3.1. Let Σ be an alphabet. The regular… …languages over Σ are defined inductively as follows: • the empty language ∅ is regular, • the… …language {s} is regular for every s ∈ Σ, • the language L1 ∪ L2 for regular languages… …L1 and L2 over Σ is regular, • the language L1 L2 for regular languages L1 and L2 over Σ… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krebs, T. J. P. (2013). Automatic maps on the Gaussian integers:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7bec892b-9fc7-4349-bbbf-bbfd4c859f19

Chicago Manual of Style (16th Edition):

Krebs, T J P. “Automatic maps on the Gaussian integers:.” 2013. Masters Thesis, Delft University of Technology. Accessed October 15, 2019. http://resolver.tudelft.nl/uuid:7bec892b-9fc7-4349-bbbf-bbfd4c859f19.

MLA Handbook (7th Edition):

Krebs, T J P. “Automatic maps on the Gaussian integers:.” 2013. Web. 15 Oct 2019.

Vancouver:

Krebs TJP. Automatic maps on the Gaussian integers:. [Internet] [Masters thesis]. Delft University of Technology; 2013. [cited 2019 Oct 15]. Available from: http://resolver.tudelft.nl/uuid:7bec892b-9fc7-4349-bbbf-bbfd4c859f19.

Council of Science Editors:

Krebs TJP. Automatic maps on the Gaussian integers:. [Masters Thesis]. Delft University of Technology; 2013. Available from: http://resolver.tudelft.nl/uuid:7bec892b-9fc7-4349-bbbf-bbfd4c859f19


Brno University of Technology

26. Bambas, Tomáš. Automatická tvorba testů pro předmět ISJ .

Degree: 2012, Brno University of Technology

 Tato bakalářská práce se zabývá tvorbou testů do předmětu ISJ. Cílem práce je implementace aplikace pro automatickou inteligentní tvorbu testů týkajících se skriptovacích jazyků Ruby… (more)

Subjects/Keywords: elektronická výuka; LaTeX; LMS; programovací soutěže; Python; regulární výrazy; Ruby; samovýuka; skriptovací jazyky; tvorba testů; výuka programování; e-learning; LaTeX; LMS; programming contests; programming teaching; Python; regular expressions; Ruby; scripting languages; self-learning; tests creation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bambas, T. (2012). Automatická tvorba testů pro předmět ISJ . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55277

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

Bambas, Tomáš. “Automatická tvorba testů pro předmět ISJ .” 2012. Thesis, Brno University of Technology. Accessed October 15, 2019. http://hdl.handle.net/11012/55277.

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

MLA Handbook (7th Edition):

Bambas, Tomáš. “Automatická tvorba testů pro předmět ISJ .” 2012. Web. 15 Oct 2019.

Vancouver:

Bambas T. Automatická tvorba testů pro předmět ISJ . [Internet] [Thesis]. Brno University of Technology; 2012. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/11012/55277.

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

Council of Science Editors:

Bambas T. Automatická tvorba testů pro předmět ISJ . [Thesis]. Brno University of Technology; 2012. Available from: http://hdl.handle.net/11012/55277

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


Brno University of Technology

27. Bureš, Richard. Nové struktury a operace v matematické informatice .

Degree: 2018, Brno University of Technology

 Cílem této práce je podívat se na některé známé a na některé v této práci vytvořené operace a na jejich vlastnosti nad především regulárními, ale… (more)

Subjects/Keywords: automaty; konečné automaty; zásobníkové automaty; operace nad automaty; regulární ja- zyky; bezkontextové jazyky; uzávěrové vlastnosti operací; automata; finite automata; pushdown automata; operations over automata; regular langu- ages; context-free languages; closure properties

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bureš, R. (2018). Nové struktury a operace v matematické informatice . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/85071

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

Bureš, Richard. “Nové struktury a operace v matematické informatice .” 2018. Thesis, Brno University of Technology. Accessed October 15, 2019. http://hdl.handle.net/11012/85071.

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

MLA Handbook (7th Edition):

Bureš, Richard. “Nové struktury a operace v matematické informatice .” 2018. Web. 15 Oct 2019.

Vancouver:

Bureš R. Nové struktury a operace v matematické informatice . [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2019 Oct 15]. Available from: http://hdl.handle.net/11012/85071.

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

Council of Science Editors:

Bureš R. Nové struktury a operace v matematické informatice . [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/85071

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


Queens University

28. Keeler, Chris. New metrics for finite automaton complexity and subregular language hierarchies .

Degree: Computing, Queens University

 The degree of ambiguity of nondeterministic finite automata (NFA) has been studied significantly since at least the 1980s. Roughly speaking, the degree of ambiguity counts… (more)

Subjects/Keywords: finite automata; ambiguity; tree width; paths; string path width; depth path width; acyclic; nearly acyclic; regular; subregular; languages

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Keeler, C. (n.d.). New metrics for finite automaton complexity and subregular language hierarchies . (Thesis). Queens University. Retrieved from http://hdl.handle.net/1974/15329

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Keeler, Chris. “New metrics for finite automaton complexity and subregular language hierarchies .” Thesis, Queens University. Accessed October 15, 2019. http://hdl.handle.net/1974/15329.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Keeler, Chris. “New metrics for finite automaton complexity and subregular language hierarchies .” Web. 15 Oct 2019.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Keeler C. New metrics for finite automaton complexity and subregular language hierarchies . [Internet] [Thesis]. Queens University; [cited 2019 Oct 15]. Available from: http://hdl.handle.net/1974/15329.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

Keeler C. New metrics for finite automaton complexity and subregular language hierarchies . [Thesis]. Queens University; Available from: http://hdl.handle.net/1974/15329

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

29. Ng, Timothy. NFA reduction via hypergraph vertex cover approximation.

Degree: 2013, University of Western Ontario

 In this thesis, we study in minimum vertex cover problem on the class of k-partite k-uniform hypergraphs. This problem arises when reducing the size of… (more)

Subjects/Keywords: regular languages; vertex cover; approximation algorithms; nondeterministic finite automata; approximate fractional covering; NFA reduction; Theory and Algorithms

…Chapter 1 Introduction Regular expressions describe regular languages and are recognized… …automata and regular languages. Rubinstein [63] and Linster [47] use finite… …x5D; use regular languages in DNA computing. And of course, regular expressions are a… …fundamental topic of study in theoretical computer science. Regular languages and finite automata… …theory. For some time, it was believed that regular languages were exhausted as a topic of… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ng, T. (2013). NFA reduction via hypergraph vertex cover approximation. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/1224

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

Ng, Timothy. “NFA reduction via hypergraph vertex cover approximation.” 2013. Thesis, University of Western Ontario. Accessed October 15, 2019. https://ir.lib.uwo.ca/etd/1224.

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

MLA Handbook (7th Edition):

Ng, Timothy. “NFA reduction via hypergraph vertex cover approximation.” 2013. Web. 15 Oct 2019.

Vancouver:

Ng T. NFA reduction via hypergraph vertex cover approximation. [Internet] [Thesis]. University of Western Ontario; 2013. [cited 2019 Oct 15]. Available from: https://ir.lib.uwo.ca/etd/1224.

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

Council of Science Editors:

Ng T. NFA reduction via hypergraph vertex cover approximation. [Thesis]. University of Western Ontario; 2013. Available from: https://ir.lib.uwo.ca/etd/1224

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

30. Hultin, Felix. Phonotactic Structures in Swedish : A Data-Driven Approach.

Degree: Linguistics, 2017, Stockholm University

Ever since Bengt Sigurd laid out the first comprehensive description of Swedish phonotactics in 1965, it has been the main point of reference within… (more)

Subjects/Keywords: Phonotactics; computational phonology; trie; finite automata; pattern matching; regular languages; Fonotax; beräkningsbar fonologi; trie; ändlig automat; mönstermatchning; reguljära språk; Language Technology (Computational Linguistics); Språkteknologi (språkvetenskaplig databehandling)

…remains a mathematical contradiction. 2.2.2. Regular Languages and Pattern Matching Finite… …automatons can be expressed by what are called regular languages, a subset of formal languages… …Stephen Cole Kleene (Kleene, 1951). A standardized way to define regular languages, is… …mentioned before, since regular languages are equivalent to finite automata, the above expression… …that phonological observations can be modeled with regular languages is not new to this… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hultin, F. (2017). Phonotactic Structures in Swedish : A Data-Driven Approach. (Thesis). Stockholm University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-144259

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

Hultin, Felix. “Phonotactic Structures in Swedish : A Data-Driven Approach.” 2017. Thesis, Stockholm University. Accessed October 15, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-144259.

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

MLA Handbook (7th Edition):

Hultin, Felix. “Phonotactic Structures in Swedish : A Data-Driven Approach.” 2017. Web. 15 Oct 2019.

Vancouver:

Hultin F. Phonotactic Structures in Swedish : A Data-Driven Approach. [Internet] [Thesis]. Stockholm University; 2017. [cited 2019 Oct 15]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-144259.

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

Council of Science Editors:

Hultin F. Phonotactic Structures in Swedish : A Data-Driven Approach. [Thesis]. Stockholm University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-144259

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

[1] [2]

.