Results 41 to 50 of about 8,270 (198)

Finite Automata for the Sub- and Superword Closure of CFLs: Descriptional and Computational Complexity [PDF]

, 2014
We answer two open questions by (Gruber, Holzer, Kutrib, 2009) on the state-complexity of representing sub- or superword closures of context-free grammars (CFGs): (1) We prove a (tight) upper bound of $2^{\mathcal{O}(n)}$ on the size of nondeterministic ...
A Okhotin, B Courcelle, C Brabrand, H Gruber, J Esparza, J Leeuwen van, M Mohri, MF Atig, N Rampersad, N Vasudevan, P Ganty, P Habermehl, R Axelsson, S Schmitz, Y Bar-Hillel, Z Long   +15 more
core   +1 more source

The Parametric Ordinal-Recursive Complexity of Post Embedding Problems [PDF]

, 2012
Post Embedding Problems are a family of decision problems based on the interaction of a rational relation with the subword embedding ordering, and are used in the literature to prove non multiply-recursive complexity lower bounds.
A. Finkel, C.C. Elgot, G. Cécé, J. Ouaknine, J.O. Ouaknine, M. Latteux, M. Löb, P. Bouyer, P. Chambart, P. Chambart, P. Chambart, P. Jančar, P. Karandikar, P.A. Abdulla, P.A. Abdulla, S. Lasota, S. Schmitz   +16 more
core   +3 more sources

Subword complexes and edge subdivisions [PDF]

Proceedings of the Steklov Institute of Mathematics, 2014
For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, ), where Q is a word in the alphabet of simple reflections, $ $ is a group element. We discuss the transformations of such a complex induced by braid moves of the word Q. We show that under certain conditions, this transformation is a composition of edge
openaire   +3 more sources

Subexponential estimations in Shirshov's height theorem (in English) [PDF]

, 2012
In 1993 E. I. Zelmanov asked the following question in Dniester Notebook: "Suppose that F_{2, m} is a 2-generated associative ring with the identity x^m=0.
, A. A. Lopatin, A. G. Kolotov, A. I. Shirshov, A. I. Shirshov, A. Kanel-Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, A. Ya. Belov, Aleksei Ya Belov, C. Procesi, E. N. Kuz'min, E. S. Chibrikov, G. P. Chekanu (Ciocanu), G. P. Chekanu (Ciocanu), Gh. Ciocanu, Gh. P. Ciocanu, Gh. P. Ciocanu, I. I. Bogdanov, M. I. Kharitonov, M. I. Kharitonov, M. Kharitonov, M. Lothaire, M. Lothaire, Mikhail I Kharitonov, S. P. Mishchenko, S. V. Pchelintsev, S. V. Pchelintsev, V. A. Ufnarovskij, V. A. Ufnarovskiĭ, V. A. Ufnarovskiĭ, V. A. Ufnarovskiĭ, V. Drensky, V. N. Latyshev, Yu. P. Razmyslov   +38 more
core   +2 more sources

Subword complexes in Coxeter groups

Advances in Mathematics, 2004
Let ( , ) be a Coxeter system. An ordered list of elements in and an element in determine a {\em subword complex}, as introduced in our paper on Gr bner geometry of Schubert polynomials (math.AG/0110058). Subword complexes are demonstrated here to be homeomorphic to balls or spheres, and their Hilbert series are shown to reflect combinatorial ...
Knutson, Allen, Miller, Ezra
openaire   +3 more sources

Subword complexes, cluster complexes, and generalized multi-associahedra [PDF]

Journal of Algebraic Combinatorics, 2013
In this paper, we use subword complexes to provide a uniform approach to finite type cluster complexes and multi-associahedra. We introduce, for any finite Coxeter group and any nonnegative integer k, a spherical subword complex called multi-cluster complex.
Ceballos, Cesar, Labbé, Jean-Philippe, Stump, Christian   +2 more
openaire   +3 more sources

Schubert Patches Degenerate to Subword Complexes [PDF]

Transformation Groups, 2008
11 ...
openaire   +3 more sources

The Height of Piecewise-Testable Languages with Applications in Logical Complexity [PDF]

, 2016
The height of a piecewise-testable language L is the maximum length of the words needed to define L by excluding and requiring given subwords. The height of L is an important descriptive complexity measure that has not yet been investigated in a ...
Karandikar, Prateek, Schnoebelen, Philippe   +1 more
core   +1 more source

Convex cocompactness in mapping class groups via quasiconvexity in right-angled Artin groups [PDF]

, 2013
We characterize convex cocompact subgroups of mapping class groups that arise as subgroups of specially embedded right-angled Artin groups. That is, if the right-angled Artin group G in Mod(S) satisfies certain conditions that imply G is quasi ...
Mangahas, Johanna, Taylor, Samuel J.
core   +1 more source

Decision Problems For Convex Languages [PDF]

, 2008
In this paper we examine decision problems associated with various classes of convex languages, studied by Ang and Brzozowski (under the name "continuous languages").
A. Aho, A. Luca de, G. Thierrin, H. Jürgensen, H.B. Hunt III, J. Berstel, J.E. Hopcroft, M.P. Béal, Y.S. Han   +8 more
core   +2 more sources