Ordering by Divisibility in Abstract Algebras

Cited In (only showing first 100 items - show all)

Stream/block ciphers, difference equations and algebraic attacks
Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
Well quasi-orders, unavoidable sets, and derivation systems
Cayley's and Holland's theorems for idempotent semirings and their applications to residuated lattices
Well-quasi-ordering \(H\)-contraction-free graphs
When excluding one matroid prevents infinite antichains
Wohlquasigeordnete Klassen endlicher Graphen
The complexity of finding SUBSEQ\((A)\)
All normal extensions of S5-squared are finitely axiomatizable
A note on partially ordered tree automata
Graph minors and parameterized algorithm design
On upper and lower bounds on the length of alternating towers
Noetherianity and Specht problem for varieties of bicommutative algebras
What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory
On Shuffle Ideals
A general version of standard basis and its application to T-ideals.
Subword conditions and subword histories
Varieties
Recent progress on well-quasi-ordering graphs
Laver's results and low-dimensional topology
On codes defined by bio-operations
Well quasi-orders generated by a word-shuffle rewriting
Linearizing well quasi-orders and bounding the length of bad sequences
Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees
Ensuring completeness of symbolic verification methods for infinite-state systems
A general finite basis condition for systems of semigroup identities
Varieties of modular \(p\)-algebras not containing \(M_{3,3}\)
Images of rigid digraphs
Automating the Knuth Bendix ordering
On the existence of closed terms in the typed lambda calculus II: Transformations of unification problems
When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron
Model checking parameterized systems
Petri nets and regular processes
On the computational power of BlenX
A note on division orderings on strings
On the Specht property and the basic rank of some products of group varieties
Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity
Model checking of systems with many identical timed processes
Graphs without \(K_ 4\) and well-quasi-ordering
Partitionseigenschaft von endlichen Folgen
A regularity test for dual bordered OS systems
The length of chains in modular algebraic lattices
Combinatorial properties of regressive mappings
Commutative one-counter languages are regular
On better quasi-ordering countable trees
Well quasi-ordered sets and ideals in free semigroups and algebras
Combinatorial theorems on contractive mappings in power sets
Une généralisation des théorèmes de Higman et de Simon aux mots infinis
The finite antichain property in Coxeter groups.
Gröbner bases and gradings for partial difference ideals
On Specht varieties of right alternative algebras
Noncommutative invariants of reductive groups
Finiteness spaces and generalized power series
Multiset rewriting for the verification of depth-bounded processes with name binding
Theories of orders on the set of words
Decidability of a temporal logic problem for Petri nets
On the recursive decomposition ordering with lexicographical status and other related orderings
Simple permutations and algebraic generating functions
Block-graph width
An application of the matrix representation of transductions
Dynamic networks of timed Petri nets
Rings of generalized power series: Nilpotent elements
Fields of generalized power series
Minimal elements for the prime numbers
Inflations of geometric grid classes of permutations
Derivation tree analysis for accelerated fixed-point computation
On power varieties of semigroups
Tournament minors
Games with unawareness
Path homomorphisms
The algebra of \(2 \times 2\) upper triangular matrices as a commutative algebra: gradings, graded polynomial identities and Specht property
Another generalization of Higman's well quasi order result on \(\Sigma ^*\)
T-spaces in associative algebras.
On the regularity of languages on a binary alphabet generated by copying systems
Well-quasi-ordering versus clique-width: new results on bigenic classes
Unsplittable classes of separable permutations
On quasi orders of words and the confluence property
On well quasi orders of free monoids
Well-quasi-ordering versus clique-width: new results on bigenic classes
Well quasi-orders and regular languages
Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Labelled induced subgraphs and well-quasi-ordering
Well-structured graph transformation systems
From monomials to words to graphs.
Polynomial identities for the Jordan algebra of \(2 \times 2\) upper triangular matrices
Well-quasi-order of relabel functions
Definability in the structure of words with the inclusion relation
An Algebraic Characterization of Strictly Piecewise Languages
Basic formulas and languages. I: The theory
Basic formulas and languages. II: Applications to EOL systems and forms
Minimal universal and dense minor closed classes
Well quasi-orders and context-free grammars
Dimension de Krull des ensembles ordonnés. (Krull dimension of ordered sets)
On well-quasi-ordering finite structures with labels
Well-quasi-ordering does not imply bounded clique-width
On the least exponential growth admitting uncountably many closed permutation classes
Weights for total division orderings on strings
Using unavoidable set of trees to generalize Kruskal's theorem
Well rewrite orderings and well quasi-orderings
Monotonic abstraction in parameterized verification

This page was built for publication: Ordering by Divisibility in Abstract Algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5812263)