Search results for "transitive"
showing 10 items of 98 documents
On periodic radical groups in which permutability is a transitive relation
2007
Abstract A group G is said to be a PT - group if permutability is a transitive relation in the set of all subgroups of G . Our purpose in this paper is to study PT -groups in the class of periodic radical groups satisfying min- p for all primes p .
Imprimitive groups highly transitive on blocks
2004
We classify imprimitive groups acting highly transitively on blocks and satisfying conditions common in geometry. They can be realized as suitable subgroups of twisted wreath products.
The Role of Prominence Information in the Real-Time Comprehension of Transitive Constructions: A Cross-Linguistic Approach
2008
Approaches to language processing have traditionally been formulated with reference to general cognitive concepts (e.g. working memory limitations) or have based their representational assumptions on concepts from generative linguistic theory (e.g. structure determines interpretation). Thus, many well-established generalisations about language that have emerged from cross-linguistic/typological research have not as yet had a major influence in shaping ideas about online processing. Here, we examine the viability of using typologically motivated concepts to account for phenomena in online language comprehension. In particular, we focus on the comprehension of simple transitive sentences (i.e…
A Learning-Automata Based Solution for Non-equal Partitioning: Partitions with Common GCD Sizes
2021
The Object Migration Automata (OMA) has been used as a powerful tool to resolve real-life partitioning problems in random Environments. The virgin OMA has also been enhanced by incorporating the latest strategies in Learning Automata (LA), namely the Pursuit and Transitivity phenomena. However, the single major handicap that it possesses is the fact that the number of objects in each partition must be equal. Obviously, one does not always encounter problems with equally-sized groups (When the true underlying problem has non-equally-sized groups, the OMA reports the best equally-sized solution as the recommended partition.). This paper is the pioneering attempt to relax this constraint. It p…
'The sisters did her every imaginable injury': Power and violence in Cinderella
2012
The main aim of this article is to discuss the results achieved after investigating the presence of violence in the Grimm brothers’ <em>Cinderella</em> with the intention of finding out what kind of processes predominate in this tale and whether they can be related to violent actions. The analysis involved firstly, a study of the frequency and concordances of some words belonging to the semantic field ‘violence’, surveying in detail the context in which they appear and secondly, the analysis of transitivity processes. The method proved to be a good strategy to check whether each character’s identity and social position (power) were somehow related to the infliction of violence w…
Theresa May’s Representation of Reality in her Brexit Speeches
2020
This study analyses Theresa May’s three seminal Brexit speeches. These describe the kind of desirable post-Brexit EU-UK relationship that she envisioned, and together constitute a corpus of 18,532 words. The speeches can be considered as landmarks on a timeline that was initially meant to lead to the delivery of Brexit. It is hypothesized that there may be meaningful differences between the speeches, and that these affect the representation of reality. These in turn would have a bearing on May’s discursive self-representation as either an individualized or a collectivized social actor. To account for such representational values, the study draws on Halliday’s Transitivity System (1994), sta…
Periodic Groups Covered by Transitive Subgroups of Finitary Permutations or by Irreducible Subgroups of Finitary Transformations
1999
Let X be either the class of all transitive groups of finitary permutations, or the class of all periodic irreducible finitary linear groups. We show that almost primitive X-groups are countably recognizable, while totally imprimitive X-groups are in general not countably recognizable. In addition we derive a structure theorem for groups all of whose countable subsets are contained in totally imprimitive X-subgroups. It turns out that totally imprimitive p-groups in the class X are countably recognizable.
Querying the Guarded Fragment with Transitivity
2016
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.
On the Power of Tree-Walking Automata
2000
Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we characterize them in terms of transitive closure logic formulas in normal form. It is conjectured by Engelfriet and Hoogeboom that TWAs cannot define all regular tree languages, or equivalently, all of monadic second-order logic. We prove this conjecture for a restricted, but powerful, class of TWAs. In particular, we show that 1-bounded TWAs, that is TWAs that are only allowed to traverse every edge of the input tree at most once in every direction, cannot define all regular languages. We then extend this result to a class …
On the use of relational expressions in the design of efficient algorithms
2005
Relational expressions have finite binary relations as arguments and the operations are composition (·), closure (*), inverse (−1), and union (U). The efficient computation of the relation denoted by a relational expression is considered, and a tight bound is established on the complexity of the algorithm suggested by Hunt, Szymanski and Ullman. The result implies a unified method for deriving efficient algorithms for many problems in parsing. For example, optimal algorithms are derived for strong LL(1) and strong LL(2) parser construction and an efficient polynomialtime algorithm is derived for determining the inessential error entries in an LR(1) parsing table.