Titlebook: STACS 86; 3rd Annual Symposium B. Monien,G. Vidal-Naquet Conference proceedings 1986 Springer-Verlag Berlin Heidelberg 1986 Monoid.Notation

感染

On sparseness, ambiguity and other decision problems for acceptors and transducers,sducers. A language . is sparse if there is a polynomial . such that the number of strings of length . in . is atmost .(.). A recognizer (transducer) is of polynomial ambiguity (valued) if there exists a polynomial . such that the number of derivations (outputs) for any input of length . is at most

Compatriot

Varietes de Semis Groupes et Mots Infinis,oins satisfaisants que dans le cas des mots finis. Nous obtenons cependant des descriptions intéressantes des classes associées aux variétés les plus usuelles. Cette étude permet également de mieux saisir la portée du théorème de Mac Naughton.

gustation

Separating and testing,We give a negative answer to the question of separability for a large variety of classes of infinitary languages, from Alg. to Σ.. We then prove that there exists for the calculus of communicating systems no notion of testing which can separate every pair of agents which differ by their infinite seq

white-matter

Decomposition de Fonctions Rationnelles,existe une décomposition du domaine de définition en un nombre fini de parties reconnaissables sur chacune desquelles la fonction est sous-séquentielle (c‘est à dire grossièrement séquentielle). Nous en donnons une caractérisation qui nous permet de décider si une fonction rationnelle arbitraire est

Heresy

Long unavoidable patterns,ength 2.−1 on an alphabet with n letters ; this pattern is a "quasi-power" in the sense of Schützenberger. We characterize the unavoidable words of length 2.−2 and 2.−3. Finally we show that every unavoidable word sufficiently long has a certain "quasi-power" as a subword.

Bouquet

Some probabilistic powerdomains in the category SFP,n of probability distribution over a domain; the second in probabilistic generating trees, that generalize the notion of generating tree, introduced by Smyth; and the last in "informations about probability distributions", that we introduce, getting an information system, as defined by Scott.

不合

漫不经心

Varietes de Semis Groupes et Mots Infinis,oins satisfaisants que dans le cas des mots finis. Nous obtenons cependant des descriptions intéressantes des classes associées aux variétés les plus usuelles. Cette étude permet également de mieux saisir la portée du théorème de Mac Naughton.

paragon

Separating and testing,We give a negative answer to the question of separability for a large variety of classes of infinitary languages, from Alg. to Σ.. We then prove that there exists for the calculus of communicating systems no notion of testing which can separate every pair of agents which differ by their infinite sequences of visible actions.

outer-ear