Titlebook: Developments in Language Theory; 10th International C Oscar H. Ibarra,Zhe Dang Conference proceedings 2006 Springer-Verlag Berlin Heidelber

Body-Mass-Index

書目名稱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é)科排名

Aerophagia

使迷醉

Polynomials, Fragments of Temporal Logic and the Variety DA over Tracesbiguous polynomial closure over traces..We also show that there exist natural fragments of local temporal logic that describe this class of languages corresponding to .. All characterizations are known to hold for words.

resilience

Equivalence of Functions Represented by Simple Context-Free Grammars with Outputions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to |.|+ .(.), where |.| is the size of the textual description of ., and .(.) is the maximum of the shortest lengths of words generated by nonterminals of ..

BRIBE

肉身

Prime Decompositions of Regular Languageslanguages and using the characterization we show that every regular language over a unary alphabet has a prime decomposition. We show that there exist co-context-free languages that do not have prime decompositions.

肉身

Ciliate Bio-operations on Finite String Multisetsclasses of finite languages which can be obtained by the different strategies, and show that although the string operations we consider are reversible, their parallel application can produce effects resembling the irreversibility of the biological process of gene assembly in ciliates.

彎腰

Characterizing DNA Bond Shapes Using Trajectoriestypes of bond shapes frequently found in DNA computing..We examine the algebraic properties of sets of trajectories. In particular, we consider rotation of trajectories and weakening of the bonding conditions expressed by a set of DNA trajectories. We also consider decidability results for bond-freeness with respect to our definition.

衍生

無政府主義者