Titlebook: Developments in Language Theory; 17th International C Marie-Pierre Béal,Olivier Carton Conference proceedings 2013 Springer-Verlag Berlin H

PEL

書目名稱Developments in Language Theory影響因子(影響力)




書目名稱Developments in Language Theory影響因子(影響力)學(xué)科排名




書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度




書目名稱Developments in Language Theory網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Developments in Language Theory被引頻次




書目名稱Developments in Language Theory被引頻次學(xué)科排名




書目名稱Developments in Language Theory年度引用




書目名稱Developments in Language Theory年度引用學(xué)科排名




書目名稱Developments in Language Theory讀者反饋




書目名稱Developments in Language Theory讀者反饋學(xué)科排名

–FER

0302-9743 y and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; and quantum computing.978-3-642-38770-8978-3-642-38771-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

歪曲道理

Abhandlungen zur Literaturwissenschafttiset of Lyndon words. Finally, we show that the Lyndon factorization of a word helps the construction of its suffix array, allowing a reduction of the number of symbol comparisons needed to lexicographically sort the suffixes of the word.

必死

臨時(shí)抱佛腳

Einige Grundbegriffe der Analysis im ?Straight-Line Programme) for the solution of the word equation, i.e. a ...Using this technique we give a simple proof that satisfiability of word equations is in .. Furthermore we sketch the applications for some problems regarding the SLP compressed strings.

服從

服從

燦爛

LUCY

An Explicit Formula for the Intersection of Two Polynomials of Regular Languagese same purpose, our formula does not use complementation and only requires union, intersection and quotients. Our result also implies that if . is closed under union, intersection and quotient, then its polynomial closure, its unambiguous polynomial closure and its left [right] deterministic polynomial closure are closed under the same operations.

hieroglyphic

Two Dimensional Prefix Codes of Picturesrther a polynomial time decoding algorithm for finite prefix codes is given. Maximality and completeness of finite prefix codes are studied: differently from the one-dimensional case, they are not equivalent notions. Completeness of finite prefix codes is characterized.