Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 67 for “"The Word Problem"”.
-
Hyperbolic Groups And The Word Problem
Mikhail Gromov’s work on hyperbolic groups in the late 1980s contributed to the formation of geometric group theory as a distinct branch of mathematics. The creation of hyperbolic metric spaces showed it was possible to define a large class of hyperbolic groups entirely geometrically yet still be …
-
The word problem and the ideal membership problem
This dissertation concerns two problems from computational algebra, the word problem for semigroups and the ideal membership problem for noncommutative polynomial rings. Historically, the word problem provided one of the first examples of an algorithmically unsolvable problem from outside of logic …
-
The word problem for finitely presented special inverse monoids
In this thesis we investigate the decidability of the word problem for finitely presented special inverse monoids via the prefix membership problem of their maximal group images. The work can be divided into two tranches which use distinct methods. In the first tranche we approach the problem via a …
-
Groups of Non Positive Curvature and The Word Problem
… a natural question, known as the word problem, is how does one decide whether or not two words in the free group, $F(\scr{\scr{A}})$, represent the same element in $\Gamma$. In this thesis, we study certain aspects of geometric group theory, especially ideas published by Gromov …
-
The word problem and combinatorial methods for groups and semigroups
The subject matter of this thesis is combinatorial semigroup theory. It includes material, in no particular order, from combinatorial and geometric group theory, formal language theory, theoretical computer science, the history of mathematics, formal logic, model theory, graph theory, and …
-
The Word Problem for the Automorphism Groups of Right-Angled Artin Groups is in P
… right-angled Artin group G and determines whether or not f is the identity automorphism, thereby solving the word problem for the automorphism groups of right-angled Artin groups. We do this by solving the compressed word problem for right-angled Artin groups, a more general result. A key …
-
An Historical and Comparative Study Concerned With the Unsolvability of the Word Problem for Groups
Made available in DSpace on 2014-12-10T18:44:38Z (GMT). No. of bitstreams: 1 7114952.pdf: 7305750 bytes, checksum: 55a4c1b121b49ff3abe23154ef94fb33 (MD5) Previous issue date: 1970
-
Effects of a Mathematics Graphic Organizer and Virtual Video Modeling on the Word Problem Solving Abilities of Students with Disabilities
Over the last decade, the inclusion of students with disabilities (SWD) in the general education classroom has increased. Currently, 60% of SWD spend 80% or more of their school day in the general education classroom (U.S. Department of Education, 2013). This includes students with autism spectrum …
-
Improving the word problem solving abilities of students with disabilities: Cognitive Strategy Instruction (CSI) compared to Schema-Based Instruction (SBI)
The purpose of this research was to compare Cognitive Strategy Instruction (CSI) and Schema-Based Instruction (SBI) and determine which is more effective at improving the mathematical word problem solving abilities of eighth grade students with disabilities. Two students with disabilities who were …
-
The Word Problem Factor: Assessing the Ability of Utah High School Career and Technical Education Students to Do the Math Involved in Formulating and Calculating Energy Cost Factors
Much research has been done showing the difficulty people have with word problems. This has been shown to be true for many types of word problems and for different demographics. Questions have remained unanswered regarding the reasons for this difficulty. It has been unclear if the word problems …
-
The Dehn function, word problem, and bounded word problem for finitely generated decidable group presentations
For finite group presentations, the word problem is solvable if and only if the Dehn function is computable. Additionally, the bounded word problem is always solvable. For finitely generated decidable group presentations, this is not always the case. The main result of the present work is to …
-
Van Kampen Diagrams and Small Cancellation Theory
Given a presentation of G, the word problem asks whether there exists an algorithm to determine which words in the free group, F(A), represent the identity in G. In this thesis, we study small cancellation theory, developed by Lyndon, Schupp, and Greendlinger in the mid-1960s, which contributed to …
-
Combinatorial aspects of braids with applications to cryptography
This thesis is a collection of different results on braids, and draws connections between them. We first introduce braids by showcasing a number of equivalent ways of describing what a braid is, and how those representations are related. Then, while uncovering enumerative properties of the positive …
-
The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words
<p>This thesis concerns itself with drawing out some interesting connections between the fields of group theory and formal language theory. Given a group with a finite set of generators, it is natural to consider the set of generators and their inverses as an alphabet. We can then consider formal …
-
Effective Computations of Automatic Structures for HNN Extensions
For a finitely presented group, the word problem asks if there is an algorithm which can always determine if a word over a generating set of the group represents the identity of the group. Boone and Novikov independently showed there exist finitely presented groups which do not have solvable word …
-
Applications of automata theory to presentations of monoids and inverse monoids
There is a strong connection between monoids, automata and languages. The traditional approach is to exploit properties of the syntactic monoid of an automaton to derive characteristics of the language recognized by the automaton. In this work we construct certain automata and exploit the …
-
Orthomodular Lattices and Cut Elimination
The thesis is a start toward a positive solution of the word problem for freely generated orthomodular lattices. It was a proof theoretical 'partial' cut elimination procedure.
-
Closure and homological properties of (auto)stackable groups
… graph Γ. Roughly, G is a stackable group if there is a maximal tree T in Γ and a function &phis;, defined on the edges in Γ, for which there is a natural 'flow' on the edges in Γ\T towards the identity. Additionally, if graph(&phis;), which consists of pairs (e, &phis;(e)) for e an edge in Γ, …
-
Prefix-Rewriting: the Falsification by Fellow Traveler Property and Practical Computation
The word problem is one of the fundamental areas of research in infinite group theory, and rewriting systems (including finite convergent rewriting systems, automatic structures, and autostackable structures) are key approaches to working on the word problem. In this dissertation, we discuss two …
-
Efficient algorithms in Coxeter groups of large type
We establish a quadratic time algorithm for the word problem and a cubic time algorithm for the conjugacy problem for Coxeter groups of large type. We also give conditions on the relators of a large-type Coxeter group that are necessary and sufficient for the group to be hyperbolic, and we give a …
Page 1 of 4