Polynomial languages with finite antidictionaries

For finitely generated group that are linear over a field, a polynomial upper bound for these functions is established in [BM], and in the case of higher rank arithmetic groups,

The minimum number of colors such that the graph G admits a vd-coloring is called the observability of G and is denoted by Obs(G

Our main theorem is the following pumping lemma applicable to every level of the higher- order pushdown graph hierarchy.. I

A case study carried out off the Bonea stream mouth (Salerno Bay, Southern Tyrrhenian Sea, Fig. 1) is here presented; the use of several methodologies resulted in the

Let us briefly describe the structure of this paper: in the first part, we recall Ogus' notion of transversality and Berthelot's notion of partial divided power structures as well

The mentioned hierarchy of DSMLs has been designed using a multi-level modeling approach FMML x (Flexible Meta Modeling and Execution Language) and a supporting tool XModeler.. Based

Analyses of workforce data about the number of pediatric specialists in the USA and Australia show that data sets representing physicians often represent

On that abstract class Thing one association Instantiation is defined that is intended to represent the instance-of connec- tions between a higher level object and a lower level: