Browse by Creators (Kiel)

Up a level
Export as [feed] RSS [feed] RSS 3.0
Group by: Document type | No Grouping | Year of publication
Number of items: 14.

Article in a Scientific Journal - peer-reviewed

[img]

Dassow, J., Manea, F. and Truthe, B. (2013) Networks of evolutionary processors: the power of subregular filters Acta Informatica, 50 (1). pp. 41-75. DOI 10.1007/s00236-012-0172-0.

[img]

Gawrychowski, P., Manea, F., Mercas, R., Nowotka, D. and Tiseanu, C. (2013) Finding Pseudo-repetitions LIPIcs - Leibniz International Proceedings in Informatics, 20 . pp. 257-268. DOI 10.4230/LIPIcs.STACS.2013.257.

[img]

Manea, F. and Tiseanu, C. (2013) The hardness of counting full words compatible with partial words Journal of Computer and System Sciences, 79 (1). pp. 7-22. DOI 10.1016/j.jcss.2012.04.001.

[img]

Manea, F. (2012) Complexity results for deciding Networks of Evolutionary Processors Theoretical Computer Science, 456 . pp. 65-79. DOI 10.1016/j.tcs.2012.06.029.

[img]

Dassow, J., Manea, F. and Mercaş, R. (2012) Connecting Partial Words and Regular Languages Lecture Notes in Computer Science, 7318 . pp. 151-161. DOI 10.1007/978-3-642-30870-3_16.

[img]

Dassow, J., Manea, F. and Truthe, B. (2012) Generating Networks of Splicing Processors RAIRO - Theoretical Informatics and Applications, 46 (4). pp. 547-572. DOI 10.1051/ita/2012016.

[img]

Manea, F., Mercas, R. and Mitrana, V. (2012) Hairpin Lengthening and Shortening of Regular Languages Lecture Notes in Computer Science, 7300 . pp. 145-159. DOI 10.1007/978-3-642-31644-9_10.

[img]

Turaev, S., Dassow, J., Manea, F. and Selamat, M. H. (2012) Language classes generated by tree controlled grammars with bounded nonterminal complexity Theoretical Computer Science, 449 . pp. 134-144. DOI 10.1016/j.tcs.2012.04.013.

[img]

Dassow, J., Manea, F. and Truthe, B. (2012) Networks of evolutionary processors: computationally complete normal forms Natural Computing, 11 (4). pp. 595-607. DOI 10.1007/s11047-012-9331-z.

[img]

Manea, F. and Truthe, B. (2012) On Internal Contextual Grammars with Subregular Selection Languages Lecture Notes in Computer Science, 7386 . pp. 222-235. DOI 10.1007/978-3-642-31623-4_17.

[img]

Dassow, J., Manea, F. and Truthe, B. (2012) On external contextual grammars with subregular selection languages Theoretical Computer Science, 449 . pp. 64-73. DOI 10.1016/j.tcs.2012.04.008.

Conference paper

[img]

Manea, F., Müller, M. and Nowotka, D. (2012) The Avoidability of Cubes under Permutations [Paper] In: Developments in Language Theory (DLT), 14-17 Aug 2012, Taipei, Taiwan.

[img]

Manea, F., Mercaş, R. and Nowotka, D. (2012) Fine and Wilf’s Theorem and Pseudo-repetitions [Paper] In: Mathematical Foundations of Computer Science (MFCS), 27-31 Aug 2012, Bratislava, Slovakia.

[img]

Grozea, C., Manea, F., Müller, M. and Nowotka, D. (2012) String Matching with Involutions [Paper] In: Unconventional Computation and Natural Computation (UCNC), 3-7 Sept 2012, Orléans, France.

This list was generated on Sun May 31 07:06:00 2020 CEST.