Advanced search options

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

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

.
Showing records 1 – 13 of
13 total matches.

▼ Search Limiters

University of Pretoria

1.
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 16, 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. 16 Jul 2020.

Vancouver:

Coetser RJ. Finite state automaton construction through regular expression hashing. [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Jul 16]. 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

2.
[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 16, 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. 16 Jul 2020.

Vancouver:

author] [. Finite state automaton construction through regular expression hashing . [Internet] [Masters thesis]. University of Pretoria; 2010. [cited 2020 Jul 16]. 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/

Brno University of Technology

3. 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

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

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

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

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. 16 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 16]. Available from: http://hdl.handle.net/11012/187212.

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

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

4. 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 16, 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. 16 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 16]. 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

5. 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 16, 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. 16 Jul 2020.

Vancouver:

Wilson DAS. A Study of the Behavior of Chaos Automata. [Internet] [Doctoral dissertation]. Kent State University; 2016. [cited 2020 Jul 16]. 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

6.
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 16, 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. 16 Jul 2020.

Vancouver:

YUNXIA X. Integrated fault diagnosis scheme using finite-state automation. [Internet] [Thesis]. National University of Singapore; 2003. [cited 2020 Jul 16]. 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

Brno University of Technology

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

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 16, 2020. http://hdl.handle.net/11012/52773.

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. 16 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 16]. Available from: http://hdl.handle.net/11012/52773.

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

Iowa State University

8. 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 16, 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. 16 Jul 2020.

Vancouver:

Saha H. Exploring Granger causality in dynamical systems modeling and performance monitoring. [Internet] [Thesis]. Iowa State University; 2018. [cited 2020 Jul 16]. 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

Penn State University

9. 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 16, 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. 16 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 16]. 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

10. 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

…biautomaton is a *finite* *automaton* which
can read the input word alternatively from the left and from… …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… …39
4.4
Partially monotonic DFA that is monotonic and has an empty *state*. . . . .
40
5.1… …nondeterministic *finite* automata (DFA’s / NFA’s), which are the simplest, but still powerful…

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 16, 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. 16 Jul 2020.

Vancouver:

Li B. Syntactic Complexities of Nine Subclasses of Regular Languages. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2020 Jul 16]. 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

11. 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 16, 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. 16 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 16]. 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

12.
Harris, Andrew.
Suitability of *Finite* *State* Automata to Model String Constraints in Probablistic Symbolic Execution.

Degree: 2019, Boise State University

URL: https://scholarworks.boisestate.edu/td/1597

► Probabilistic Symbolic Execution (PSE) extends Symbolic Execution (SE), a path-sensitive static program analysis technique, by calculating the probabilities with which program paths are executed. PSE…
(more)

Subjects/Keywords: quantitative string analysis; information flow analysis; multiset symbolic string model; string analysis; symbolic execution; finite state automaton; Information Security; Software Engineering; Theory and Algorithms

…72
3.4.1
Weighted-Transition *Finite* *State* *Automaton* . . . . . . . . . . . . . . . 73… …99
4.4.5
Weighted-Transition *Finite* *State* *Automaton* . . . . . . . . . . . . . . . 102… …150
xv
LIST OF ABBREVIATIONS
DFA – Deterministic *Finite* *State* *Automaton*
FSA – *Finite*… …*State* *Automaton*
MC – Model Count
NFA – Nondeterministic *Finite* *State* *Automaton*
PC – Path… …Weighted-Transition *Finite* *State* *Automaton*
xvi
LIST OF SYMBOLS
A
*Finite* *State* Automata
L…

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Harris, A. (2019). Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1597

Not specified: Masters Thesis or Doctoral Dissertation

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

Harris, Andrew. “Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution.” 2019. Thesis, Boise State University. Accessed July 16, 2020. https://scholarworks.boisestate.edu/td/1597.

Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^{th} Edition):

Harris, Andrew. “Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution.” 2019. Web. 16 Jul 2020.

Vancouver:

Harris A. Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution. [Internet] [Thesis]. Boise State University; 2019. [cited 2020 Jul 16]. Available from: https://scholarworks.boisestate.edu/td/1597.

Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Harris A. Suitability of Finite State Automata to Model String Constraints in Probablistic Symbolic Execution. [Thesis]. Boise State University; 2019. Available from: https://scholarworks.boisestate.edu/td/1597

Not specified: Masters Thesis or Doctoral Dissertation

Humboldt University of Berlin

13. Goldstraß, Thomas. Das Problem der universellen Realisierbarkeit bei Putnam und Searle.

Degree: 2002, Humboldt University of Berlin

URL: http://edoc.hu-berlin.de/docviews/abstract.php?id=3027 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/HTML/index.html ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005929 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/PDF/Goldstrass.pdf ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005933

►

In dieser Arbeit wird gezeigt, dass das Problem der universellen Realisierbarkeit - ein Argument von John R. Searle und Hilary Putnam gegen die Kognitionswissenschaft -… (more)

Subjects/Keywords: Philosophie; Gehirn; Philosophie des Geistes; universelle Realisierbarkeit; Kognitionswissenschaft; Funktionalismus; Künstliche Intelligenz; Kognitivismus; Endlicher Automat; digitaler Computer; Turingmaschine; Computerprogramm; Symbol; Geist; brain; philosophy of the mind; universal realizability; cognitive science; functionalism; artificial intelligence; cognitivism; finite state automaton; Turing machine; computer program; digital computer; symbol; mind; Philosophie; ddc:100

Record Details Similar Records

❌

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

APA (6^{th} Edition):

Goldstraß, T. (2002). Das Problem der universellen Realisierbarkeit bei Putnam und Searle. (Masters Thesis). Humboldt University of Berlin. Retrieved from http://edoc.hu-berlin.de/docviews/abstract.php?id=3027 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/HTML/index.html ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005929 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/PDF/Goldstrass.pdf ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005933

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

Goldstraß, Thomas. “Das Problem der universellen Realisierbarkeit bei Putnam und Searle.” 2002. Masters Thesis, Humboldt University of Berlin. Accessed July 16, 2020. http://edoc.hu-berlin.de/docviews/abstract.php?id=3027 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/HTML/index.html ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005929 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/PDF/Goldstrass.pdf ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005933.

MLA Handbook (7^{th} Edition):

Goldstraß, Thomas. “Das Problem der universellen Realisierbarkeit bei Putnam und Searle.” 2002. Web. 16 Jul 2020.

Vancouver:

Goldstraß T. Das Problem der universellen Realisierbarkeit bei Putnam und Searle. [Internet] [Masters thesis]. Humboldt University of Berlin; 2002. [cited 2020 Jul 16]. Available from: http://edoc.hu-berlin.de/docviews/abstract.php?id=3027 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/HTML/index.html ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005929 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/PDF/Goldstrass.pdf ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005933.

Council of Science Editors:

Goldstraß T. Das Problem der universellen Realisierbarkeit bei Putnam und Searle. [Masters Thesis]. Humboldt University of Berlin; 2002. Available from: http://edoc.hu-berlin.de/docviews/abstract.php?id=3027 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/HTML/index.html ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005929 ; http://edoc.hu-berlin.de/magister/goldstrass-thomas-2002-11-08/PDF/Goldstrass.pdf ; http://www.nbn-resolving.de/urn:nbn:de:kobv:11-1005933