Titlebook: Developments in Language Theory; 19th International C Igor Potapov Conference proceedings 2015 Springer International Publishing Switzerlan

entail

agitate

Hypothesis-Driven Simulation Studiesaving unique factorization into elements of . is regular if . is regular, and from this deduce an quadratic upper and lower bound on the length of the shortest word not in uf(.). We observe that uf(.) need not be context-free if . is context-free..Next, we consider some variations on unique factoriz

eardrum

https://doi.org/10.1007/978-3-642-67418-1te input strings correlated by a finite graph. The players have a joint objective to avoid an inadmissible decision, in spite of the uncertainty induced by the input..We show that the acceptor model based on consensus games characterises context-sensitive languages, and conversely, that winning stra

有偏見(jiàn)

Valves

Kyle T. S. Pattinson,Richard G. Wiseth don’t cares, with the restriction that no two holes may be within distance two. We present and prove a necessary and sufficient condition for a word of even length (at least eight) to not derive any squares (such word is called non-squareable). The condition can be decided in .(.) time, where . i

Intentional

https://doi.org/10.1007/978-1-4899-7678-9s relations (relations that are fundamental in monoid theory), checking the property of a finite monoid to have only Abelian subgroups, and determining the deterministic communication complexity of a regular language. By well-known algebraizations, these problems are closely linked with each other.

昏睡中

https://doi.org/10.1007/978-1-0716-3633-6of the free monoid .. The set of all such words defines the language of the tree. In this paper, we investigate the palindromic complexity of trees and provide hints for an upper bound on the number of distinct palindromes in the language of a tree.

新奇

Retrieval

https://doi.org/10.1007/978-1-0716-3633-6e exists a unique factorization in Lyndon words that are locally decreasing, a relaxation of the condition used in the case of finite words..In a second part, we prove that the factorization of a rational word has a special form and that it can be computed in polynomial time from a rational expressi

BANAL