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:(deterministic finite automata). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


East Carolina University

1. Masters, Miciah Dashiel Butler. Synchronizing Automata and the Černy� Conjecture.

Degree: MS, Computer Science, 2012, East Carolina University

 We provide a survey of research surrounding the CÌŒernyÌ� conjecture. This conjecture concerns finite-state automata that have the property of being "synchronizing." A synchronizing automaton… (more)

Subjects/Keywords: Computer science; Automata; CÌŒernyÌ� conjecture; Deterministic; Finite-state; Synchronizing automata; Machine theory; Robots – Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Masters, M. D. B. (2012). Synchronizing Automata and the Černy� Conjecture. (Masters Thesis). East Carolina University. Retrieved from http://hdl.handle.net/10342/3937

Chicago Manual of Style (16th Edition):

Masters, Miciah Dashiel Butler. “Synchronizing Automata and the CÌŒernyÌ� Conjecture.” 2012. Masters Thesis, East Carolina University. Accessed March 08, 2021. http://hdl.handle.net/10342/3937.

MLA Handbook (7th Edition):

Masters, Miciah Dashiel Butler. “Synchronizing Automata and the CÌŒernyÌ� Conjecture.” 2012. Web. 08 Mar 2021.

Vancouver:

Masters MDB. Synchronizing Automata and the Černy� Conjecture. [Internet] [Masters thesis]. East Carolina University; 2012. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/10342/3937.

Council of Science Editors:

Masters MDB. Synchronizing Automata and the Černy� Conjecture. [Masters Thesis]. East Carolina University; 2012. Available from: http://hdl.handle.net/10342/3937

2. 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 March 08, 2021. 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. 08 Mar 2021.

Vancouver:

Harun-Or-Rashid M. Mining Multiple Web Sources Using Non-Deterministic Finite State Automata. [Internet] [Masters thesis]. National Library of Canada; 2012. [cited 2021 Mar 08]. 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


Queens University

3. 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 March 08, 2021. 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. 08 Mar 2021.

Vancouver:

Palioudakis A. State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism . [Internet] [Thesis]. Queens University; 2014. [cited 2021 Mar 08]. 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


University of Colorado

4. Char, Ian Guo-fan. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.

Degree: MS, 2018, University of Colorado

  In many applications, the need arises to search a text for appearances of a given set of keywords. As an example, in bioinformatics one… (more)

Subjects/Keywords: aho-corasick automaton; biological motifs; deterministic finite automata; generalized strings; stochastic analysis; Applied Mathematics; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Char, I. G. (2018). Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. (Masters Thesis). University of Colorado. Retrieved from https://scholar.colorado.edu/appm_gradetds/115

Chicago Manual of Style (16th Edition):

Char, Ian Guo-fan. “Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.” 2018. Masters Thesis, University of Colorado. Accessed March 08, 2021. https://scholar.colorado.edu/appm_gradetds/115.

MLA Handbook (7th Edition):

Char, Ian Guo-fan. “Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.” 2018. Web. 08 Mar 2021.

Vancouver:

Char IG. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2021 Mar 08]. Available from: https://scholar.colorado.edu/appm_gradetds/115.

Council of Science Editors:

Char IG. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. [Masters Thesis]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/appm_gradetds/115


University of California – Berkeley

5. Khan, Muhammad R. Machine Learning for the Developing World using Mobile Communication Metadata.

Degree: Information Management & Systems, 2018, University of California – Berkeley

 Machine learning algorithms have started having an unprecedented impact on human society due to their improved accuracy. The ability to collect and analyze information at… (more)

Subjects/Keywords: Information science; Computer science; Call Detail Records; Deterministic Finite Automata; Feature Engineering; Graph Convolutional Networks; Machine Learning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Khan, M. R. (2018). Machine Learning for the Developing World using Mobile Communication Metadata. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/84n4r63x

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

Khan, Muhammad R. “Machine Learning for the Developing World using Mobile Communication Metadata.” 2018. Thesis, University of California – Berkeley. Accessed March 08, 2021. http://www.escholarship.org/uc/item/84n4r63x.

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

MLA Handbook (7th Edition):

Khan, Muhammad R. “Machine Learning for the Developing World using Mobile Communication Metadata.” 2018. Web. 08 Mar 2021.

Vancouver:

Khan MR. Machine Learning for the Developing World using Mobile Communication Metadata. [Internet] [Thesis]. University of California – Berkeley; 2018. [cited 2021 Mar 08]. Available from: http://www.escholarship.org/uc/item/84n4r63x.

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

Council of Science Editors:

Khan MR. Machine Learning for the Developing World using Mobile Communication Metadata. [Thesis]. University of California – Berkeley; 2018. Available from: http://www.escholarship.org/uc/item/84n4r63x

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


Brno University of Technology

6. Černý, Stanislav. Morfologický analyzátor pomocí konečných automatů: Morphological Analyser Implemented as FSAs.

Degree: 2018, Brno University of Technology

 We describe morphemic analyser using dictionary approach. Dictionary is saved as deterministic finite state automata. Another part of text deals with analysis of numerals, especially… (more)

Subjects/Keywords: morfologický analyzátor; TRIE; deterministický konečný automat; číslovky; slovotvorné vazby; morphemic analyser; TRIE; deterministic finite state automata; numerals; word-formation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Černý, S. (2018). Morfologický analyzátor pomocí konečných automatů: Morphological Analyser Implemented as FSAs. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55563

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

Černý, Stanislav. “Morfologický analyzátor pomocí konečných automatů: Morphological Analyser Implemented as FSAs.” 2018. Thesis, Brno University of Technology. Accessed March 08, 2021. http://hdl.handle.net/11012/55563.

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

MLA Handbook (7th Edition):

Černý, Stanislav. “Morfologický analyzátor pomocí konečných automatů: Morphological Analyser Implemented as FSAs.” 2018. Web. 08 Mar 2021.

Vancouver:

Černý S. Morfologický analyzátor pomocí konečných automatů: Morphological Analyser Implemented as FSAs. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11012/55563.

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

Council of Science Editors:

Černý S. Morfologický analyzátor pomocí konečných automatů: Morphological Analyser Implemented as FSAs. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/55563

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


Rochester Institute of Technology

7. Norton, Daphne. Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP.

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

 A wide variety of algorithms can be used to determine the equivalence of two Deterministic Finite Automata (DFAs) and/or Nondeterministic Finite Automata (NFAs). This project… (more)

Subjects/Keywords: Deterministic finite automata; DFA; Equivalence algorithms; Finite automaton; JFLAP; NFA; Nondeterministic finite automata; Witness string

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Norton, D. (2009). Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. (Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/6939

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

Norton, Daphne. “Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP.” 2009. Thesis, Rochester Institute of Technology. Accessed March 08, 2021. https://scholarworks.rit.edu/theses/6939.

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

MLA Handbook (7th Edition):

Norton, Daphne. “Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP.” 2009. Web. 08 Mar 2021.

Vancouver:

Norton D. Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. [Internet] [Thesis]. Rochester Institute of Technology; 2009. [cited 2021 Mar 08]. Available from: https://scholarworks.rit.edu/theses/6939.

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

Council of Science Editors:

Norton D. Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP. [Thesis]. Rochester Institute of Technology; 2009. Available from: https://scholarworks.rit.edu/theses/6939

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

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

Degree: MS, Computer Science, 2012, University of Windsor

 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

…17 1.5.1 Deterministic finite automata… …17 1.5.2 Non-deterministic finite Automata… …20 1.7 Mining Web Document Objects with Non-deterministic Finite Automata… …63 CHAPTER 3 - Web content mining using non-deterministic finite state automata… …Deterministic finite automata… 

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). University of Windsor. Retrieved from https://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, University of Windsor. Accessed March 08, 2021. https://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. 08 Mar 2021.

Vancouver:

Harun-Or-Rashid M. Mining Multiple Web Sources Using Non-Deterministic Finite State Automata. [Internet] [Masters thesis]. University of Windsor; 2012. [cited 2021 Mar 08]. Available from: https://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]. University of Windsor; 2012. Available from: https://scholar.uwindsor.ca/etd/4814


Indian Institute of Science

9. Kumar, Pawan. Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems.

Degree: MSc Engg, Faculty of Engineering, 2014, Indian Institute of Science

 The rampant growth of the Internet has been coupled with an equivalent growth in cyber crime over the Internet. With our increased reliance on the… (more)

Subjects/Keywords: Access Control (Computer Networks); Cryptography; Network Intrusion Detection System; Computer Security; Cyber-attack; Network Intrusion Detection - Regular Expression Pattern Matching; Cascaded Automata Architecture; Deterministic Finite Automata; Network Intrusion Detection - Memory Efficient Algorithms; Network Intrustion Detection System Signatures; Network Intrusion Detection Systems (NIDS); Modified Word-based NFA (M-WNFA); Network Security; Pattern Matching; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, P. (2014). Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems. (Masters Thesis). Indian Institute of Science. Retrieved from http://etd.iisc.ac.in/handle/2005/2321

Chicago Manual of Style (16th Edition):

Kumar, Pawan. “Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems.” 2014. Masters Thesis, Indian Institute of Science. Accessed March 08, 2021. http://etd.iisc.ac.in/handle/2005/2321.

MLA Handbook (7th Edition):

Kumar, Pawan. “Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems.” 2014. Web. 08 Mar 2021.

Vancouver:

Kumar P. Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems. [Internet] [Masters thesis]. Indian Institute of Science; 2014. [cited 2021 Mar 08]. Available from: http://etd.iisc.ac.in/handle/2005/2321.

Council of Science Editors:

Kumar P. Memory Efficient Regular Expression Pattern Matching Architecture For Network Intrusion Detection Systems. [Masters Thesis]. Indian Institute of Science; 2014. Available from: http://etd.iisc.ac.in/handle/2005/2321

10. Joly, Jean-Luc. Contributions à la génération aléatoire pour des classes d'automates finis : Contributions to uniform random generation for finite automata classes.

Degree: Docteur es, Informatique, 2016, Besançon

Le concept d’automate, central en théorie des langages, est l’outil d’appréhension naturel et efficace de nombreux problèmes concrets. L’usage intensif des automates finis dans un… (more)

Subjects/Keywords: Génération aléatoire uniforrme; Automates finis non déterministes; Méthode de Monte-Carlo par chaîne de Markov; Algotithme de Metropolis-Hastings; Automates partiellement ordonnés; Test d'autocorrélation; Test de Gelman-Rubin; Test du khi-deux; Uniform random generation; Non deterministic finite automata; Markov chain Monte-Carlo methods; Metropolis-Hadtings algorithm; Partially ordered automata; Autocorrelation test; Gelman-Rubin test; Chi square test; 629.8

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joly, J. (2016). Contributions à la génération aléatoire pour des classes d'automates finis : Contributions to uniform random generation for finite automata classes. (Doctoral Dissertation). Besançon. Retrieved from http://www.theses.fr/2016BESA2012

Chicago Manual of Style (16th Edition):

Joly, Jean-Luc. “Contributions à la génération aléatoire pour des classes d'automates finis : Contributions to uniform random generation for finite automata classes.” 2016. Doctoral Dissertation, Besançon. Accessed March 08, 2021. http://www.theses.fr/2016BESA2012.

MLA Handbook (7th Edition):

Joly, Jean-Luc. “Contributions à la génération aléatoire pour des classes d'automates finis : Contributions to uniform random generation for finite automata classes.” 2016. Web. 08 Mar 2021.

Vancouver:

Joly J. Contributions à la génération aléatoire pour des classes d'automates finis : Contributions to uniform random generation for finite automata classes. [Internet] [Doctoral dissertation]. Besançon; 2016. [cited 2021 Mar 08]. Available from: http://www.theses.fr/2016BESA2012.

Council of Science Editors:

Joly J. Contributions à la génération aléatoire pour des classes d'automates finis : Contributions to uniform random generation for finite automata classes. [Doctoral Dissertation]. Besançon; 2016. Available from: http://www.theses.fr/2016BESA2012


Brno University of Technology

11. Šuška, Boris. Syntaxí řízený editor popisného jazyka ISAC a jazyka generického assembleru v platformě Eclipse: Syntax-Directed Editor for ISAC Language and for Language of Generic Assembler Implemented as Eclipse Plugin.

Degree: 2020, Brno University of Technology

 This thesis is dealing with creation of LR parser from formally described grammar. I was creating a lexical analyzer based on determinictic finite automaton, which… (more)

Subjects/Keywords: syntaxí řízený editor; java kolekce; Eclipse IDE; ISAC; asembler; LR parser; deterministický konečný automat; regulární výrazi; syntax directed editor; java collections framework; Eclipse IDE; ISAC; assembler; LR parser; deterministic finite automata; regular expressions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Šuška, B. (2020). Syntaxí řízený editor popisného jazyka ISAC a jazyka generického assembleru v platformě Eclipse: Syntax-Directed Editor for ISAC Language and for Language of Generic Assembler Implemented as Eclipse Plugin. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187363

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

Šuška, Boris. “Syntaxí řízený editor popisného jazyka ISAC a jazyka generického assembleru v platformě Eclipse: Syntax-Directed Editor for ISAC Language and for Language of Generic Assembler Implemented as Eclipse Plugin.” 2020. Thesis, Brno University of Technology. Accessed March 08, 2021. http://hdl.handle.net/11012/187363.

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

MLA Handbook (7th Edition):

Šuška, Boris. “Syntaxí řízený editor popisného jazyka ISAC a jazyka generického assembleru v platformě Eclipse: Syntax-Directed Editor for ISAC Language and for Language of Generic Assembler Implemented as Eclipse Plugin.” 2020. Web. 08 Mar 2021.

Vancouver:

Šuška B. Syntaxí řízený editor popisného jazyka ISAC a jazyka generického assembleru v platformě Eclipse: Syntax-Directed Editor for ISAC Language and for Language of Generic Assembler Implemented as Eclipse Plugin. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2021 Mar 08]. Available from: http://hdl.handle.net/11012/187363.

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

Council of Science Editors:

Šuška B. Syntaxí řízený editor popisného jazyka ISAC a jazyka generického assembleru v platformě Eclipse: Syntax-Directed Editor for ISAC Language and for Language of Generic Assembler Implemented as Eclipse Plugin. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187363

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


University of Western Ontario

12. 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 March 08, 2021. 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. 08 Mar 2021.

Vancouver:

Gao Y. Advanced Topics on State Complexity of Combined Operations. [Internet] [Thesis]. University of Western Ontario; 2010. [cited 2021 Mar 08]. 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

13. Le Pelleter, Tugdual. Méthode de discrétisation adaptée à une logique événementielle pour l'utra-faible consommation : application à la reconnaissance de signaux physiologiques : Discretization method adapted to an event-logic architecture for ultra-low power consumption : a physiological pattern recognition application.

Degree: Docteur es, Nanoélectronique et nanotechnologie, 2015, Université Grenoble Alpes (ComUE)

Les systèmes embarqués mobiles font partis intégrante de notre quotidien. Afin de les rendre plus adaptésaux usages, ils ont été miniaturisés et leur autonomie a… (more)

Subjects/Keywords: Système embarqué; Implant médical; Faible consommation; Reconnaissance de formes; Échantillonnage par traversée de niveaux; Automate fini déterministe; Logique événementielle; Logique asynchrone; Consommation électrique; Réseau de portes programmables; Circuit intégré propre à une application; Mobile embedded system; Medical implant; Low-power consumption; Pattern recognition; Levelcrossing sampling scheme; Deterministic finite automata; Event-logic; Asynchronous logic; Power consumption; Field-programmable gate array; Application specific integrated circuit; 620

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Le Pelleter, T. (2015). Méthode de discrétisation adaptée à une logique événementielle pour l'utra-faible consommation : application à la reconnaissance de signaux physiologiques : Discretization method adapted to an event-logic architecture for ultra-low power consumption : a physiological pattern recognition application. (Doctoral Dissertation). Université Grenoble Alpes (ComUE). Retrieved from http://www.theses.fr/2015GREAT043

Chicago Manual of Style (16th Edition):

Le Pelleter, Tugdual. “Méthode de discrétisation adaptée à une logique événementielle pour l'utra-faible consommation : application à la reconnaissance de signaux physiologiques : Discretization method adapted to an event-logic architecture for ultra-low power consumption : a physiological pattern recognition application.” 2015. Doctoral Dissertation, Université Grenoble Alpes (ComUE). Accessed March 08, 2021. http://www.theses.fr/2015GREAT043.

MLA Handbook (7th Edition):

Le Pelleter, Tugdual. “Méthode de discrétisation adaptée à une logique événementielle pour l'utra-faible consommation : application à la reconnaissance de signaux physiologiques : Discretization method adapted to an event-logic architecture for ultra-low power consumption : a physiological pattern recognition application.” 2015. Web. 08 Mar 2021.

Vancouver:

Le Pelleter T. Méthode de discrétisation adaptée à une logique événementielle pour l'utra-faible consommation : application à la reconnaissance de signaux physiologiques : Discretization method adapted to an event-logic architecture for ultra-low power consumption : a physiological pattern recognition application. [Internet] [Doctoral dissertation]. Université Grenoble Alpes (ComUE); 2015. [cited 2021 Mar 08]. Available from: http://www.theses.fr/2015GREAT043.

Council of Science Editors:

Le Pelleter T. Méthode de discrétisation adaptée à une logique événementielle pour l'utra-faible consommation : application à la reconnaissance de signaux physiologiques : Discretization method adapted to an event-logic architecture for ultra-low power consumption : a physiological pattern recognition application. [Doctoral Dissertation]. Université Grenoble Alpes (ComUE); 2015. Available from: http://www.theses.fr/2015GREAT043

.