Titlebook: Computer Science – Theory and Applications; 12th International C Pascal Weil Conference proceedings 2017 Springer International Publishing

Perineum

侵害

Saving Rates of Urban Households in China a decomposition of the string in maximal .-palindromes (i.e. palindromes with . errors under the edit or Hamming distance) and . allowed gaps. We present an algorithm to obtain such a decomposition with the minimal total gap length in time . and space ..

Incompetent

ostrish

Advances in Parameterized Verification of Population Protocols,ness: Given a population protocol, is it well specified? Given a population protocol and a predicate, does the protocol compute the predicate? Given a well-specified protocol, can we automatically obtain a symbolic representation of the predicate it computes? We survey our recent work on this problem.

誓言

Palindromic Decompositions with Gaps and Errors, a decomposition of the string in maximal .-palindromes (i.e. palindromes with . errors under the edit or Hamming distance) and . allowed gaps. We present an algorithm to obtain such a decomposition with the minimal total gap length in time . and space ..

overbearing

Unary Coded PSPACE-Complete Languages in ASPACE(loglog n),ary input ., an alternating machine can simulate a . with . bits, representing the contents of the stack by its input head position. The standard push/pop operations are implemented by moving the head along the input.

沉思的鱼

Generalized Dyck Shifts,on. We define a coding of periodic patterns of generalized Dyck shifts which allows to compute their zeta function. We prove that the zeta function of a generalized Dyck shift is the commutative image of the generating function of an unambiguous context-free language and is thus an .-algebraic series.

Dendritic-Cells

,Green’s Relations in Finite Transformation Semigroups,arameter is the maximal length of a chain of components. Our main contribution is an exponential lower bound for this parameter. There is a simple construction for an arbitrary set of generators. However, the proof for constant alphabet is rather involved. Our results also apply to automata and their syntactic semigroups.

相同

FEIGN