Related papers: Automata and cells in affine Weyl groups
Champarnaud and Ziadi, and Khorsi et al. show how to compute the equation automaton of word regular expression $E$ via the $k$-C-Continuations. Kuske and Meinecke extend the computation of the equation automaton to a regular tree expression…
A regular language L is said to be cellular if there exists a 1-dimensional cellular automaton CA such that L is the language consisting of the finite blocks associated with CA. It is shown that cellularity of a regular language is…
In this paper, we show Kazhdan-Lusztig categories, that is, the categories of lower bounded generalized weight modules for certain affine vertex operator superalgebras that are locally finite modules of the underlying finite dimensional Lie…
Multi-tildes are regular operators that were introduced to enhance the factorization power of regular expressions, allowing us to add the empty word in several factors of a catenation product of languages. In addition to multi-bars, which…
The Eilenberg correspondence relates varieties of regular languages to pseudovarieties of finite monoids. Various modifications of this correspondence have been found with more general classes of regular languages on one hand and classes of…
A class of additive cellular automata (ACA) on a finite group is defined by an index-group $\m g$ and a finite field $\m F_p$ for a prime modulus $p$ \cite{Bul_arch_1}. This paper deals mainly with ACA on infinite commutative groups and…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
In this paper, we let $\Hecke$ be the Hecke algebra associated with a finite Coxeter group $W$ and with one-parameter, over the ring of scalars $\Alg=\mathbb{Z}(q, q^{-1})$. With an elementary method, we introduce a cellular basis of…
This paper presents the main features of a system that aims to transform regular expressions into shorter equivalent expressions. The system is also capable of computing other operations useful for simplification, such as checking the…
We are interested in cell properties of translations in affine Weyl groups. We find out some translations in the second lowest two-sided cell of an affine Weyl group and use the translations to formulate a refinement of Jianyi Shi's…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
First-order linear temporal logic (FOLTL) is a flexible and expressive formalism capable of naturally describing complex behaviors and properties. Although the logic is in general highly undecidable, the idea of using it as a specification…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…
An algebra $A$ is said to be directly finite if each left invertible element in the (conditional) unitization of $A$ is right invertible. We show that the reduced group ${\rm C}^\ast$-algebra of a unimodular group is directly finite,…
In this note we study simple modules for a reduced enveloping algebra U_chi(g) in the critical case when chi element of g^* is ``nilpotent''. Some dimension formulas computed by Jantzen suggest modified versions of Weyl's dimension formula,…
We examine the NFA minimization problem in terms of atomic NFA's, that is, NFA's in which the right language of every state is a union of atoms, where the atoms of a regular language are non-empty intersections of complemented and…
We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…
We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the…
In this paper, we introduce a new model of deterministic Watson-Crick automaton namely restricted deterministic Watson- Crick automaton which is a deterministic Watson-Crick automaton where the complementarity string in the lower strand is…
Let W be an arbitrary Coxeter group. If two elements have expressions that are cyclic shifts of each other (as words), then they are conjugate (as group elements) in W. We say that w is "cyclically fully commutative" (CFC) if every cyclic…