Word problem for groups
Groups with context free co word problem
... co-context-free groups is ...co- word problem (the complement of its word problem) is ...context-free groups, being closed under the taking of finite direct products, restricted ...
16
Groups and semigroups with a one counter word problem
... the word problem of a semigroup lying in a class F of ...with groups, if F is closed under inverse homomorphism, then membership of the word problem in F is independent of the choice of ...
14
The generalised word problem in hyperbolic and relatively hyperbolic groups
... abelian groups and not, for example, to all virtually nilpotent groups, our proof cannot be extended to parabolics beyond those that are virtually ...hyperbolic groups with generalised word ...
24
Groups with poly context free word problem
... context-free groups proved much more difficult to characterise than the groups with regular word problem, and it was not until the 1980s that a characterisation was ...context-free ...
120
The word problem in Hanoi Towers groups
... this is an asymptotically optimal solution (see more precise estimates in [6, 9]). Note that if we express the height of the tower k in terms of the length n of an optimal solution, we get k = O(log m−2 n). I do not see ...
8
The word problem for Pride groups
... such groups have solvable word ...Artin groups of FC type have solvable word problem. Artin groups of FC type can be characterized as the small- est class of Artin groups ...
20
Groups With Two Generators Having Unsolvable Word Problem And Presentations of Mihailova Subgroups
... Novikov [35] and Boone [4] independently proved that there is a finitely presented group having un- solvable word problem. In 1969, Borisov [6] gave an elegant simplification on Boone’s approach. Then in ...
13
Groups whose word problems are not semilinear
... the word problem of ℤ n is MCF for all ...the word problem of a group is in a cone, then the word problems for finite index supergroups are in the same ...abelian groups have MCF ...
11
On real time word problems
... input word at constant ...free groups have 1-tape real-time word prob- ...abelian, groups have 1-tape real-time word problem, so the class of groups with context-free ...
14
Solving the word problem in real time
... in groups G for which an algorithm can be found which solves the word problem for X on a real-time Turing ...real-time word problem over ...input word, which is written from left ...
18
Addressing the Rare Word Problem in Neural Machine Translation
... into groups where the sentences within each group have a comparable number of rare words and evaluate each group ...Rare word translation is challenging for neural machine translation systems as shown in ...
9
Presentations and word problem for strong semilattices of semigroups
... free groups of finite rank, and finite groups has soluble word ...two groups which have soluble word problems has also soluble word ...soluble word problems. Moreover the ...
8
Explanation Generation for a Math Word Problem Solver
... introduced to organize various Explanation Tree nodes into different groups (each of them will correspond to a sentence to be generated). Basically, it first locates the lowest operation node, and then traverses ...
18
On regularity and the word problem for free idempotent generated semigroups
... In his foundational paper [28] Nambooripad made the fundamental observation that the set of idempotents E(S) of an arbitrary semigroup S carries the abstract structure of a so-called biordered set (or regular biordered ...
33
A Secret Sharing Scheme Based on Group Presentations and the Word Problem
... The field of non-commutative group-based cryptography has produced many new cryp- tographic protocols over the last decade or so. We refer an interested reader to [4] or [1] for a survey of developments in this area. ...
8
Vol 16, No 6 (2017)
... Explain-Practice-Assess (EPA) Strategy. As each individual category of word problems is introduced, the approach should be explained in detail as the example problems are being solved. As evidenced-based practice ...
12
Implementation Svm To Solve Multiple Meaning Of Word Problem
... on external factor like context. This context is nothing but paragraph in XML format according to senseval format. Overall accuracy of SVM approach is ( 56.11% ) according to the senseval-3, which is acceptable still ...
5
Partially modelling word reordering as a sequence labelling problem
... reordering word sequences, we adapt the method of Visweswariah et al. (2011) to word sequences - where reordering is modeled as a Travelling Salesperson (TSP) ...consider word sequences, instead of ...
8
Supervised Urdu Word Segmentation Model Based on POS Information
... Nowadays Natural Language Processing plays a vital role in every field of computer science. Human beings are trying to simulate human knowledge by computer system. For this purpose, NLP researchers struggle by ...
9
Subsemigroups of virtually free groups : finite Malcev presentations and testing for freeness
... A Malcev presentation is a particular species of semigroup presentation which can be used to define any semigroup that can be embedded in a group. Spehner [16] shows that every finitely generated subsemigroup of a free ...
10