Titlebook: Language and Automata Theory and Applications; 4th International Co Adrian-Horia Dediu,Henning Fernau,Carlos Martín-Vi Conference proceedin

北京人起源

Abelian Square-Free Partial Wordsfor the number of letters needed to construct infinite abelian square-free partial words with finitely or infinitely many holes. In the case of one hole, we prove that the minimal alphabet size is four, while in the case of more than one hole, we prove that it is five.

共同确定为确

Pregroup Grammars with Letter Promotionsthe emptiness problem for context-free languages. As a consequence, the following problems are in P: the word problem for pregroups with letter promotions and the membership problem for pregroup grammars with letter promotions.

山顶可休息

粗鄙的人

Three Learnable Models for the Description of Languagelearnable representations is by making them objective or empiricist: the structure of the representation should be based on the structure of the language. Rather than defining a function from representation to language we should start by defining a function from the language to the representation: f

Dysplasia

chalice

Encapsulate

A Simple ,-Dimensional Intrinsically Universal Quantum Cellular Automatond evolution of any .-dimensional QCA can be encoded within the initial configuration of the intrinsically universal QCA. Several steps of the intrinsically universal QCA then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulat

AV-node

A Fast Longest Common Subsequence Algorithm for Similar Stringshis problem. Let . and . be any two given strings each of length .(.). We observe that a longest common subsequence can be obtained by using longest common prefixes of suffixes (longest common extensions) of . and .. The longest common extension problem asks for the longest common prefix of suffixes

Intellectual

Abelian Square-Free Partial Wordsrmutations of each other). Infinite abelian square-free words have been constructed over alphabets of sizes as small as four. In this paper, we investigate the problem of avoiding abelian squares in partial words (sequences that may contain some holes). In particular, we give lower and upper bounds

agitate