Bridges for Concatenation Hierarchies (1998)

Cached

Download Links

by Jean-Éric Pin
Venue:In Proceedings 25th ICALP, volume 1443 of LNCS
Citations:9 - 0 self

Documents Related by Co-Citation

59 Polynomial closure and unambiguous product, Theory Comput. Systems 30 – J-E Pin, P Weil - 1997
33 A semigroup characterization of dot-depth one languages – R Knast - 1983
15 Languages of Dot-Depth 3/2 – Christian Glaßer, Heinz Schmitz - 2000
42 Finite semigroup varieties of the form V – H Straubing - 1985
96 Finite Semigroups and Universal Algebra”, World Scientific – J Almeida - 1994
16 On existentially first-order definable languages and their relation to – Bernd Borchert, Dietrich Kuske, Frank Stephan - 1999
34 Dot-depth of star-free events – R S Cohen, J A Brzozowski - 1971
37 The dot-depth hierarchy of star-free languages is infinite – J Brzozowski, R Knast - 1978
97 Piecewise testable events – I Simon - 1975
17 Polynomial Operations on Rational Languages – Mustapha Arfi - 1987
23 Opérations polynomiales et hiérarchies de concaténation, Theoret – M Arfi - 1991
181 Automata, languages, and machines – S Eilenberg - 1974
26 Locally trivial categories and unambiguous concatenation – J-E Pin, H Straubing, D Thérien - 1988
29 Hierarchies of aperiodic languages – J A Brzozowski - 1976
16 Polynomial Closure of Group Languages and Open Sets of the Hall Topology – Jean-Eric Pin - 1994
12 Regular languages defined by generalized first-order formulas with a bounded number of variables – H Straubing, D Thérien - 2001
18 On the Decidability of Iterated Semidirect Products With Applications to Complexity – Jorge Almeida, Benjamin Steinberg - 1997
70 Inevitable graphs: a proof of the type II conjecture and some related decision procedures – C J Ash - 1991
21 The pro-p topology of a free group and algorithmic problems in semigroups – L Ribes, P A Zalesskiǐ - 1994