Advanced search options

Advanced Search Options 🞨

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

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(automata theory). Showing records 1 – 30 of 88 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


University of Waterloo

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

Degree: 2018, University of Waterloo

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

Lidbetter, Thomas. “Counting, Adding, and Regular Languages.” 2018. Web. 12 Nov 2019.

Vancouver:

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

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

Council of Science Editors:

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

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


Delft University of Technology

2. Dannenberg, F.G.W. Symbolic dynamics and automata theory :.

Degree: 2011, Delft University of Technology

The equivalence of streams under transducers is investigated, as introduced by Klop 2011. In the process, some morphic properties of the Toeplitz words as first described by Keane are discovered. Advisors/Committee Members: Fokkink, R.J..

Subjects/Keywords: automata theory; transducer equivalence; symbolic dynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dannenberg, F. G. W. (2011). Symbolic dynamics and automata theory :. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:e7bd28eb-8fea-48ce-89c3-a2a6657f2810

Chicago Manual of Style (16th Edition):

Dannenberg, F G W. “Symbolic dynamics and automata theory :.” 2011. Masters Thesis, Delft University of Technology. Accessed November 12, 2019. http://resolver.tudelft.nl/uuid:e7bd28eb-8fea-48ce-89c3-a2a6657f2810.

MLA Handbook (7th Edition):

Dannenberg, F G W. “Symbolic dynamics and automata theory :.” 2011. Web. 12 Nov 2019.

Vancouver:

Dannenberg FGW. Symbolic dynamics and automata theory :. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2019 Nov 12]. Available from: http://resolver.tudelft.nl/uuid:e7bd28eb-8fea-48ce-89c3-a2a6657f2810.

Council of Science Editors:

Dannenberg FGW. Symbolic dynamics and automata theory :. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:e7bd28eb-8fea-48ce-89c3-a2a6657f2810


East Carolina University

3. Masters, Miciah Dashiel Butler. Synchronizing Automata and the Černý Conjecture.

Degree: 2012, East Carolina University

 We provide a survey of research surrounding the Černý conjecture. This conjecture concerns finite-state automata that have the property of being "synchronizing." A synchronizing automaton… (more)

Subjects/Keywords: Computer science; Automata; Černý conjecture; Deterministic; Finite-state; Synchronizing automata; Machine theory; Robots – Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

Masters, Miciah Dashiel Butler. “Synchronizing Automata and the Černý Conjecture.” 2012. Thesis, East Carolina University. Accessed November 12, 2019. http://hdl.handle.net/10342/3937.

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

MLA Handbook (7th Edition):

Masters, Miciah Dashiel Butler. “Synchronizing Automata and the Černý Conjecture.” 2012. Web. 12 Nov 2019.

Vancouver:

Masters MDB. Synchronizing Automata and the Černý Conjecture. [Internet] [Thesis]. East Carolina University; 2012. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10342/3937.

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

Council of Science Editors:

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

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


University of Waterloo

4. Rajasekaran, Aayush. Using Automata Theory to Solve Problems in Additive Number Theory.

Degree: 2018, University of Waterloo

 Additive number theory is the study of the additive properties of integers. Perhaps the best-known theorem is Lagrange’s result that every natural number is the… (more)

Subjects/Keywords: Automata Theory; Number Theory; Formal languages; Automated proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rajasekaran, A. (2018). Using Automata Theory to Solve Problems in Additive Number Theory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13202

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

Chicago Manual of Style (16th Edition):

Rajasekaran, Aayush. “Using Automata Theory to Solve Problems in Additive Number Theory.” 2018. Thesis, University of Waterloo. Accessed November 12, 2019. http://hdl.handle.net/10012/13202.

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

MLA Handbook (7th Edition):

Rajasekaran, Aayush. “Using Automata Theory to Solve Problems in Additive Number Theory.” 2018. Web. 12 Nov 2019.

Vancouver:

Rajasekaran A. Using Automata Theory to Solve Problems in Additive Number Theory. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10012/13202.

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

Council of Science Editors:

Rajasekaran A. Using Automata Theory to Solve Problems in Additive Number Theory. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13202

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

5. Lopes, Victor Dias. Proposta de integração entre tecnologias adaptativas e algoritmos genéticos.

Degree: Mestrado, Sistemas Digitais, 2009, University of São Paulo

Este trabalho é um estudo inicial sobre a integração de duas áreas da engenharia da computação, as tecnologias adaptativas e os algoritmos genéticos. Para tanto,… (more)

Subjects/Keywords: Adaptive automata; Algoritmos genéticos; Automata theory; Computing theory; Genetic algorithms; Inteligência artificial; Language inference; Teoria da computação; Teoria dos autômatos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lopes, V. D. (2009). Proposta de integração entre tecnologias adaptativas e algoritmos genéticos. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3141/tde-01072009-133614/ ;

Chicago Manual of Style (16th Edition):

Lopes, Victor Dias. “Proposta de integração entre tecnologias adaptativas e algoritmos genéticos.” 2009. Masters Thesis, University of São Paulo. Accessed November 12, 2019. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-01072009-133614/ ;.

MLA Handbook (7th Edition):

Lopes, Victor Dias. “Proposta de integração entre tecnologias adaptativas e algoritmos genéticos.” 2009. Web. 12 Nov 2019.

Vancouver:

Lopes VD. Proposta de integração entre tecnologias adaptativas e algoritmos genéticos. [Internet] [Masters thesis]. University of São Paulo; 2009. [cited 2019 Nov 12]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3141/tde-01072009-133614/ ;.

Council of Science Editors:

Lopes VD. Proposta de integração entre tecnologias adaptativas e algoritmos genéticos. [Masters Thesis]. University of São Paulo; 2009. Available from: http://www.teses.usp.br/teses/disponiveis/3/3141/tde-01072009-133614/ ;


University of Oxford

6. Lechner, Antonia. Extensions of Presburger arithmetic and model checking one-counter automata.

Degree: PhD, 2016, University of Oxford

 This thesis concerns decision procedures for fragments of linear arithmetic and their application to model-checking one-counter automata. The first part of this thesis covers the… (more)

Subjects/Keywords: Automata Theory; Linear Arithmetic; Computational Complexity Theory; reachability problems; Presburger arithmetic; p-adic numbers; one-counter automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lechner, A. (2016). Extensions of Presburger arithmetic and model checking one-counter automata. (Doctoral Dissertation). University of Oxford. Retrieved from https://ora.ox.ac.uk/objects/uuid:687bd910-392a-4db0-9fc6-eb10efb8235b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.735876

Chicago Manual of Style (16th Edition):

Lechner, Antonia. “Extensions of Presburger arithmetic and model checking one-counter automata.” 2016. Doctoral Dissertation, University of Oxford. Accessed November 12, 2019. https://ora.ox.ac.uk/objects/uuid:687bd910-392a-4db0-9fc6-eb10efb8235b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.735876.

MLA Handbook (7th Edition):

Lechner, Antonia. “Extensions of Presburger arithmetic and model checking one-counter automata.” 2016. Web. 12 Nov 2019.

Vancouver:

Lechner A. Extensions of Presburger arithmetic and model checking one-counter automata. [Internet] [Doctoral dissertation]. University of Oxford; 2016. [cited 2019 Nov 12]. Available from: https://ora.ox.ac.uk/objects/uuid:687bd910-392a-4db0-9fc6-eb10efb8235b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.735876.

Council of Science Editors:

Lechner A. Extensions of Presburger arithmetic and model checking one-counter automata. [Doctoral Dissertation]. University of Oxford; 2016. Available from: https://ora.ox.ac.uk/objects/uuid:687bd910-392a-4db0-9fc6-eb10efb8235b ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.735876


University of Oxford

7. Riveros Jaeger, Cristian. Repairing strings and trees.

Degree: PhD, 2013, University of Oxford

 What do you do if a computational object fails a specification? An obvious approach is to repair it, namely, to modify the object minimally to… (more)

Subjects/Keywords: 005.14; Computer science (mathematics); Theory and automated verification; Automata theory; repair; edit distance; strings; trees; tree automata; XML Schema

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Riveros Jaeger, C. (2013). Repairing strings and trees. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260

Chicago Manual of Style (16th Edition):

Riveros Jaeger, Cristian. “Repairing strings and trees.” 2013. Doctoral Dissertation, University of Oxford. Accessed November 12, 2019. http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260.

MLA Handbook (7th Edition):

Riveros Jaeger, Cristian. “Repairing strings and trees.” 2013. Web. 12 Nov 2019.

Vancouver:

Riveros Jaeger C. Repairing strings and trees. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Nov 12]. Available from: http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260.

Council of Science Editors:

Riveros Jaeger C. Repairing strings and trees. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:012d384f-d1d0-471b-ae6e-bbf337892680 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581260


University of Waterloo

8. Davies, Sylvie. Algebraic Approaches to State Complexity of Regular Operations.

Degree: 2019, University of Waterloo

 The state complexity of operations on regular languages is an active area of research in theoretical computer science. Through connections with algebra, particularly the theory(more)

Subjects/Keywords: formal languages; regular languages; finite automata; abstract algebra; group theory; monoid theory; groups; monoids; automata; state complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Davies, S. (2019). Algebraic Approaches to State Complexity of Regular Operations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/15203

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

Chicago Manual of Style (16th Edition):

Davies, Sylvie. “Algebraic Approaches to State Complexity of Regular Operations.” 2019. Thesis, University of Waterloo. Accessed November 12, 2019. http://hdl.handle.net/10012/15203.

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

MLA Handbook (7th Edition):

Davies, Sylvie. “Algebraic Approaches to State Complexity of Regular Operations.” 2019. Web. 12 Nov 2019.

Vancouver:

Davies S. Algebraic Approaches to State Complexity of Regular Operations. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10012/15203.

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

Council of Science Editors:

Davies S. Algebraic Approaches to State Complexity of Regular Operations. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/15203

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


Cornell University

9. Minnes, Mor Mia. Computability and Complexity Properties of Automatic Structures and their Applications .

Degree: 2008, Cornell University

 Finite state automata are Turing machines with fixed finite bounds on resource use. Automata lend themselves well to real-time computations and efficient algorithms. Continuing a… (more)

Subjects/Keywords: Mathematical Logic; Theoretical Computer Science; Finite automata; Computable model theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Minnes, M. M. (2008). Computability and Complexity Properties of Automatic Structures and their Applications . (Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/10820

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

Chicago Manual of Style (16th Edition):

Minnes, Mor Mia. “Computability and Complexity Properties of Automatic Structures and their Applications .” 2008. Thesis, Cornell University. Accessed November 12, 2019. http://hdl.handle.net/1813/10820.

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

MLA Handbook (7th Edition):

Minnes, Mor Mia. “Computability and Complexity Properties of Automatic Structures and their Applications .” 2008. Web. 12 Nov 2019.

Vancouver:

Minnes MM. Computability and Complexity Properties of Automatic Structures and their Applications . [Internet] [Thesis]. Cornell University; 2008. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/1813/10820.

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

Council of Science Editors:

Minnes MM. Computability and Complexity Properties of Automatic Structures and their Applications . [Thesis]. Cornell University; 2008. Available from: http://hdl.handle.net/1813/10820

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


McGill University

10. Sznajder-Glodowski, Malgorzata. Categorical approach to automata theory.

Degree: MS, School of Computer Science., 1986, McGill University

Subjects/Keywords: Machine theory; Probabilistic automata.; Monoids.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sznajder-Glodowski, M. (1986). Categorical approach to automata theory. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile65417.pdf

Chicago Manual of Style (16th Edition):

Sznajder-Glodowski, Malgorzata. “Categorical approach to automata theory.” 1986. Masters Thesis, McGill University. Accessed November 12, 2019. http://digitool.library.mcgill.ca/thesisfile65417.pdf.

MLA Handbook (7th Edition):

Sznajder-Glodowski, Malgorzata. “Categorical approach to automata theory.” 1986. Web. 12 Nov 2019.

Vancouver:

Sznajder-Glodowski M. Categorical approach to automata theory. [Internet] [Masters thesis]. McGill University; 1986. [cited 2019 Nov 12]. Available from: http://digitool.library.mcgill.ca/thesisfile65417.pdf.

Council of Science Editors:

Sznajder-Glodowski M. Categorical approach to automata theory. [Masters Thesis]. McGill University; 1986. Available from: http://digitool.library.mcgill.ca/thesisfile65417.pdf


University of Illinois – Urbana-Champaign

11. Kini, Dileep Raghunath. Verification of linear-time properties for finite probabilistic systems.

Degree: PhD, Computer Science, 2017, University of Illinois – Urbana-Champaign

 With computers becoming ubiquitous there is an ever growing necessity to ensure that they are programmed to behave correctly. Formal verification is a discipline within… (more)

Subjects/Keywords: Probabilistic model checking; Markov decision processes; Linear temporal logic; Automata theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kini, D. R. (2017). Verification of linear-time properties for finite probabilistic systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/99357

Chicago Manual of Style (16th Edition):

Kini, Dileep Raghunath. “Verification of linear-time properties for finite probabilistic systems.” 2017. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed November 12, 2019. http://hdl.handle.net/2142/99357.

MLA Handbook (7th Edition):

Kini, Dileep Raghunath. “Verification of linear-time properties for finite probabilistic systems.” 2017. Web. 12 Nov 2019.

Vancouver:

Kini DR. Verification of linear-time properties for finite probabilistic systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2017. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/2142/99357.

Council of Science Editors:

Kini DR. Verification of linear-time properties for finite probabilistic systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2017. Available from: http://hdl.handle.net/2142/99357


University of Oxford

12. Mestel, David. Quantifying information flow.

Degree: PhD, 2018, University of Oxford

 The main problem addressed by this thesis is that of characterising information leakage channels in interactive systems as either 'dangerous' or 'safe', on the basis… (more)

Subjects/Keywords: Process algebra; Automata theory; Foundations of computer security; Discrete mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mestel, D. (2018). Quantifying information flow. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565

Chicago Manual of Style (16th Edition):

Mestel, David. “Quantifying information flow.” 2018. Doctoral Dissertation, University of Oxford. Accessed November 12, 2019. http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565.

MLA Handbook (7th Edition):

Mestel, David. “Quantifying information flow.” 2018. Web. 12 Nov 2019.

Vancouver:

Mestel D. Quantifying information flow. [Internet] [Doctoral dissertation]. University of Oxford; 2018. [cited 2019 Nov 12]. Available from: http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565.

Council of Science Editors:

Mestel D. Quantifying information flow. [Doctoral Dissertation]. University of Oxford; 2018. Available from: http://ora.ox.ac.uk/objects/uuid:418eceba-fefc-4378-8ab5-37c41a452057 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.770565


Stellenbosch University

13. Marais, Laurette. Generalised acceptance conditions for symmetric difference nondeterministic finite automata.

Degree: PhD, Mathematical Sciences, 2018, Stellenbosch University

ENGLISH ABSTRACT : Symmetric difference nondeterministic finite state automata (XNFA) are an instance of generalised nondeterminism, of which the behaviour is represented by the symmetric… (more)

Subjects/Keywords: Formal systems  – Descriptional complexity; Finite automata; Computer science  – Mathematics; Sequential machine theory; UCTD; Nondeterministic finite automaton; Symmetric difference automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Marais, L. (2018). Generalised acceptance conditions for symmetric difference nondeterministic finite automata. (Doctoral Dissertation). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/103471

Chicago Manual of Style (16th Edition):

Marais, Laurette. “Generalised acceptance conditions for symmetric difference nondeterministic finite automata.” 2018. Doctoral Dissertation, Stellenbosch University. Accessed November 12, 2019. http://hdl.handle.net/10019.1/103471.

MLA Handbook (7th Edition):

Marais, Laurette. “Generalised acceptance conditions for symmetric difference nondeterministic finite automata.” 2018. Web. 12 Nov 2019.

Vancouver:

Marais L. Generalised acceptance conditions for symmetric difference nondeterministic finite automata. [Internet] [Doctoral dissertation]. Stellenbosch University; 2018. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10019.1/103471.

Council of Science Editors:

Marais L. Generalised acceptance conditions for symmetric difference nondeterministic finite automata. [Doctoral Dissertation]. Stellenbosch University; 2018. Available from: http://hdl.handle.net/10019.1/103471


Loughborough University

14. Schmid, Markus L. On the membership problem for pattern languages and related topics.

Degree: PhD, 2012, Loughborough University

 In this thesis, we investigate the complexity of the membership problem for pattern languages. A pattern is a string over the union of the alphabets… (more)

Subjects/Keywords: 401; Formal language theory; Automata theory; Pattern Languages; Membership problem; NP-complete problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schmid, M. L. (2012). On the membership problem for pattern languages and related topics. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/10304 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561177

Chicago Manual of Style (16th Edition):

Schmid, Markus L. “On the membership problem for pattern languages and related topics.” 2012. Doctoral Dissertation, Loughborough University. Accessed November 12, 2019. https://dspace.lboro.ac.uk/2134/10304 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561177.

MLA Handbook (7th Edition):

Schmid, Markus L. “On the membership problem for pattern languages and related topics.” 2012. Web. 12 Nov 2019.

Vancouver:

Schmid ML. On the membership problem for pattern languages and related topics. [Internet] [Doctoral dissertation]. Loughborough University; 2012. [cited 2019 Nov 12]. Available from: https://dspace.lboro.ac.uk/2134/10304 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561177.

Council of Science Editors:

Schmid ML. On the membership problem for pattern languages and related topics. [Doctoral Dissertation]. Loughborough University; 2012. Available from: https://dspace.lboro.ac.uk/2134/10304 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.561177


University of Plymouth

15. Carmantini, Giovanni Sirio. Dynamical systems theory for transparent symbolic computation in neuronal networks.

Degree: PhD, 2017, University of Plymouth

 In this thesis, we explore the interface between symbolic and dynamical system computation, with particular regard to dynamical system models of neuronal networks. In doing… (more)

Subjects/Keywords: 006.3; Automata Theory; Recurrent Neural Networks; Representation Theory; Neural Symbolic Computation; Dynamical Systems; Symbolic Dynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carmantini, G. S. (2017). Dynamical systems theory for transparent symbolic computation in neuronal networks. (Doctoral Dissertation). University of Plymouth. Retrieved from http://hdl.handle.net/10026.1/8647

Chicago Manual of Style (16th Edition):

Carmantini, Giovanni Sirio. “Dynamical systems theory for transparent symbolic computation in neuronal networks.” 2017. Doctoral Dissertation, University of Plymouth. Accessed November 12, 2019. http://hdl.handle.net/10026.1/8647.

MLA Handbook (7th Edition):

Carmantini, Giovanni Sirio. “Dynamical systems theory for transparent symbolic computation in neuronal networks.” 2017. Web. 12 Nov 2019.

Vancouver:

Carmantini GS. Dynamical systems theory for transparent symbolic computation in neuronal networks. [Internet] [Doctoral dissertation]. University of Plymouth; 2017. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10026.1/8647.

Council of Science Editors:

Carmantini GS. Dynamical systems theory for transparent symbolic computation in neuronal networks. [Doctoral Dissertation]. University of Plymouth; 2017. Available from: http://hdl.handle.net/10026.1/8647


Loughborough University

16. Schmid, Markus L. On the membership problem for pattern languages and related topics.

Degree: PhD, 2012, Loughborough University

 In this thesis, we investigate the complexity of the membership problem for pattern languages. A pattern is a string over the union of the alphabets… (more)

Subjects/Keywords: 401; Formal language theory; Automata theory; Pattern Languages; Membership problem; NP-complete problems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schmid, M. L. (2012). On the membership problem for pattern languages and related topics. (Doctoral Dissertation). Loughborough University. Retrieved from http://hdl.handle.net/2134/10304

Chicago Manual of Style (16th Edition):

Schmid, Markus L. “On the membership problem for pattern languages and related topics.” 2012. Doctoral Dissertation, Loughborough University. Accessed November 12, 2019. http://hdl.handle.net/2134/10304.

MLA Handbook (7th Edition):

Schmid, Markus L. “On the membership problem for pattern languages and related topics.” 2012. Web. 12 Nov 2019.

Vancouver:

Schmid ML. On the membership problem for pattern languages and related topics. [Internet] [Doctoral dissertation]. Loughborough University; 2012. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/2134/10304.

Council of Science Editors:

Schmid ML. On the membership problem for pattern languages and related topics. [Doctoral Dissertation]. Loughborough University; 2012. Available from: http://hdl.handle.net/2134/10304


University of Johannesburg

17. Ras, Charl John. Automatically presentable structures.

Degree: 2012, University of Johannesburg

M.Sc.

In this thesis we study some of the propertie of a clas called automatic structures. Automatic structures are structures that can be encoded (in some defined way) into a set of regular languages. This encoding allows one to prove many interesting properties about automatic structures, including decidabilty results.

Subjects/Keywords: Sequential machine theory; Automata; Formal languages; Equivalence relations (Set theory); Permutation groups; Graph theory; Numbers, Natural; Logic, Symbolic and mathematical

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ras, C. J. (2012). Automatically presentable structures. (Thesis). University of Johannesburg. Retrieved from http://hdl.handle.net/10210/6838

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

Chicago Manual of Style (16th Edition):

Ras, Charl John. “Automatically presentable structures.” 2012. Thesis, University of Johannesburg. Accessed November 12, 2019. http://hdl.handle.net/10210/6838.

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

MLA Handbook (7th Edition):

Ras, Charl John. “Automatically presentable structures.” 2012. Web. 12 Nov 2019.

Vancouver:

Ras CJ. Automatically presentable structures. [Internet] [Thesis]. University of Johannesburg; 2012. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10210/6838.

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

Council of Science Editors:

Ras CJ. Automatically presentable structures. [Thesis]. University of Johannesburg; 2012. Available from: http://hdl.handle.net/10210/6838

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

18. Silva Filho, Reginaldo Inojosa da. Uma nova formulação algébrica para o autômato finito adaptativo de segunda ordem aplicada a um modelo de inferência indutiva.

Degree: PhD, Sistemas Digitais, 2012, University of São Paulo

O objetivo deste trabalho é apresentar o modelo dos autômatos adaptativos de segunda ordem e mostrar a forte conexão desse modelo com o aprendizado indutivo… (more)

Subjects/Keywords: Aprendizado computacional; Automata theory; Formal languages; Linguagens formais; Machine learning; Teoria dos autômatos

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Silva Filho, R. I. d. (2012). Uma nova formulação algébrica para o autômato finito adaptativo de segunda ordem aplicada a um modelo de inferência indutiva. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3141/tde-05092012-163421/ ;

Chicago Manual of Style (16th Edition):

Silva Filho, Reginaldo Inojosa da. “Uma nova formulação algébrica para o autômato finito adaptativo de segunda ordem aplicada a um modelo de inferência indutiva.” 2012. Doctoral Dissertation, University of São Paulo. Accessed November 12, 2019. http://www.teses.usp.br/teses/disponiveis/3/3141/tde-05092012-163421/ ;.

MLA Handbook (7th Edition):

Silva Filho, Reginaldo Inojosa da. “Uma nova formulação algébrica para o autômato finito adaptativo de segunda ordem aplicada a um modelo de inferência indutiva.” 2012. Web. 12 Nov 2019.

Vancouver:

Silva Filho RId. Uma nova formulação algébrica para o autômato finito adaptativo de segunda ordem aplicada a um modelo de inferência indutiva. [Internet] [Doctoral dissertation]. University of São Paulo; 2012. [cited 2019 Nov 12]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3141/tde-05092012-163421/ ;.

Council of Science Editors:

Silva Filho RId. Uma nova formulação algébrica para o autômato finito adaptativo de segunda ordem aplicada a um modelo de inferência indutiva. [Doctoral Dissertation]. University of São Paulo; 2012. Available from: http://www.teses.usp.br/teses/disponiveis/3/3141/tde-05092012-163421/ ;


Texas A&M University

19. Kogan, Roman Leonidovich. Measures Induced by Automata and Their Actions.

Degree: PhD, Mathematics, 2017, Texas A&M University

 In this thesis we explore the theme of automata, measures on spaces of sequences X^N in a finite alphabet X, and their connections. The notion… (more)

Subjects/Keywords: automata; measures; finite-state; group theory; Markov measures; sofic measures; Gibbs measures; images of measures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kogan, R. L. (2017). Measures Induced by Automata and Their Actions. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/166707

Chicago Manual of Style (16th Edition):

Kogan, Roman Leonidovich. “Measures Induced by Automata and Their Actions.” 2017. Doctoral Dissertation, Texas A&M University. Accessed November 12, 2019. http://hdl.handle.net/1969.1/166707.

MLA Handbook (7th Edition):

Kogan, Roman Leonidovich. “Measures Induced by Automata and Their Actions.” 2017. Web. 12 Nov 2019.

Vancouver:

Kogan RL. Measures Induced by Automata and Their Actions. [Internet] [Doctoral dissertation]. Texas A&M University; 2017. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/1969.1/166707.

Council of Science Editors:

Kogan RL. Measures Induced by Automata and Their Actions. [Doctoral Dissertation]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/166707


University of Oxford

20. Vanden Boom, Michael T. Weak cost automata over infinite trees.

Degree: PhD, 2012, University of Oxford

 Cost automata are traditional finite state automata enriched with a finite set of counters that can be manipulated on each transition. Based on the evolution… (more)

Subjects/Keywords: 512; Computer science (mathematics); automata theory; monadic second-order logic; parity games; cost functions

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vanden Boom, M. T. (2012). Weak cost automata over infinite trees. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:16c6de98-545f-4d2d-acda-efc040049452 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.580925

Chicago Manual of Style (16th Edition):

Vanden Boom, Michael T. “Weak cost automata over infinite trees.” 2012. Doctoral Dissertation, University of Oxford. Accessed November 12, 2019. http://ora.ox.ac.uk/objects/uuid:16c6de98-545f-4d2d-acda-efc040049452 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.580925.

MLA Handbook (7th Edition):

Vanden Boom, Michael T. “Weak cost automata over infinite trees.” 2012. Web. 12 Nov 2019.

Vancouver:

Vanden Boom MT. Weak cost automata over infinite trees. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2019 Nov 12]. Available from: http://ora.ox.ac.uk/objects/uuid:16c6de98-545f-4d2d-acda-efc040049452 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.580925.

Council of Science Editors:

Vanden Boom MT. Weak cost automata over infinite trees. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:16c6de98-545f-4d2d-acda-efc040049452 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.580925


University of Cambridge

21. David, Stefan. Extremal combinatorics and universal algorithms.

Degree: PhD, 2018, University of Cambridge

 In this dissertation we solve several combinatorial problems in different areas of mathematics: automata theory, combinatorics of partially ordered sets and extremal combinatorics. Firstly, we… (more)

Subjects/Keywords: Combinatorics; Extremal Combinatorics; Algorithms; Automata theory; Bootstrap percolation; Combinatorics of partially ordered sets

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

David, S. (2018). Extremal combinatorics and universal algorithms. (Doctoral Dissertation). University of Cambridge. Retrieved from https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383

Chicago Manual of Style (16th Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Doctoral Dissertation, University of Cambridge. Accessed November 12, 2019. https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

MLA Handbook (7th Edition):

David, Stefan. “Extremal combinatorics and universal algorithms.” 2018. Web. 12 Nov 2019.

Vancouver:

David S. Extremal combinatorics and universal algorithms. [Internet] [Doctoral dissertation]. University of Cambridge; 2018. [cited 2019 Nov 12]. Available from: https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383.

Council of Science Editors:

David S. Extremal combinatorics and universal algorithms. [Doctoral Dissertation]. University of Cambridge; 2018. Available from: https://www.repository.cam.ac.uk/handle/1810/278254 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.753383


Florida International University

22. Cazalis, Daniel S. Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications.

Degree: Computer Science, 2007, Florida International University

  Since the 1950s, the theory of deterministic and nondeterministic finite automata (DFAs and NFAs, respectively) has been a cornerstone of theoretical computer science. In… (more)

Subjects/Keywords: theory of computation; finite-state automata

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cazalis, D. S. (2007). Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications. (Thesis). Florida International University. Retrieved from http://digitalcommons.fiu.edu/etd/8 ; 10.25148/etd.FI08081507 ; FI08081507

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

Chicago Manual of Style (16th Edition):

Cazalis, Daniel S. “Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications.” 2007. Thesis, Florida International University. Accessed November 12, 2019. http://digitalcommons.fiu.edu/etd/8 ; 10.25148/etd.FI08081507 ; FI08081507.

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

MLA Handbook (7th Edition):

Cazalis, Daniel S. “Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications.” 2007. Web. 12 Nov 2019.

Vancouver:

Cazalis DS. Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications. [Internet] [Thesis]. Florida International University; 2007. [cited 2019 Nov 12]. Available from: http://digitalcommons.fiu.edu/etd/8 ; 10.25148/etd.FI08081507 ; FI08081507.

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

Council of Science Editors:

Cazalis DS. Algebraic Theory of Minimal Nondeterministic Finite Automata with Applications. [Thesis]. Florida International University; 2007. Available from: http://digitalcommons.fiu.edu/etd/8 ; 10.25148/etd.FI08081507 ; FI08081507

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


Texas A&M University

23. Kogan, Roman Leonidovich. Measures Induced by Automata and Their Actions.

Degree: PhD, Mathematics, 2017, Texas A&M University

 In this thesis we explore the theme of automata, measures on spaces of sequences X^N in a finite alphabet X, and their connections. The notion… (more)

Subjects/Keywords: automata; measures; finite-state; group theory; Markov measures; sofic measures; Gibbs measures; images of measures

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kogan, R. L. (2017). Measures Induced by Automata and Their Actions. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/169621

Chicago Manual of Style (16th Edition):

Kogan, Roman Leonidovich. “Measures Induced by Automata and Their Actions.” 2017. Doctoral Dissertation, Texas A&M University. Accessed November 12, 2019. http://hdl.handle.net/1969.1/169621.

MLA Handbook (7th Edition):

Kogan, Roman Leonidovich. “Measures Induced by Automata and Their Actions.” 2017. Web. 12 Nov 2019.

Vancouver:

Kogan RL. Measures Induced by Automata and Their Actions. [Internet] [Doctoral dissertation]. Texas A&M University; 2017. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/1969.1/169621.

Council of Science Editors:

Kogan RL. Measures Induced by Automata and Their Actions. [Doctoral Dissertation]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/169621

24. MOLDAGALIYEV BIRZHAN. A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA.

Degree: 2018, National University of Singapore

Subjects/Keywords: Algorithmic Randomness; Automatic Structures; Automata Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

BIRZHAN, M. (2018). A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA. (Thesis). National University of Singapore. Retrieved from http://scholarbank.nus.edu.sg/handle/10635/147847

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

Chicago Manual of Style (16th Edition):

BIRZHAN, MOLDAGALIYEV. “A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA.” 2018. Thesis, National University of Singapore. Accessed November 12, 2019. http://scholarbank.nus.edu.sg/handle/10635/147847.

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

MLA Handbook (7th Edition):

BIRZHAN, MOLDAGALIYEV. “A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA.” 2018. Web. 12 Nov 2019.

Vancouver:

BIRZHAN M. A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA. [Internet] [Thesis]. National University of Singapore; 2018. [cited 2019 Nov 12]. Available from: http://scholarbank.nus.edu.sg/handle/10635/147847.

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

Council of Science Editors:

BIRZHAN M. A STUDY OF RANDOMNESS AND GROUPS USING FINITE AUTOMATA. [Thesis]. National University of Singapore; 2018. Available from: http://scholarbank.nus.edu.sg/handle/10635/147847

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


Brno University of Technology

25. Křehlík, Štěpán. Strukturované multisystémy a multiautomaty indukované časovými procesy .

Degree: 2015, Brno University of Technology

 V disertační práci diskutujeme binární hyperstruktury obecných lineárních diferenciálních operátorů druhého řádů a speciálně operátorů Jacobiho tvaru. Tyto operátory jsou motivovány modely specifických časových procesů.… (more)

Subjects/Keywords: Kartézská kompozice kvazi – automatů; Zobecnění kvazi – automatů; Heterogenní produkt kvazi-automatů; Homogenní produkt kvazi-automatů; Hypergrupy; Teorie hyperstruktur a automatů; Lineární diferenciální operátory; Modelovací funkce; Spojnicový prostor; Kvazi-multiautomaty.; Cartesian composition of quasi – automata; Generalization of quasi – automata; Heterogeneous product of quasi – automata; Homogeneous product of quasi – automata; Hypergroups; Hyperstructure theory and automata; Join space; Linear differential operators; Modelling function Quasi – multiautomata.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Křehlík, . (2015). Strukturované multisystémy a multiautomaty indukované časovými procesy . (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/51598

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

Chicago Manual of Style (16th Edition):

Křehlík, Štěpán. “Strukturované multisystémy a multiautomaty indukované časovými procesy .” 2015. Thesis, Brno University of Technology. Accessed November 12, 2019. http://hdl.handle.net/11012/51598.

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

MLA Handbook (7th Edition):

Křehlík, Štěpán. “Strukturované multisystémy a multiautomaty indukované časovými procesy .” 2015. Web. 12 Nov 2019.

Vancouver:

Křehlík . Strukturované multisystémy a multiautomaty indukované časovými procesy . [Internet] [Thesis]. Brno University of Technology; 2015. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/11012/51598.

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

Council of Science Editors:

Křehlík . Strukturované multisystémy a multiautomaty indukované časovými procesy . [Thesis]. Brno University of Technology; 2015. Available from: http://hdl.handle.net/11012/51598

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

26. Giannakis, Konstantinos. Infinite and standard computation with unconventional and quantum methods using automata.

Degree: 2016, Ionian University; Ιόνιο Πανεπιστήμιο

The work described in this dissertation falls into the field of the Theoretical Computer Science. It mainly concerns the use of “Unconventional” methods of computing,… (more)

Subjects/Keywords: Θεωρία υπολογισμού; Μη συμβατικός υπολογισμός; Κβαντικός υπολογισμός; Θεωρία αυτομάτων; Theory of computation; Unconventional computation; Quantum computation; Automata theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Giannakis, K. (2016). Infinite and standard computation with unconventional and quantum methods using automata. (Thesis). Ionian University; Ιόνιο Πανεπιστήμιο. Retrieved from http://hdl.handle.net/10442/hedi/38648

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

Chicago Manual of Style (16th Edition):

Giannakis, Konstantinos. “Infinite and standard computation with unconventional and quantum methods using automata.” 2016. Thesis, Ionian University; Ιόνιο Πανεπιστήμιο. Accessed November 12, 2019. http://hdl.handle.net/10442/hedi/38648.

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

MLA Handbook (7th Edition):

Giannakis, Konstantinos. “Infinite and standard computation with unconventional and quantum methods using automata.” 2016. Web. 12 Nov 2019.

Vancouver:

Giannakis K. Infinite and standard computation with unconventional and quantum methods using automata. [Internet] [Thesis]. Ionian University; Ιόνιο Πανεπιστήμιο; 2016. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10442/hedi/38648.

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

Council of Science Editors:

Giannakis K. Infinite and standard computation with unconventional and quantum methods using automata. [Thesis]. Ionian University; Ιόνιο Πανεπιστήμιο; 2016. Available from: http://hdl.handle.net/10442/hedi/38648

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


University of Waterloo

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

Degree: 2010, University of Waterloo

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

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

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

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

Chicago Manual of Style (16th Edition):

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

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

MLA Handbook (7th Edition):

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

Vancouver:

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

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

Council of Science Editors:

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

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


AUT University

28. Chan, Su Yuan. Assessing Core Stable Coalitions Based On Social Network Structures .

Degree: AUT University

 Game theoretic techniques have become deliberate with social network analysis. Studies show that contemporary approach on social network analysis is unable to collectively evaluate the… (more)

Subjects/Keywords: Coalitional Game Theory; Social Networks; Automata Theory; Network games

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chan, S. Y. (n.d.). Assessing Core Stable Coalitions Based On Social Network Structures . (Thesis). AUT University. Retrieved from http://hdl.handle.net/10292/10637

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

Chicago Manual of Style (16th Edition):

Chan, Su Yuan. “Assessing Core Stable Coalitions Based On Social Network Structures .” Thesis, AUT University. Accessed November 12, 2019. http://hdl.handle.net/10292/10637.

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

MLA Handbook (7th Edition):

Chan, Su Yuan. “Assessing Core Stable Coalitions Based On Social Network Structures .” Web. 12 Nov 2019.

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

Vancouver:

Chan SY. Assessing Core Stable Coalitions Based On Social Network Structures . [Internet] [Thesis]. AUT University; [cited 2019 Nov 12]. Available from: http://hdl.handle.net/10292/10637.

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

Council of Science Editors:

Chan SY. Assessing Core Stable Coalitions Based On Social Network Structures . [Thesis]. AUT University; Available from: http://hdl.handle.net/10292/10637

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


University of Debrecen

29. Kántor, Kristóf Szilveszter. Generalized P colony automata, a nature motivated computational model based on multiset processing .

Degree: DE – Informatikai Kar, 2014, University of Debrecen

 Nature-inspired models have recently gained momentum in composing, coordinating and adapting the “Internet of Services”, where a myriad of services and users are interacting autonomously,… (more)

Subjects/Keywords: nature motivated; automata theory; formal languages; P colony automata; membrane systems; membrán rendszerek; formális nyelvek és automaták; természet motiválta számítási modellek; chemical paradigm; kémiai paradigma

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kántor, K. S. (2014). Generalized P colony automata, a nature motivated computational model based on multiset processing . (Thesis). University of Debrecen. Retrieved from http://hdl.handle.net/2437/188731

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

Chicago Manual of Style (16th Edition):

Kántor, Kristóf Szilveszter. “Generalized P colony automata, a nature motivated computational model based on multiset processing .” 2014. Thesis, University of Debrecen. Accessed November 12, 2019. http://hdl.handle.net/2437/188731.

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

MLA Handbook (7th Edition):

Kántor, Kristóf Szilveszter. “Generalized P colony automata, a nature motivated computational model based on multiset processing .” 2014. Web. 12 Nov 2019.

Vancouver:

Kántor KS. Generalized P colony automata, a nature motivated computational model based on multiset processing . [Internet] [Thesis]. University of Debrecen; 2014. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/2437/188731.

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

Council of Science Editors:

Kántor KS. Generalized P colony automata, a nature motivated computational model based on multiset processing . [Thesis]. University of Debrecen; 2014. Available from: http://hdl.handle.net/2437/188731

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


Indian Institute of Science

30. Thakur, Aditya. Comprehensive Path-sensitive Data-flow Analysis.

Degree: 2008, Indian Institute of Science

 Data-flow analysis is an integral part of any aggressive optimizing compiler. We propose a framework for improving the precision of data-flow analysis in the presence… (more)

Subjects/Keywords: Compilers; Data-flow Analysis; Control-flow Graphs; Automata Theory; Destructive Merge; Scale Compiler; Split Approach; Complex Control-flow; Computer Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Thakur, A. (2008). Comprehensive Path-sensitive Data-flow Analysis. (Thesis). Indian Institute of Science. Retrieved from http://hdl.handle.net/2005/836

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

Chicago Manual of Style (16th Edition):

Thakur, Aditya. “Comprehensive Path-sensitive Data-flow Analysis.” 2008. Thesis, Indian Institute of Science. Accessed November 12, 2019. http://hdl.handle.net/2005/836.

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

MLA Handbook (7th Edition):

Thakur, Aditya. “Comprehensive Path-sensitive Data-flow Analysis.” 2008. Web. 12 Nov 2019.

Vancouver:

Thakur A. Comprehensive Path-sensitive Data-flow Analysis. [Internet] [Thesis]. Indian Institute of Science; 2008. [cited 2019 Nov 12]. Available from: http://hdl.handle.net/2005/836.

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

Council of Science Editors:

Thakur A. Comprehensive Path-sensitive Data-flow Analysis. [Thesis]. Indian Institute of Science; 2008. Available from: http://hdl.handle.net/2005/836

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

[1] [2] [3]

.