Dissertations / Theses on the topic 'Monoid'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Monoid.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Render, Elaine. "Rational monoid and semigroup automata." Thesis, University of Manchester, 2010. https://www.research.manchester.ac.uk/portal/en/theses/rational-monoid-and-semigroup-automata(0aff0c17-b6f9-4bc8-95d1-ff98da059d42).html.
Full textCevik, Ahmet Sinan. "Minimality of group and monoid presentations." Thesis, University of Glasgow, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.284692.
Full textSalt, Brittney M. "MONOID RINGS AND STRONGLY TWO-GENERATED IDEALS." CSUSB ScholarWorks, 2014. https://scholarworks.lib.csusb.edu/etd/31.
Full textLima, Lucinda Maria de Carvalho. "The local automorphism monoid of an independence algebra." Thesis, University of York, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358341.
Full textCatarino, Paula Maria Machado Cruz. "The monoid of orientation-preserving mappings on a chain." Thesis, University of Essex, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.266839.
Full textOltmanns, Helga. "Homological classification of monoids by projectivities of right acts." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=960378634.
Full textRamasu, Pako. "Internal monoid actions in a cartesian closed category and higher-dimensional group automorphisms." Doctoral thesis, University of Cape Town, 2015. http://hdl.handle.net/11427/20248.
Full textDuchamp, Gérard. "Algorithmes sur les polynomes en variables non commutatives." Paris 7, 1987. http://www.theses.fr/1987PA077069.
Full textEast, James Phillip Hinton. "On Monoids Related to Braid Groups and Transformation Semigroups." School of Mathematics and Statistics, 2006. http://hdl.handle.net/2123/2438.
Full textEast, James Phillip Hinton. "On Monoids Related to Braid Groups and Transformation Semigroups." Thesis, The University of Sydney, 2005. http://hdl.handle.net/2123/2438.
Full textTesson, Emilie. "Un hybride du groupe de Thompson F et du groupe de tresses B°°." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMC212/document.
Full textWe study a certain monoid specified by a presentation, denoted P, that is a hybrid of the classical presentation of the infinite braid monoid and of the presentation of Thompson’s monoid. To this end, we use several approaches. First, we describe a convergent rewrite system for P, which provides in particular a solution to the word problem, and makes the hybrid monoid reminiscent of Thompson’s monoid. Next, on the shape of the braid monoid, we use the factor reversing method to analyze the divisibility relation, and show in particular that the hybrid monoid admits cancellation and conditional right lcms. Then, we study Garside combinatorics of the hybrid: for every integer n, we introduce an element ∆(n) as the right lcm of the first (n−1) atoms, and one investigates the left divisors of the elements ∆(n), called simple elements. The main results are a counting of the left divisors of ∆(n) and a characterization of the normal forms of simple elements. We conclude with the construction of several representations of the hybrid monoid in various monoids, in particular a representation in a monoid of matrices whose entries are Laurent polynomials, which we conjecture could be faithful
Lohrey, Markus. "Computational and logical aspects of infinite monoids." [S.l. : s.n.], 2003. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB10720633.
Full textBertol, Michael W. "Effiziente Normalform-Algorithmen für Ersetzungssysteme über frei partiell kommutativen Monoiden." [S.l. : s.n.], 1996. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB5222391.
Full textKufleitner, Manfred. "Logical fragments for Mazurkiewicz traces expressive power and algebraic characterizations /." [S.l. : s.n.], 2006. http://nbn-resolving.de/urn:nbn:de:bsz:93-opus-27812.
Full textBourne, Thomas. "Counting subwords and other results related to the generalised star-height problem for regular languages." Thesis, University of St Andrews, 2017. http://hdl.handle.net/10023/12024.
Full textPerez, Gavilan Torres Jacinta [Verfasser], Peter [Akademischer Betreuer] Littelmann, and Alexander [Akademischer Betreuer] Alldridge. "The symplectic plactic monoid, words, MV cycles, and non-Levi branchings / Jacinta Perez Gavilan Torres. Gutachter: Peter Littelmann ; Alexander Alldridge." Köln : Universitäts- und Stadtbibliothek Köln, 2015. http://d-nb.info/1082030481/34.
Full textOwusu-Mensah, Isaac. "Algebraic Structures on the Set of all Binary Operations over a Fixed Set." Ohio University / OhioLINK, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1584490788584639.
Full textPerone, Marco. "Direct sum decompositions and weak Krull-Schmidt Theorems." Doctoral thesis, Università degli studi di Padova, 2011. http://hdl.handle.net/11577/3427427.
Full textIn questa tesi discutiamo il comportamento della decomposizione in somma diretta in categorie additive e in particolare in categorie di moduli. Nella prima parte della tesi, investighiamo le proprietà degli anelli che giocano un ruolo prominente nella teoria della fattorizzazione nelle categorie additive, come per esempio la proprietà di scambio, la semilocalità e la dimensione di Goldie. Vogliamo sottolineare l'importanza di quest'ultima e investighiamo con attenzione il caso infinito della dimensione duale di Goldie di un anello. Nel resto della tesi, utilizziamo un approccio più categoriale, studiando il comportamento della decomposizione in somma diretta nelle categorie additive. Data una categoria additiva C, il suo scheletro V(C) ha la struttura di un monoide commutativo rispetto all'operazione di somma diretta, e tutte le informazioni riguardo la regolarità della decomposizione in somma diretta nella categoria C sono rintracciabili attraverso il monoide V(C). Studiamo classi di categorie in cui la decomposizione in somma diretta assume un comportamento abbastanza regolare; principalemente ci restringiamo a categorie C il cui monoide V(C) è un monoide di Krull, evidenziando il ruolo prominente occupato da parte degli anelli degli endomorfismi semilocali. Analizziamo il comportamento peculiare della decomposizione in somma diretta in alcune categorie di moduli, dove l'unicità della decomposizione è garantita a meno di due permutazioni, e notiamo come questo fenomeno sia dovuto alla presenza di anelli degli endomorfismi di tipo due. Nell'ultimo capitolo investighiamo cosa succede quando passiamo da somme dirette finite di oggetti indecomponibili a somme dirette infinite, e sviluppiamo l'ambiente in cui i fenomeni studiati precedentemente nel caso finito si manifestano, sia ad un livello di teoria dei monodi sia ad un livello categoriale.
Marseglia, Stefano. "Isomorphism classes of abelian varieties over finite fields." Licentiate thesis, Stockholms universitet, Matematiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-130316.
Full textKuber, Amit Shekhar. "K-theory of theories of modules and algebraic varieties." Thesis, University of Manchester, 2014. https://www.research.manchester.ac.uk/portal/en/theses/ktheory-of-theories-of-modules-and-algebraic-varieties(5d4387d5-df36-455a-a09d-922d67b0827e).html.
Full textCalladine, Pierre. "Equations et systèmes de réécritures dans le monoïde libre : une approche commune." Poitiers, 1989. http://www.theses.fr/1989POIT2254.
Full textKrob, Daniel. "Expressions k-rationnelles." Paris 7, 1988. http://www.theses.fr/1988PA077088.
Full textABBADINI, MARCO. "ON THE AXIOMATISABILITY OF THE DUAL OF COMPACT ORDERED SPACES." Doctoral thesis, Università degli Studi di Milano, 2021. http://hdl.handle.net/2434/812809.
Full textPowell, Mark Andrew. "Second order algebraic knot concordance group." Thesis, University of Edinburgh, 2011. http://hdl.handle.net/1842/5030.
Full textWilding, David. "Linear algebra over semirings." Thesis, University of Manchester, 2015. https://www.research.manchester.ac.uk/portal/en/theses/linear-algebra-over-semirings(1dfe7143-9341-4dd1-a0d1-ab976628442d).html.
Full textGolchin, Akbar. "Homological classification of monoids." Thesis, University of Southampton, 1997. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243655.
Full textRannou, Pierre. "Réécriture de diagrammes et de Sigma-diagrammes." Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM4063.
Full textThe main subject of this thesis is diagram rewriting.This is a generalisation to dimension~$2$ of word rewriting (in dimension~$1$). In a first time, we give the first convergent diagrammatic presentation of the PRO of linear maps in arbitrary field. Then we study the convergent diagrammatic presentation of matrix of isometries of $RR^n$. We focus especially on a rule similar to the Yang-Baxter equation, described by a certain map $h$. We use the confluence of criticalthe parametric diagrams, To study the algebraic properties of $h$, Finally, we present the $Sigma$-diagrams, an alternative approach for calculation in bialgebras. We illustrate this approach with examples. The last two chapters have been already published: Diagram rewriting for orthogonal matrices: a study of critical peaks, avec Yves Lafont, Lecture Notes in Computer Science 5117, p. 232-245, 2008 Properties of co-operations: diagrammatic proofs, Mathematical Structures in Computer Science 22(6), p. 970-986, 2012
Gohon, Philippe. "Automates avec coût et reconnaissabilité dans les monoïdes libres commutatifs." Rouen, 1986. http://www.theses.fr/1986ROUES009.
Full textPecuchet, Jean-Pierre. "Automates boustrophédons : langages reconnaissables de mots infinis et variétés de semigroupes." Rouen, 1986. http://www.theses.fr/1986ROUES005.
Full textBeaudry, Martin. "Membership testing in transformation monoids." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75773.
Full textThe problem which consists in characterizing an idempotent monoid is also addressed: given a set of transformations, it can be decided in NC$ sp2$ whether the monoid they generate is idempotent. Similar tests are given for three subclasses of idempotent monoids: R$ sb1$, L$ sb1$, and N$ sb3$; in all three cases, the complexity is NC$ sp1$.
A sequential upper bound is also given for each of the parallel complexities given above.
Hindlycke, Christoffer. "Irreducible representations of finite monoids." Thesis, Uppsala universitet, Algebra och geometri, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-380588.
Full textJones, David G. "Polycyclic monoids and their generalisations." Thesis, Heriot-Watt University, 2011. http://hdl.handle.net/10399/2473.
Full textBailey, Alexander. "Covers of acts over monoids." Thesis, University of Southampton, 2013. https://eprints.soton.ac.uk/363273/.
Full textWannenburg, Johann Joubert. "Varieties of De Morgan Monoids." Thesis, University of Pretoria, 2020. http://hdl.handle.net/2263/75178.
Full textThesis (PhD)--University of Pretoria, 2020.
DST-NRF Centre of Excellence in Mathematical and Statistical Sciences (CoE-MaSS)
Mathematics and Applied Mathematics
PhD
Unrestricted
Burns, Brenda D. "The Staircase Decomposition for Reductive Monoids." NCSU, 2002. http://www.lib.ncsu.edu/theses/available/etd-20020422-102254.
Full textBurns, Brenda Darlene. The Staircase Decomposition for Reductive Monoids. (Under the direction of Mohan Putcha.) The purpose of the research has been to develop a decomposition for the J-classes of a reductive monoid. The reductive monoid M(K) isconsidered first. A J-class in M(K) consists ofelements of the same rank. Lower and upper staircase matricesare defined and used to decompose a matrix x of rank r into theproduct of a lower staircase matrix, a matrix with a rank rpermutation matrix in the upper left hand corner, and an upperstaircase matrix, each of which is of rank r. The choice ofpermutation matrix is shown to be unique. The primary submatrix of a matrixis defined. The unique permutation matrix from the decompositionabove is seen to be the unique permutation matrix from Bruhat'sdecomposition for the primary submatrix. All idempotent elementsand regular J-classes of the lower and upper staircasematrices are determined. A decomposition for the upper and lowerstaircase matrices is given as well.The above results are then generalized to an arbitrary reductivemonoid by first determining the analogue of the components forthe decomposition above. Then the decomposition above is shown tobe valid for each J-class of a reductive monoid. Theanalogues of the upper and lower staircase matrices are shown tobe semigroups and all idempotent elements and regularJ-classes are determined. A decomposition for eachof them is discussed.
Williamson, Helen. "Immersions of complexes and inverse monoids." Thesis, University of York, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.261082.
Full textHollings, Christopher David. "Partial actions of semigroups and monoids." Thesis, University of York, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.440689.
Full textCutting, Andrew. "Todd-Coxeter methods for inverse monoids." Thesis, University of St Andrews, 2001. http://hdl.handle.net/10023/15052.
Full textRamos, Sandra Isabel Diogo. "O monoide bicíclico: subsemigrupos e generalizações." Master's thesis, Universidade de Aveiro, 2008. http://hdl.handle.net/10773/2904.
Full textEsta dissertação consiste num trabalho de recolha bibliográfica e síntese sobre o monoide bicíclico, B, propriedades, subsemigrupos, e generalizações. Iniciase o trabalho com uma breve introdução à teoria de semigrupos em geral, com ênfase para os conceitos necessários aos restantes capítulos. Definimos monoide bicíclico e apresentamos algumas propriedades notáveis do mesmo, fazemos a descrição de todos os subsemigrupos de B, que utilizamos para estabelecer diversas propriedades destes subsemigrupos. Estudamos apenas em detalhe uma generalização e referimos outras. Foram incluídos resultados recentes, nomeadamente sobre os subsemigrupos de B.
This thesis consists of a work of bibliographical selection and synthesis around the bicyclic monoid, B, its properties, subsemigroups, and generalizations. The thesis begins with a brief introduction to the theory of semigroups with emphasis to the required concepts for the remaining chapters. We define the bicyclic monoid and present some of its notable properties. Then we present the description of all the subsemigroups of B, which we use to establish several properties of these subsemigroups. We study one generalization in detail and we briefly refer other generalizations. This work includes some recent results, particularly on subsemigroups of B.
Duboc, Christine. "Commutations dans les monoïdes libres : un cadre théorique pour l'étude du parallélisme." Rouen, 1986. http://www.theses.fr/1986ROUES003.
Full textLi, Zhuo. "Orbit structure of finite and reductive monoids." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21301.pdf.
Full textSmith, Eric R. "Right congruences on inverse Bruck-Reilly monoids." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21316.pdf.
Full textArauÌjo, João Jorge Ribeiro Soares Gonçalves de. "Aspects of endomorphism monoids of independence algebras." Thesis, University of York, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.274496.
Full textHage, Nohra. "Study of plactic monoids by rewriting methods." Thesis, Lyon, 2016. http://www.theses.fr/2016LYSES065/document.
Full textThis thesis focuses on the study of plactic monoids by a new approach using methods issued from rewriting theory. These methods are applied on presentations of plactic monoids given in terms of Young tableaux, Kashiwara’s crystal bases and Littelmann path model. We study the syzygy problem for the Knuth presentation of the plactic monoids. Using the homotopical completion procedure that extends Squier’s and Knuth–Bendix’s completions procedure, we construct coherent presentations of plactic monoids of type A. Such a coherent presentation extends the notion of a presentation of a monoid by a family of generating syzygies, taking into account all the relations among the relations. We make explicit a finite coherent presentation of plactic monoids of type A with the column generators. However, this presentation is not minimal in the sense that many of its generators are superfluous. After applying the homotopical reduction procedure on this presentation, we reduce it to a finite coherent one that extends the Knuth presentation, giving then all the syzygies of the Knuth relations. More generally, we deal with presentations of plactic monoids of any type from the rewriting theory perspective. We construct finite convergent presentations for these monoids in a general way using Littelmann paths. Moreover, we study the latter presentations in terms of Kashiwara’s crystal graphs for type C. By introducing the admissible column generators, we obtain a finite convergent presentation of the plactic monoid of type C with explicit relations. This approach should allow us to study the syzygy problem for the presentations of plactic monoids for any type
Pasku, Elton. "Finiteness conditions for monoids and small categories." Thesis, University of Glasgow, 2006. http://theses.gla.ac.uk/6171/.
Full textRozoy, Brigitte. "Un modele de parallelisme : le monoide distribue." Caen, 1987. http://www.theses.fr/1987CAEN2039.
Full textGrosshans, Nathan. "The limits of Nečiporuk's method and the power of programs over monoids taken from small varieties of finite monoids." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLN028/document.
Full textThis thesis deals with lower bounds for complexity measures related to subclasses of the class P of languages that can be decided by Turing machines in polynomial time. We consider non-uniform computational models like programs over monoids and branching programs.Our first contribution is an abstract, measure-independent treatment of Nečiporuk's method for proving lower bounds. This method still gives the best lower bounds known on measures such as the size of deterministic and non-deterministic branching programs or formulae{} with arbitrary binary Boolean operators; we give an abstract formulation of the method and use this framework to prove limits on the best lower bounds obtainable using this method for several complexity measures. We thereby confirm previously known limitation results in this slightly more general framework and showcase new limitation results for complexity measures to which Nečiporuk's method had never been applied.Our second contribution is a better understanding of the computational power of programs over monoids taken from small varieties of finite monoids. Programs over monoids were introduced in the late 1980s by Barrington and Thérien as a way to generalise recognition by morphisms so as to obtain a finite-semigroup-theoretic characterisation of NC^1 and its subclasses. Given a variety V of finite monoids, one considers the class P(V) of languages recognised by a sequence of polynomial-length programs over a monoid from V: as V ranges over all varieties of finite monoids, one obtains different subclasses of NC^1, for instance AC^0, ACC^0 and NC^1 when V respectively is the variety of all finite aperiodic, finite solvable and finite monoids. We introduce a new notion of tameness for varieties of finite monoids, strengthening a notion of Péladeau. The main interest of this notion is that when a variety V of finite monoids is tame, we have that P(V) does only contain regular languages that are quasi morphism-recognised by monoids from V. Many open questions about the internal structure of NC^1 would be settled by showing that some appropriate variety of finite monoids is tame, and, in this thesis, we modestly start an exhaustive study of which varieties of finite monoids are tame. More precisely, we focus on two well-known small varieties of finite aperiodic monoids: DA and J. On the one hand, we show that DA is tame using finite-semigroup-theoretic arguments. This allows us to derive an exact algebraic characterisation of the class of regular languages in P(DA). On the other hand, we show that J is not tame. To do this, we present a trick by which programs over monoids from J can recognise much more regular languages than only those that are quasi morphism-recognised by monoids from J. This brings us to conjecture an exact algebraic characterisation of the class of regular languages in P(J), and we lay out some partial results that support this conjecture. For each of the varieties DA and J, we also exhibit a program-length-based hierarchy within the class of languages recognised by programs over monoids from the variety, refining Tesson and Thérien's results on the polynomial-length property for monoids from those varieties
Pirashvili, Ilia. "The fundamental groupoid and the geometry of monoids." Thesis, University of Leicester, 2016. http://hdl.handle.net/2381/37837.
Full textSimmons, Christopher Paul. "Small category theory applied to semigroups and monoids." Thesis, University of York, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.249334.
Full textTunsi, Laila. "Ample monoids and the theory of small categories." Thesis, University of York, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423599.
Full text