Browse by Divisions (Kiel)

Up a level
Export as [feed] RSS [feed] RSS 3.0
Group by: Document type | Year of publication | Author/Editor | No Grouping
Number of items at this level: 65.

Article in a Scientific Journal - peer-reviewed

[img]

Bischoff, B., Currie, J. and Nowotka, D. (In Press / Accepted) Unary patterns with involution International Journal of Foundations of Computer Science .

[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]

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]

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]

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.

[img] [img]

Diekert, V., Harju, T. and Nowotka, D. (2010) Weinbaum factorizations of primitive words Russian Mathematics, 54 (1). pp. 16-25. DOI 10.3103/S1066369X10010032.

[img]

Duval, J. P., Harju, T. and Nowotka, D. (2008) Unbordered factors and Lyndon words Discrete Mathematics, 308 (11). pp. 2261-2264. DOI 10.1016/j.disc.2006.09.054.

[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]

Göller, S. and Nowotka, D. (2008) A note on an extension of PDL Journal of Applied Logic, 6 (4). pp. 606-608. DOI 10.1016/j.jal.2007.12.002.

[img]

Harju, T. and Nowotka, D. (2006) Binary Words with Few Squares Bulletin of the EATCS, 89 . pp. 164-166.

[img]

Harju, T. and Nowotka, D. (2004) Border correlation of binary words Journal of Combinatorial Theory, Series A, 108 (2). pp. 331-341. DOI 10.1016/j.jcta.2004.07.009.

[img]

Harju, T. and Nowotka, D. (2008) Bordered Conjugates of Words over Large Alphabets Electronic Journal of Combinatorics, 15 . N41.

[img]

Harju, T. and Nowotka, D. (2005) Counting bordered and primitive words with a fixed weight Theoretical Computer Science, 340 (2). pp. 273-279. DOI 10.1016/j.tcs.2005.03.040.

[img]

Harju, T. and Nowotka, D. (2010) Cyclically repetition-free words on small alphabets Information Processing Letters, 110 (14-15). pp. 591-595. DOI 10.1016/j.ipl.2010.05.005.

[img]

Harju, T. and Nowotka, D. (2002) Density of Critical Factorizations RAIRO - Theoretical Informatics and Applications, 36 (3). pp. 315-327. DOI 10.1051/ita:2002016.

[img]

Harju, T. and Nowotka, D. (2004) The Equation x^i = y^j z^k in a Free Semigroup Semigroup Forum, 68 (3). pp. 488-490. DOI 10.1007/s00233-003-0028-6.

[img]

Harju, T. and Nowotka, D. (2004) Minimal Duval extensions International Journal of Foundations of Computer Science, 15 (02). pp. 349-354. DOI 10.1142/S0129054104002467.

[img]

Harju, T. and Nowotka, D. (2005) On the equation x^k = z_1^{k_1} z_2^{k_2} ... z_n^{k_n} in a free semigroup Theoretical Computer Science, 330 (1). pp. 117-121. DOI 10.1016/j.tcs.2004.09.012.

[img]

Harju, T. and Nowotka, D. (2003) On the independence of equations in three variables Theoretical Computer Science, 307 (1). pp. 139-172. DOI 10.1016/S0304-3975(03)00098-7.

[img]

Harju, T. and Nowotka, D. (2006) On unique factorizations of primitive words Theoretical Computer Science, 356 (1-2). pp. 186-189. DOI 10.1016/j.tcs.2006.01.031.

[img]

Harju, T. and Nowotka, D. (2003) Periodicity and Unbordered Segments of Words Bulletin of the EATCS . pp. 162-167.

[img]

Harju, T. and Nowotka, D. (2007) Periodicity and unbordered words Journal of the ACM, 54 (4). 20-es. DOI 10.1145/1255443.1255448.

[img]

Harju, T. and Nowotka, D. (2006) Periods in Extensions of Words Acta Informatica, 43 (3). pp. 165-171. DOI 10.1007/s00236-006-0014-z.

[img]

Harju, T., Kärki, T. and Nowotka, D. (2011) The Number of Positions Starting a Square in Binary Words Electronic Journal of Combinatorics, 18 .

[img]

Harju, T., Lepistö, A. and Nowotka, D. (2005) A characterization of periodicity of bi-infinite words Theoretical Computer Science, 347 (1-2). pp. 419-422. DOI 10.1016/j.tcs.2004.08.017.

[img]

Hoffmann, B., Lifshits, M., Lifshits, Y. and Nowotka, D. (2010) Maximal Intersection Queries in Randomized Input Models Theory of Computing Systems, 46 (1). pp. 104-119. DOI 10.1007/s00224-008-9154-6.

[img]

Holub, S. and Nowotka, D. (2010) On the Relation between Periodicity and Uunbordered Factors of Finite Words International Journal of Foundations of Computer Science, 21 (04). pp. 633-645. DOI 10.1142/S0129054110007465.

[img]

Holub, Š. and Nowotka, D. (2012) The Ehrenfeucht–Silberger problem Journal of Combinatorial Theory, Series A, 119 (3). pp. 668-682. DOI 10.1016/j.jcta.2011.11.004.

[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]

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. 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]

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.

Book


Diekert, V. and Nowotka, D. (2011) Special issue-Developments in language theory (DLT 2009) World Scientific, Singapore, pp. 275-276. DOI 10.1142/S0129054111008027.


Halava, V., Karhumäki, J., Nowotka, D. and Rozenberg, G. (2012) Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju Fundamenta Informaticae (1-4). IOS Press, Amsterdam, The Netherlands. ISBN 0169-2968

Proceedings


Berthe, V., Karhumäki, J., Nowotka, D. and Shallit, J., eds. (2010) Mini-Workshop: Combinatorics on Words [Proceedings]


Crochemore, M., Kari, L., Mohri, M. and Nowotka, D., eds. (2011) Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) [Proceedings]


Diekert, V. and Nowotka, D. (2009) Developments in Language Theory [Proceedings]

Conference paper

[img]

Benini, M., Kalvala, S. and Nowotka, D. (1998) Program abstraction in a higher-order logic framework [Paper] In: Theorem Proving in Higher Order Logics (TPHOLs), 27 Sep - 1 Oct 1998, Canberra, Australia.

[img]

Benini, M., Nowotka, D. and Pulley, C. (1998) Computer Arithmetic: Logic, Calculation, and Rewriting [Paper] In: Frontiers of Combining Systems (FroCoS), 2 - 4 Oct 1998, Amsterdam, The Netherlands.

[img]

Bischoff, B. and Nowotka, D. (2011) Pattern Avoidability with Involution [Paper] In: WORDS, 12-16 Sept 2011, Prague, Czech Republic.

[img]

Dassow, J., Manea, F., Mercaş, R. and Müller, M. (2013) Inner Palindromic Closure [Paper] In: Developments in Language Theory (DLT) 2013, 18. - 21. Juni 2013, Paris-Est, France .

[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.

[img]

Harju, T. and Nowotka, D. (2003) About Duval Extensions [Paper] In: WORDS, 10 - 13 Sep 2003, Turku, Finland.


Harju, T. and Nowotka, D. (2001) On the Independence of Equations in Three Variables [Paper] In: WORDS, Sep 2001, Palermo, Italy.

[img]

Harju, T. and Nowotka, D. (2003) About Duval’s Conjecture [Paper] In: Developments in Language Theory (DLT), 7 - 11 July 2003, Szeged, Hungary.

[img]

Harju, T. and Nowotka, D. (2004) Periodicity and Unbordered Words [Paper] In: Symposium on Theoretical Aspects of Computer Science (STACS), 25 - 27 Mar 2004, Montpellier, France.

[img]

Hoffmann, B., Lifshits, Y. and Nowotka, D. (2007) Maximal Intersection Queries in Randomized Graph Models [Paper] In: Computer Science Russia (CSR), 3 - 7 Sep 2007, Ekaterinburg, Russia.

[img]

Holub, Š. and Nowotka, D. (2009) The Ehrenfeucht-Silberger Problem [Paper] In: International Colloquium on Automata, Languages and Programming (ICALP), 5 - 12 Jul 2009, Rhodos, Greece.

[img]

Holub, Š. and Nowotka, D. (2008) On the Relation between Periodicity and Unbordered Factors of Finite Words [Paper] In: Developments in Language Theory (DLT), 16 - 19 Sep 2008, Kyoto, Japan.

[img]

Leucker, M., Löser, M., Nowotka, D. and Rischen, J. (2009) Äquivalenzklassen mit Zeit und Zuständen [Paper] In: Informatiktage, 27 - 28 Mar 2009, Bonn.

[img]

Levi, P., Montag, P. and Nowotka, D. (2006) Verification in the Design Process of Large Real-Time Systems: A Case Study [Paper] In: Automotive - Safety & Security, 12 - 13 Oct 2006, Stuttgart, Germany.

[img]

Lifshits, Y. and Nowotka, D. (2007) Estimation of the Click Volume by Large Scale Regression Analysis [Paper] In: Computer Science Russia (CSR), 3 - 7 Sep 2007, Ekaterinburg, Russia.

[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]

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]

Nowotka, D. and Traub, J. (2012) MEMICS - Memory Interval Constraint Solving of (concurrent) Machine Code [Paper] In: Automotive - Safety & Security, 14-15 Nov 2012, Karlsruhe, Germany.

[img]

Nowotka, D. and Srba, J. (2007) Height-Deterministic Pushdown Automata [Paper] In: Mathematical Foundations of Computer Science (MFCS), 26 - 31 Aug 2007, Cesky Krumlov, Czech Republic.

[img]

Wasilewski, M., Hasselbring, W. and Nowotka, D. (2013) Defining requirements on domain-specific languages in model-driven software engineering of safety-critical systems [Paper] In: Zertifizierung und modellgetriebene Entwicklung sicherer Software (ZeMoSS), 26 Feb - 1 Mar 2013, Aachen, Germany.

Conference presentation


Benini, M., Nowotka, D. and Kalvala, S. (1998) Holly - An Approach to Object Code Verification [Talk] In: 5th Annual Automated Reasoning Workshop (ARW): Bridging the Gap between Theory and Practice, 30 - 31 March 1998, St. Andrews, UK.

[img]

Bischoff, B. and Nowotka, D. (2010) Word periods under involution [Talk] In: Oberwolfach Mini-Workshop Combinatorics on Words, 22 - 28 Aug 2010, Oberwolfach, Germany.

[img]

Diekert, V., Harju, T. and Nowotka, D. (2006) Factorizations of Cyclic Words [Talk] In: Workshop on Words and Automata at CSR, 7 June 2006, St. Petersburg.

Conference poster

[img]

Avallone, A., Benini, M. and Nowotka, D. (1999) Constructive Methods in Automatic Analysis of Correctness Proofs [Poster] In: Workshop on Logic-based Program Synthesis and Transformation (LOPSTR), 22 - 24 Sep 1999, Venice, Italy.

Other


Harju, T. and Nowotka, D. (2004) A091838 OEIS Foundation, On-Line Encyclopedia of Integer Sequences (OEIS).


Harju, T. and Nowotka, D. (2004) A099766 OEIS Foundation, On-Line Encyclopedia of Integer Sequences (OEIS).

This list was generated on Wed Jun 28 12:41:38 2017 CEST.