Related papers: Automata and cells in affine Weyl groups
Finite-state automata are a very effective tool in natural language processing. However, in a variety of applications and especially in speech precessing, it is necessary to consider more general machines in which arcs are assigned weights…
Let (W, S) be a Coxeter system. A W-graph is an encoding of a representation of the corresponding Iwahori-Hecke algebra. Especially important examples include the W-graph corresponding to the action of the Iwahori-Hecke algebra on the…
We introduce cell modules for the tabular algebras defined in a previous work (math.QA/0107230); these modules are analogous to the representations arising from left Kazhdan--Lusztig cells. The standard modules of the title are constructed…
The language of maximal lexicographic representatives of elements in the positive braid monoid $A_n$ with $n$ generators is a regular language. We describe with great detail the smallest Finite State Automaton accepting such language, and…
In a Coxeter group $W$, an element is fully commutative if any two of its reduced expressions can be linked by a series of commutation of adjacent letters. These elements have particularly nice combinatorial properties, and also index a…
For any group $G$ and any set $A$, a cellular automaton (CA) is a transformation of the configuration space $A^G$ defined via a finite memory set and a local function. Let $\text{CA}(G;A)$ be the monoid of all CA over $A^G$. In this paper,…
We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…
We follow language theoretic approach to synchronizing automata and \v{C}ern\'{y}'s conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a…
Let $\mathfrak{g}$ be a complex semisimple Lie algebra. We give a description of characters of irreducible Whittaker modules for $\mathfrak{g}$ with any infinitesimal character, along with a Kazhdan-Lusztig algorithm for computing them.…
Arden's Lemma is a classical result in language theory allowing the computation of a rational expression denoting the language recognized by a finite string automaton. In this paper we generalize this important lemma to the rational tree…
Let $\mathfrak{g}$ be a simple, simply-laced Lie algebra and $f \in \mathfrak{g}$ nilpotent. The Kazhdan-Lusztig category of the W-algebra $W^\kappa(\mathfrak{g},f)$ associated with $(\mathfrak{g},f)$ at level $\kappa \in \mathbb{C}$ is…
Cellular automata are a famous model of computation, yet it is still a challenging task to assess the computational capacity of a given automaton; especially when it comes to showing negative results. In this paper, we focus on studying…
A two-way deterministic finite state automaton with one counter (2D1CA) is a fundamental computational model that has been examined in many different aspects since sixties, but we know little about its power in the case of unary languages.…
The state complexity, respectively, nondeterministic state complexity of a regular language $L$ is the number of states of the minimal deterministic, respectively, of a minimal nondeterministic finite automaton for $L$. Some of the most…
Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…
We consider finite two-way automata and measure the use of two-way motion by counting the number of left moves in accepting computations. Restriction of the automata according to this measure allows us to study in detail the use of two-way…
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on…
In this paper, we establish a bijection between the infinite reduced words of an affine Weyl group and certain biclosed sets of its positive system and determine all finitely generated biclosed sets in the positive system of an affine Weyl…
We classify the elements of $W(\tilde{A}_n)$ by giving a canonical reduced expression for each, using basic tools among which affine length. We give some direct consequences for such a canonical form: a description of left multiplication by…
The main result in this paper is the character formula for arbitrary irreducible highest weight modules of W algebras. The key ingredient is the functor provided by quantum Hamiltonian reduction, that constructs the W algebras from affine…