Advanced search options

Sorted by: relevance · author · university · date | New search

You searched for `subject:(deterministic finite state automaton)`

.
Showing records 1 – 30 of
32776 total matches.

◁ [1] [2] [3] [4] [5] … [1093] ▶

Search Limiters

Dates

- 2016 – 2020 (9061)
- 2011 – 2015 (11617)
- 2006 – 2010 (6246)
- 2001 – 2005 (2213)
- 1996 – 2000 (997)
- 1991 – 1995 (908)
- 1986 – 1990 (848)
- 1981 – 1985 (741)
- 1976 – 1980 (601)
- 1971 – 1975 (483)

Universities

- Brno University of Technology (1475)
- University of São Paulo (833)
- Michigan State University (787)
- Virginia Tech (636)
- Delft University of Technology (453)
- The Ohio State University (420)
- Texas A&M University (389)
- National University of Singapore (368)
- University of Florida (360)
- Georgia Tech (345)
- Iowa State University (326)
- NSYSU (320)
- University of Manchester (315)
- Western Washington University (302)
- Universidade do Rio Grande do Sul (300)

Department

- Mechanical Engineering (779)
- Civil Engineering (391)
- Political Science (301)
- Mathematics (275)
- Education (269)
- Electrical and Computer Engineering (255)
- Electrical Engineering (254)
- Chemistry (250)
- History (217)
- Physics (208)
- Geology (207)
- Civil and Environmental Engineering (161)
- Droit public (115)
- Sociology (111)
- Aerospace Engineering (109)

Degrees

Levels

- doctoral (11873)
- masters (6486)
- thesis (477)
- 1 (38)
- project (36)
- doctor of philosophy (ph.d.) (35)
- doctor of philosophy ph.d. (34)
- dissertation (22)
- thesis: ewu only (20)

Languages

Country

- US (12366)
- Brazil (3057)
- France (2326)
- Canada (2206)
- UK (1705)
- Czech Republic (1487)
- Netherlands (999)
- Australia (995)
- Sweden (967)
- South Africa (955)
- Greece (720)
- India (565)
- Portugal (423)
- Singapore (377)
- Taiwan (320)

▼ Search Limiters

Rice University

1.
Michalenko, Joshua James.
Representing Formal Languages: A Comparison Between *Finite* Automata and Recurrent Neural Networks.

Degree: MS, Electrical & Computer Eng., 2019, Rice University

URL: http://hdl.handle.net/1911/105422

► We investigate the internal representations that a recurrent neural network (RNN) uses while learning to recognize a regular formal language. Specially, we train a RNN…
(more)

Subjects/Keywords: Language recognition; Recurrent Neural Networks; Representation Learning; deterministic finite automaton; automaton

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Michalenko, J. J. (2019). Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105422

Chicago Manual of Style (16^{th} Edition):

Michalenko, Joshua James. “Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks.” 2019. Masters Thesis, Rice University. Accessed July 14, 2020. http://hdl.handle.net/1911/105422.

MLA Handbook (7^{th} Edition):

Michalenko, Joshua James. “Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks.” 2019. Web. 14 Jul 2020.

Vancouver:

Michalenko JJ. Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. [Internet] [Masters thesis]. Rice University; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1911/105422.

Council of Science Editors:

Michalenko JJ. Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. [Masters Thesis]. Rice University; 2019. Available from: http://hdl.handle.net/1911/105422

Brno University of Technology

2. Stanek, Timotej. Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/52773

► This project is about security of computer networks using Intrusion Detection Systems. IDS contain rules for detection expressed with regular expressions, which are for detection…
(more)

Subjects/Keywords: Systém detekce útoků; IDS; bezpečnost sítí; regulární výraz; PCRE; konečný automat; deterministický konečný automat; nedeterministický konečný automat; shlukovaní regulárních výrazů; genetický algoritmus; Random Search; Intrusion Detection System; IDS; network security; regular expression; PCRE; finite-state automaton; deterministic finite-state automaton; non-deterministic finite-state automaton; regular expression grouping; genetic algorithm; Random Search

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Stanek, T. (2018). Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52773

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Stanek, Timotej. “Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/52773.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Stanek, Timotej. “Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions.” 2018. Web. 14 Jul 2020.

Vancouver:

Stanek T. Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/52773.

Note: this citation may be lacking information needed for this citation format:

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Stanek T. Automatické shlukování regulárních výrazů: Automatic Grouping of Regular Expressions. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/52773

Not specified: Masters Thesis or Doctoral Dissertation

University of Pretoria

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

Degree: Computer Science, 2010, University of Pretoria

URL: http://hdl.handle.net/2263/27536

► In this study, the regular expressions forming abstract states in Brzozowski’s algorithm are not remapped to sequential *state* transition table addresses as would be the…
(more)

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Pretoria

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

Degree: 2010, University of Pretoria

URL: http://upetd.up.ac.za/thesis/available/etd-08252010-133710/

► In this study, the regular expressions forming abstract states in Brzozowski’s algorithm are not remapped to sequential *state* transition table addresses as would be the…
(more)

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

University of Colorado

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

Degree: MS, 2018, University of Colorado

URL: https://scholar.colorado.edu/appm_gradetds/115

► 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 Details Similar Records

❌

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

APA (6^{th} 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 (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Char, Ian Guo-fan. “Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings.” 2018. Web. 14 Jul 2020.

Vancouver:

Char IG. Algorithmic Construction and Stochastic Analysis of Optimal Automata for Generalized Strings. [Internet] [Masters thesis]. University of Colorado; 2018. [cited 2020 Jul 14]. 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

Brno University of Technology

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

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/63231

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

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

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

7. Krajíček, Karel. Universální simulátor automatů: A Universal Automata Simulator.

Degree: 2020, Brno University of Technology

URL: http://hdl.handle.net/11012/187212

► This paper is about simulator of automata, where user can work with different types of automata and Turing machines. For that was created program in…
(more)

Subjects/Keywords: Turingov stroj; Konečné automaty; Zásobníkové automaty; Simulátor automatov; C++; Turing machine; Finite-state automaton; Pushdown automaton; Automata simulator; C++

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krajíček, K. (2020). Universální simulátor automatů: A Universal Automata Simulator. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/187212

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/187212.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Web. 14 Jul 2020.

Vancouver:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/187212.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/187212

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

8. Krajíček, Karel. Universální simulátor automatů: A Universal Automata Simulator.

Degree: 2020, Brno University of Technology

URL: http://hdl.handle.net/11012/189778

► This paper is about simulator of automata, where user can work with different types of automata and Turing machines. For that was created program in…
(more)

Subjects/Keywords: Turingov stroj; Konečné automaty; Zásobníkové automaty; Simulátor automatov; C++; Turing machine; Finite-state automaton; Pushdown automaton; Automata simulator; C++

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Krajíček, K. (2020). Universální simulátor automatů: A Universal Automata Simulator. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/189778

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/189778.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Krajíček, Karel. “Universální simulátor automatů: A Universal Automata Simulator.” 2020. Web. 14 Jul 2020.

Vancouver:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/189778.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Krajíček K. Universální simulátor automatů: A Universal Automata Simulator. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/189778

Not specified: Masters Thesis or Doctoral Dissertation

Kent State University

9. Wilson, Deborah Ann Stoffer. A Study of the Behavior of Chaos Automata.

Degree: PhD, College of Arts and Sciences / Department of Computer Science, 2016, Kent State University

URL: http://rave.ohiolink.edu/etdc/view?acc_num=kent1478955376070686

► Chaos automata are a rich class of models that combine iterated function systems with *finite* *state* automata. This merger creates models capable of transforming sequences…
(more)

Subjects/Keywords: Computer Science; chaos automata; automata; automaton; finite state machines; iterated function systems; fractals; evolutionary algorithms

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Wilson, D. A. S. (2016). A Study of the Behavior of Chaos Automata. (Doctoral Dissertation). Kent State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=kent1478955376070686

Chicago Manual of Style (16^{th} Edition):

Wilson, Deborah Ann Stoffer. “A Study of the Behavior of Chaos Automata.” 2016. Doctoral Dissertation, Kent State University. Accessed July 14, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=kent1478955376070686.

MLA Handbook (7^{th} Edition):

Wilson, Deborah Ann Stoffer. “A Study of the Behavior of Chaos Automata.” 2016. Web. 14 Jul 2020.

Vancouver:

Wilson DAS. A Study of the Behavior of Chaos Automata. [Internet] [Doctoral dissertation]. Kent State University; 2016. [cited 2020 Jul 14]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1478955376070686.

Council of Science Editors:

Wilson DAS. A Study of the Behavior of Chaos Automata. [Doctoral Dissertation]. Kent State University; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=kent1478955376070686

10.
XI YUNXIA.
Integrated fault diagnosis scheme using *finite*-*state* automation.

Degree: 2003, National University of Singapore

URL: http://scholarbank.nus.edu.sg/handle/10635/13467

Subjects/Keywords: Fault Diagnosis; Finite-State Automaton; Diagnosability

Record Details Similar Records

❌

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

APA (6^{th} Edition):

YUNXIA, X. (2003). Integrated fault diagnosis scheme using finite-state automation. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/13467

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

YUNXIA, XI. “Integrated fault diagnosis scheme using finite-state automation.” 2003. Thesis, National University of Singapore. Accessed July 14, 2020. http://scholarbank.nus.edu.sg/handle/10635/13467.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

YUNXIA, XI. “Integrated fault diagnosis scheme using finite-state automation.” 2003. Web. 14 Jul 2020.

Vancouver:

YUNXIA X. Integrated fault diagnosis scheme using finite-state automation. [Internet] [Thesis]. National University of Singapore; 2003. [cited 2020 Jul 14]. Available from: http://scholarbank.nus.edu.sg/handle/10635/13467.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

YUNXIA X. Integrated fault diagnosis scheme using finite-state automation. [Thesis]. National University of Singapore; 2003. Available from: http://scholarbank.nus.edu.sg/handle/10635/13467

Not specified: Masters Thesis or Doctoral Dissertation

East Carolina University

11. Masters, Miciah Dashiel Butler. Synchronizing Automata and the CÌŒernyÌ� Conjecture.

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

URL: http://hdl.handle.net/10342/3937

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

Masters, Miciah Dashiel Butler. “Synchronizing Automata and the CÌŒernyÌ� Conjecture.” 2012. Web. 14 Jul 2020.

Vancouver:

Masters MDB. Synchronizing Automata and the CÌŒernyÌ� Conjecture. [Internet] [Masters thesis]. East Carolina University; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10342/3937.

Council of Science Editors:

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

12.
Michalenko, Joshua James.
Representing Formal Languages: A Comparison Between *Finite* Automata and Recurrent Neural Networks.

Degree: MS, Engineering, 2019, Rice University

URL: http://hdl.handle.net/1911/105421

► We investigate the internal representations that a recurrent neural network (RNN) uses while learning to recognize a regular formal language. Specially, we train a RNN…
(more)

Subjects/Keywords: Language recognition; Recurrent Neural Networks; Representation Learning; deterministic finite automaton; automaton

…*deterministic* nite *automaton* (DFA) with the smallest possible
number of states that… …language is a set of
strings over a nite alphabet Σ of input symbols. A *Deterministic* *Finite*… …Abstractions.
A Nondeterministic *Finite* *Automaton* (NFA) is similar to a DFA,
except that… …framework. A dendrogram superimposed on the DFA shows
the hierarchy of the RNN's hidden *state*… …framework. A dendrogram superimposed on the DFA shows
the hierarchy of the RNN's hidden *state*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Michalenko, J. J. (2019). Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. (Masters Thesis). Rice University. Retrieved from http://hdl.handle.net/1911/105421

Chicago Manual of Style (16^{th} Edition):

Michalenko, Joshua James. “Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks.” 2019. Masters Thesis, Rice University. Accessed July 14, 2020. http://hdl.handle.net/1911/105421.

MLA Handbook (7^{th} Edition):

Michalenko, Joshua James. “Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks.” 2019. Web. 14 Jul 2020.

Vancouver:

Michalenko JJ. Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. [Internet] [Masters thesis]. Rice University; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/1911/105421.

Council of Science Editors:

Michalenko JJ. Representing Formal Languages: A Comparison Between Finite Automata and Recurrent Neural Networks. [Masters Thesis]. Rice University; 2019. Available from: http://hdl.handle.net/1911/105421

Iowa State University

13. Saha, Homagni. Exploring Granger causality in dynamical systems modeling and performance monitoring.

Degree: 2018, Iowa State University

URL: https://lib.dr.iastate.edu/etd/16874

► Data-driven approaches are becoming increasingly crucial for modeling and performance monitoring of complex dynamical systems. Such necessity stems from complex interactions among sub-systems and high…
(more)

Subjects/Keywords: Anomaly detection; Cyber Physical Systems; Industrial manipulator; Probabilistic finite state automaton; Root cause analysis; Computer Sciences; Mechanical Engineering; Robotics

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Saha, H. (2018). Exploring Granger causality in dynamical systems modeling and performance monitoring. (Thesis). Iowa State University. Retrieved from https://lib.dr.iastate.edu/etd/16874

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Saha, Homagni. “Exploring Granger causality in dynamical systems modeling and performance monitoring.” 2018. Thesis, Iowa State University. Accessed July 14, 2020. https://lib.dr.iastate.edu/etd/16874.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Saha, Homagni. “Exploring Granger causality in dynamical systems modeling and performance monitoring.” 2018. Web. 14 Jul 2020.

Vancouver:

Saha H. Exploring Granger causality in dynamical systems modeling and performance monitoring. [Internet] [Thesis]. Iowa State University; 2018. [cited 2020 Jul 14]. Available from: https://lib.dr.iastate.edu/etd/16874.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Saha H. Exploring Granger causality in dynamical systems modeling and performance monitoring. [Thesis]. Iowa State University; 2018. Available from: https://lib.dr.iastate.edu/etd/16874

Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

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

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

URL: https://scholarworks.rit.edu/theses/6939

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Norton, Daphne. “Algorithms for testing equivalence of finite automata, with a grading tool for JFLAP.” 2009. Web. 14 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Queens University

15.
Palioudakis, Alexandros.
* State* Complexity of Nondeterministic

Degree: Computing, 2014, Queens University

URL: http://hdl.handle.net/1974/12453

► 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 Details Similar Records

❌

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

APA (6^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Palioudakis, Alexandros. “State Complexity of Nondeterministic Finite Automata with Limited Nondeterminism .” 2014. Web. 14 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

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

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/55563

► 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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

17. Fazzini, Mattia. Automatic Detection and Correction of Client-Side and Server-Side Input-Validation Inconsistencies.

Degree: 2012, University of Illinois – Chicago

URL: http://hdl.handle.net/10027/9587

► This work presents an approach to automatically identify and correct erroneous or insufficient validation of the user inputs within web applications. Inside the context of…
(more)

Subjects/Keywords: Software engineering; Software testing; Computer security; Input; Validation; Web application; Deterministic finite automaton; Client; Server

…the class of *finite* *state* machines.
2.2.1
*Deterministic* *Finite* *Automaton*
A *deterministic*… …*finite* *automaton* is a *finite* *state* machine that accepts or rejects *finite*
strings of symbols… …*deterministic* *finite* *automaton* can be seen in Figure 10. In general, a DFA is composed by
22
states… …Figure 10. *Deterministic* *finite* *automaton* representation.
23
In case DFA are analyzed under… …the mathematical perspective, a *deterministic* *finite* *automaton* can be represented by a tuple…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Fazzini, M. (2012). Automatic Detection and Correction of Client-Side and Server-Side Input-Validation Inconsistencies. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/9587

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Fazzini, Mattia. “Automatic Detection and Correction of Client-Side and Server-Side Input-Validation Inconsistencies.” 2012. Thesis, University of Illinois – Chicago. Accessed July 14, 2020. http://hdl.handle.net/10027/9587.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Fazzini, Mattia. “Automatic Detection and Correction of Client-Side and Server-Side Input-Validation Inconsistencies.” 2012. Web. 14 Jul 2020.

Vancouver:

Fazzini M. Automatic Detection and Correction of Client-Side and Server-Side Input-Validation Inconsistencies. [Internet] [Thesis]. University of Illinois – Chicago; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10027/9587.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fazzini M. Automatic Detection and Correction of Client-Side and Server-Side Input-Validation Inconsistencies. [Thesis]. University of Illinois – Chicago; 2012. Available from: http://hdl.handle.net/10027/9587

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

18. Mocková, Ľubica. Klasifikace jazyků, gramatik a automatů: Languages, Grammars and Machines.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/28263

► My thesis is a brief synopsis of the basic types of formal languages, grammars and machines, which are a part of theoretical computer science. My…
(more)

Subjects/Keywords: Abeceda; operace nad abecedou; formální jazyky; operace nad jazyky; gramatika; Chomského hierarchie; konečný automat; deterministický konečný automat; nedeterministický konečný automat; pumping lemma.; Alphabet; operations on Alphabet; formal languages; operations on languages; Chomsky’s Hierarchy; finite state machine; deterministic finite state machine; nondeterministic finite state machine; pumping lemma.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Mocková, . (2019). Klasifikace jazyků, gramatik a automatů: Languages, Grammars and Machines. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/28263

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Mocková, Ľubica. “Klasifikace jazyků, gramatik a automatů: Languages, Grammars and Machines.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/28263.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Mocková, Ľubica. “Klasifikace jazyků, gramatik a automatů: Languages, Grammars and Machines.” 2019. Web. 14 Jul 2020.

Vancouver:

Mocková . Klasifikace jazyků, gramatik a automatů: Languages, Grammars and Machines. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/28263.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mocková . Klasifikace jazyků, gramatik a automatů: Languages, Grammars and Machines. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/28263

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

19. Klimešová, Michaela. Klasifikácia gramatík, jazykov a automatov (základné typy a využitie): Classification of Grammars, Languages and Machines (Basic Types, Use).

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/15023

► This bachelor's thesis is written as a brief list of fundamental theory on the given topic with extensions of working out methods and solving examples.…
(more)

Subjects/Keywords: Abeceda; deterministický konečný automat; formálne jazyky; gramatika; Chomského hierchia; konečný automat; nedeterministický konečný automat; operácie nad abecedou; operácie nad jazykmi; pumping lemma.; Alphabet; deterministic finite state machine; formal languages; Grammar; Chomsky’s Hierarchy; finite state machine; nondeterministic finite state machine; operations on Alphabet; operations on languages; pumping lemma.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Klimešová, M. (2019). Klasifikácia gramatík, jazykov a automatov (základné typy a využitie): Classification of Grammars, Languages and Machines (Basic Types, Use). (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15023

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Klimešová, Michaela. “Klasifikácia gramatík, jazykov a automatov (základné typy a využitie): Classification of Grammars, Languages and Machines (Basic Types, Use).” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/15023.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Klimešová, Michaela. “Klasifikácia gramatík, jazykov a automatov (základné typy a využitie): Classification of Grammars, Languages and Machines (Basic Types, Use).” 2019. Web. 14 Jul 2020.

Vancouver:

Klimešová M. Klasifikácia gramatík, jazykov a automatov (základné typy a využitie): Classification of Grammars, Languages and Machines (Basic Types, Use). [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/15023.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Klimešová M. Klasifikácia gramatík, jazykov a automatov (základné typy a využitie): Classification of Grammars, Languages and Machines (Basic Types, Use). [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/15023

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

20. Řičánek, Michal. Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/15025

► The aim of this bachelor thesis is the classification of formal grammars, languages, abstract machines and their ways of use in practice. The first section…
(more)

Subjects/Keywords: Formální gramatika; formální jazyk; konečný automat; deterministický konečný automat; nedeterministický konečný automat; Chomského hierarchie; Turingův stroj.; Formal grammar; formal language; finite state machine; deterministic finite state machine; nondeterministic finite state machine; Chomsky hierarchy; Turing machine.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Řičánek, M. (2018). Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/15025

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Řičánek, Michal. “Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/15025.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Řičánek, Michal. “Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines.” 2018. Web. 14 Jul 2020.

Vancouver:

Řičánek M. Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/15025.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Řičánek M. Klasifikace a využití jazyků, gramatik a automatů: Classification and Usage of Languages, Grammars and Machines. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/15025

Not specified: Masters Thesis or Doctoral Dissertation

Penn State University

21. Li, Yue. ADAPTIVE INFORMATION EXTRACTION FROM COMPLEX SYSTEMS VIA SYMBOLIC TIME SERIES ANALYSIS.

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

URL: https://etda.libraries.psu.edu/catalog/kd17cs845

► This dissertation represents a framework for adaptive information extraction from complex systems via symbolic time series analysis (STSA). The key idea for STSA is to…
(more)

Subjects/Keywords: Symbolic time series analysis; Hidden Markov modeling; Pattern recognition; Finite-state Automaton; Information Fusion; Sensor Networks; Battery SOC estimation; Battery SOH estimation; Recursive Bayes Filter; Image processing

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, Y. (2016). ADAPTIVE INFORMATION EXTRACTION FROM COMPLEX SYSTEMS VIA SYMBOLIC TIME SERIES ANALYSIS. (Doctoral Dissertation). Penn State University. Retrieved from https://etda.libraries.psu.edu/catalog/kd17cs845

Chicago Manual of Style (16^{th} Edition):

Li, Yue. “ADAPTIVE INFORMATION EXTRACTION FROM COMPLEX SYSTEMS VIA SYMBOLIC TIME SERIES ANALYSIS.” 2016. Doctoral Dissertation, Penn State University. Accessed July 14, 2020. https://etda.libraries.psu.edu/catalog/kd17cs845.

MLA Handbook (7^{th} Edition):

Li, Yue. “ADAPTIVE INFORMATION EXTRACTION FROM COMPLEX SYSTEMS VIA SYMBOLIC TIME SERIES ANALYSIS.” 2016. Web. 14 Jul 2020.

Vancouver:

Li Y. ADAPTIVE INFORMATION EXTRACTION FROM COMPLEX SYSTEMS VIA SYMBOLIC TIME SERIES ANALYSIS. [Internet] [Doctoral dissertation]. Penn State University; 2016. [cited 2020 Jul 14]. Available from: https://etda.libraries.psu.edu/catalog/kd17cs845.

Council of Science Editors:

Li Y. ADAPTIVE INFORMATION EXTRACTION FROM COMPLEX SYSTEMS VIA SYMBOLIC TIME SERIES ANALYSIS. [Doctoral Dissertation]. Penn State University; 2016. Available from: https://etda.libraries.psu.edu/catalog/kd17cs845

22. Li, Baiyu. Syntactic Complexities of Nine Subclasses of Regular Languages.

Degree: 2012, University of Waterloo

URL: http://hdl.handle.net/10012/6838

► The syntactic complexity of a regular language is the cardinality of its syntactic semigroup. The syntactic complexity of a subclass of the class of regular…
(more)

Subjects/Keywords: finite automaton; monoid; regular language; semigroup; state complexity; syntactic complexity

…if the syntactic semigroup of L is *finite*.
A *deterministic* *finite* *automaton* (DFA)… …incomplete *deterministic* *finite* *automaton* (IDFA) is a quintuple I = (Q, Σ, δ, q1 , F… …biautomaton is a *finite* *automaton* which
can read the input word alternatively from the left and from… …39
4.4
Partially monotonic DFA that is monotonic and has an empty *state*. . . . .
40
5.1… …theoretical computer science.
It is exactly the class of languages accepted by *deterministic*…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Li, B. (2012). Syntactic Complexities of Nine Subclasses of Regular Languages. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6838

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Li, Baiyu. “Syntactic Complexities of Nine Subclasses of Regular Languages.” 2012. Thesis, University of Waterloo. Accessed July 14, 2020. http://hdl.handle.net/10012/6838.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Li, Baiyu. “Syntactic Complexities of Nine Subclasses of Regular Languages.” 2012. Web. 14 Jul 2020.

Vancouver:

Li B. Syntactic Complexities of Nine Subclasses of Regular Languages. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/10012/6838.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Li B. Syntactic Complexities of Nine Subclasses of Regular Languages. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6838

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

23. Ošmera, Lubomír. Nové verze skákajících automatů: New Versions of Jumping Automata.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/62005

► The main goal of this thesis is introduction and investigation of extended version of jumping automata. These versions are specified by strictly size and direction…
(more)

Subjects/Keywords: Automat; skákající; gramatika; k-left; k-right; startující stav; syntaktická analýza; jazyk; modifikované konečné automaty.; Automaton; jumping; grammar; k-left; k-right; starting state; syntactic analysis; language; modified finite automata.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ošmera, L. (2019). Nové verze skákajících automatů: New Versions of Jumping Automata. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/62005

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ošmera, Lubomír. “Nové verze skákajících automatů: New Versions of Jumping Automata.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/62005.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ošmera, Lubomír. “Nové verze skákajících automatů: New Versions of Jumping Automata.” 2019. Web. 14 Jul 2020.

Vancouver:

Ošmera L. Nové verze skákajících automatů: New Versions of Jumping Automata. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/62005.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ošmera L. Nové verze skákajících automatů: New Versions of Jumping Automata. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/62005

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

24. Balgar, Marek. Srovnání implementačních strategií DFA: Comparison of Implementation Strategies of the DFA.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/54643

► This bachelor thesis focuses upon the choices of methods, which are used to store automata on FPGA. There have been chosen these methods: bit-split, compress…
(more)

Subjects/Keywords: deterministický konečný automat; maticová reprezentace; bit-split; compress metoda; hash tabulka; testy; FPGA; porovnání celkové paměti; C++; regulární výrazy; stavy; symboly; přechody; testování; zaplněnost přechodů; deterministic finite automaton; matrix representation; bit-split; compress method; hash table; tests; FPGA; comparison of the memory; C++; regular expresions; states; symbols; transitions; testing; filling of the transitions

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Balgar, M. (2018). Srovnání implementačních strategií DFA: Comparison of Implementation Strategies of the DFA. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/54643

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Balgar, Marek. “Srovnání implementačních strategií DFA: Comparison of Implementation Strategies of the DFA.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/54643.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Balgar, Marek. “Srovnání implementačních strategií DFA: Comparison of Implementation Strategies of the DFA.” 2018. Web. 14 Jul 2020.

Vancouver:

Balgar M. Srovnání implementačních strategií DFA: Comparison of Implementation Strategies of the DFA. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/54643.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Balgar M. Srovnání implementačních strategií DFA: Comparison of Implementation Strategies of the DFA. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/54643

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

25. Ševčík, Miroslav. Částečně paralelní hluboké zásobníkové automaty: Semi-Parallel Deep Pushdown Automata.

Degree: 2019, Brno University of Technology

URL: http://hdl.handle.net/11012/55308

► This work introduces semi-parallel deep pushdown automata as an extension of sequential deep pushdown automata. Unlike the sequential *automaton*, a semi-parallel one is able to…
(more)

Subjects/Keywords: gramatika; stavová gramatika; automat; zásobníkový automat; hluboký zásobníkový automat; částečně paralelní hluboký zásobníkový automat; grammar; state grammar; automaton; pushdown automaton; deep pushdown automaton; semi-parallel deep pushdown automaton

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Ševčík, M. (2019). Částečně paralelní hluboké zásobníkové automaty: Semi-Parallel Deep Pushdown Automata. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/55308

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Ševčík, Miroslav. “Částečně paralelní hluboké zásobníkové automaty: Semi-Parallel Deep Pushdown Automata.” 2019. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/55308.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Ševčík, Miroslav. “Částečně paralelní hluboké zásobníkové automaty: Semi-Parallel Deep Pushdown Automata.” 2019. Web. 14 Jul 2020.

Vancouver:

Ševčík M. Částečně paralelní hluboké zásobníkové automaty: Semi-Parallel Deep Pushdown Automata. [Internet] [Thesis]. Brno University of Technology; 2019. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/55308.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ševčík M. Částečně paralelní hluboké zásobníkové automaty: Semi-Parallel Deep Pushdown Automata. [Thesis]. Brno University of Technology; 2019. Available from: http://hdl.handle.net/11012/55308

Not specified: Masters Thesis or Doctoral Dissertation

University of Western Ontario

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

Degree: 2010, University of Western Ontario

URL: https://ir.lib.uwo.ca/etd/65

► *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 Details Similar Records

❌

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

APA (6^{th} 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

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

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

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Gao, Yuan. “Advanced Topics on State Complexity of Combined Operations.” 2010. Web. 14 Jul 2020.

Vancouver:

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

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

Not specified: Masters Thesis or Doctoral Dissertation

Mississippi State University

27.
Yin, Hebi.
MODELING OF DENDRITE GROWTH WITH CELLULAR *AUTOMATON* METHOD IN THE SOLIDIFICATION OF ALLOYS.

Degree: PhD, Mechanical Engineering, 2010, Mississippi State University

URL: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07072010-212622/ ;

► Dendrite growth is the primary form of crystal growth observed in laser deposition process of most commercial metallic alloys. The properties of metallic alloys…
(more)

Subjects/Keywords: solidification modeling; dendrite growth; cellular automaton; finite element; lattice Boltzmann

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Yin, H. (2010). MODELING OF DENDRITE GROWTH WITH CELLULAR AUTOMATON METHOD IN THE SOLIDIFICATION OF ALLOYS. (Doctoral Dissertation). Mississippi State University. Retrieved from http://sun.library.msstate.edu/ETD-db/theses/available/etd-07072010-212622/ ;

Chicago Manual of Style (16^{th} Edition):

Yin, Hebi. “MODELING OF DENDRITE GROWTH WITH CELLULAR AUTOMATON METHOD IN THE SOLIDIFICATION OF ALLOYS.” 2010. Doctoral Dissertation, Mississippi State University. Accessed July 14, 2020. http://sun.library.msstate.edu/ETD-db/theses/available/etd-07072010-212622/ ;.

MLA Handbook (7^{th} Edition):

Yin, Hebi. “MODELING OF DENDRITE GROWTH WITH CELLULAR AUTOMATON METHOD IN THE SOLIDIFICATION OF ALLOYS.” 2010. Web. 14 Jul 2020.

Vancouver:

Yin H. MODELING OF DENDRITE GROWTH WITH CELLULAR AUTOMATON METHOD IN THE SOLIDIFICATION OF ALLOYS. [Internet] [Doctoral dissertation]. Mississippi State University; 2010. [cited 2020 Jul 14]. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07072010-212622/ ;.

Council of Science Editors:

Yin H. MODELING OF DENDRITE GROWTH WITH CELLULAR AUTOMATON METHOD IN THE SOLIDIFICATION OF ALLOYS. [Doctoral Dissertation]. Mississippi State University; 2010. Available from: http://sun.library.msstate.edu/ETD-db/theses/available/etd-07072010-212622/ ;

University of Southern California

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

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

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/195424/rec/3743

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

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

Record Details Similar Records

❌

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

APA (6^{th} Edition):

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

Chicago Manual of Style (16^{th} Edition):

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

MLA Handbook (7^{th} Edition):

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

Vancouver:

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

Council of Science Editors:

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

Brno University of Technology

29.
Zámečníková, Eva.
Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled *Finite* Automata.

Degree: 2018, Brno University of Technology

URL: http://hdl.handle.net/11012/52747

► Master's thesis is dealing with translation based on coupled *finite* *automaton* model. Coupled *finite* *automaton* contains input and output *automaton*. The input *automaton* makes syntactic…
(more)

Subjects/Keywords: konečný automat; líný konečný automat; konečný převodník; líný konečný převodník; párový konečný automat; nejednoznačnost; determinismus; bezkontextová gramatika.; finite automaton; lazy finite automaton; finite transducer; lazy finite transducer; coupled finite automaton; ambiguity; determinism; context free grammar.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zámečníková, E. (2018). Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52747

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zámečníková, Eva. “Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata.” 2018. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/52747.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zámečníková, Eva. “Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata.” 2018. Web. 14 Jul 2020.

Vancouver:

Zámečníková E. Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/52747.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zámečníková E. Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/52747

Not specified: Masters Thesis or Doctoral Dissertation

Brno University of Technology

30.
Zámečníková, Eva.
Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled *Finite* Automata.

Degree: 2020, Brno University of Technology

URL: http://hdl.handle.net/11012/188661

► Master's thesis is dealing with translation based on coupled *finite* *automaton* model. Coupled *finite* *automaton* contains input and output *automaton*. The input *automaton* makes syntactic…
(more)

Subjects/Keywords: konečný automat; líný konečný automat; konečný převodník; líný konečný převodník; párový konečný automat; nejednoznačnost; determinismus; bezkontextová gramatika.; finite automaton; lazy finite automaton; finite transducer; lazy finite transducer; coupled finite automaton; ambiguity; determinism; context free grammar.

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Zámečníková, E. (2020). Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/188661

Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^{th} Edition):

Zámečníková, Eva. “Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata.” 2020. Thesis, Brno University of Technology. Accessed July 14, 2020. http://hdl.handle.net/11012/188661.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Zámečníková, Eva. “Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata.” 2020. Web. 14 Jul 2020.

Vancouver:

Zámečníková E. Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Jul 14]. Available from: http://hdl.handle.net/11012/188661.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zámečníková E. Syntaktická analýza založená na párových automatech: Syntactic Analysis Based on Coupled Finite Automata. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/188661

Not specified: Masters Thesis or Doctoral Dissertation