Titlebook: Automata, Languages and Programming; 24th International C Pierpaolo Degano,Roberto Gorrieri,Alberto Marchett Conference proceedings 1997 Sp

吵闹

机械

Bundesamt für Sicherheit im GesundheitswesenWe study the monadic case of a decision problem know as simultaneous rigid .-unification. We show its equivalence to an extension of word equations. We prove decidability and complexity results for special cases of this problem.

Crumple

Biologie der MelanophorenhormoneIn [3] we exhibited a simple boolean functions .. in . variables such that:.In this paper we present a simple boolean function .. in . variables such that:.These mean that . and . are incomparable in the context of ordered read-once branching program.

Goblet-Cells

Ventricle

,The Wadge-Wagner hierarchy of ω-rational sets,We present a unified treatment of the hierarchy defined by Klaus Wagner for .-rational sets and also introduced in the more general framework of descriptive set theory by William W. Wadge. We show that this hierarchy can be defined by syntactic invariants, using the concept of an .-semigroup.

发电机

farewell

Enumerative sequences of leaves in rational trees,We prove that any IN-rational sequence .=(..). of non-negative integers satisfying the Kraft strict inequality .is the enumerative sequence of leaves by height of a rational .-ary tree. Particular cases of this result had been previously proven. We give some partial results in the equality case.

纠缠,缠绕

A completion algorithm for codes with bounded synchronization delay,We show that any rational code with bounded synchronization delay is included in a rational maximal code with bounded synchronization delay.

harangue

多产鱼

Randomization and nondeterminism are comparable for ordered read-once branching programs,In [3] we exhibited a simple boolean functions .. in . variables such that:.In this paper we present a simple boolean function .. in . variables such that:.These mean that . and . are incomparable in the context of ordered read-once branching program.