Titlebook: Developments in Language Theory; 9th International Co Clelia Felice,Antonio Restivo Conference proceedings 2005 Springer-Verlag Berlin Heid

转换

Revolving-Input Finite Automata, family of context-free languages, and are strictly more powerful than regular languages. Moreover, we show that right revolving can be simulated by left revolving, when considering the mirror image of the input.

entail

Humanistic Pedagogy Across the Disciplinesere seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.

Spina-Bifida

Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells,ere seems to be a trade-off between the number of cells and the number of symbols, e.g., for the case of tissue P systems with two channels between a cell and the environment we show that computational completeness can be obtained with two cells and three symbols as well as with three cells and two symbols, respectively.

Melatonin

撕裂皮肉

Minikin

Some New Results on Palindromic Factors of Billiard Words,rd words, which describe very different situations. In some cases, these words have arbitrary long palindromic prefix factors. In other cases, at the opposite, they have finitely many distinct palindromic factors.. . 68R15.

demote

Grace B. Yu,Dong-Jin Lee,M. Joseph Sirgynd for the width of quantum OBDDs depending on the error . allowed..Next we consider “generalized measure-many” quantum automata. It is appeared that for uniform and nonuniform automata (for space restricted models) their measure-once and measure-many models have different computational power.

brother

乞丐

我们的面粉

Collapsing Words: A Progress Report,word .∈Σ. (depending on .). We overview some recent results related to this notion. One of these results implies that the property of being .-collapsing is algorithmically recognizable for any given positive integer ..