Talks

Invited talks:

4.

5th Logic Mentoring Workshop (LMW 2020, affiliated to LICS 2020 and ICALP 2020)
Saarbrücken, Germany (online), 07.2020:
“Combinatorics on Words (through the Word-Equations-lens)”.

3.

12th International Conference on Combinatorics on Words, WORDS 2019
Loughborough, UK, 09.2019:
“Matching Patterns with Variables”.

2.

Anniversary Conference Faculty of Sciences 150 years, University of Bucharest
Bucharest, Romania, 08.2013:
“Hidden structures in words”.

1.

21. Theorietag der Fachgruppe “Automaten und Formale Sprachen” 2011
Allrode im Harz, Germany, 09.2011:
“Turing Machines Deciding According to the Shortest Computations and Deciding Networks of Evolutionary Processors”.

Conference talks:

40.

Highlights of Logic, Games and Automata
HIGHLIGHTS 2020, online, 09.2020:
”Efficiently Testing Simon's Congruence”.

39.

International Colloquium on Automata, Languages, and Programming
ICALP 2019, Patras, Greece, 07.2019:
”Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number”.

38.

International Symposium on Theoretical Aspects of Computer Science
STACS 2019, Berlin, Germany, 02.2019:
“Fast and Longest Rollercoasters”.

37.

International Colloquium on Automata, Languages, and Programming
ICALP 2018, Prague, Czech Republic, 07.2018:
”Rollercoasters and Caterpillars”.

36.

European Workshop on Computational Geometry
EuroCG 2018, Berlin, Germany, 03.2018:
“Rollercoasters: Long Sequences without Short Runs”.

35.

International Symposium on Theoretical Aspects of Computer Science
STACS 2016, Orleans, France, 02.2016:
“Efficiently Finding All Maximal α-gapped Repeats”.

34.

International Conference on Developments in Language Theory
DLT 2015, Liverpool, UK, 07.2015:
“Unary Patterns under Permutations”.

33.

International Symposium on Fundamentals of Computation Theory
FCT 2015, Gdansk, Poland, 08.2015:
“Longest α-gapped Repeat and Palindrome”.

32.

International Symposium on Mathematical Foundations of Computer Science
MFCS 2015, Milan, Italy, 08.2015:
“Longest Gapped Repeats and Palindromes”.

31.

International Conference on WORDS 2015,
WORDS 2015 Kiel, Germany 09.2015:
“Prefix-Suffix Square Completion”.

30.

International Symposium on Theoretical Aspects of Computer Science
STACS 2014, Lyon, France, 03.2014:
“Testing Generalised Freeness of Words”.

29.

International Conference Implementation and Application of Automata
CIAA 2014, Gießen, Germany, 08.2014:
“Bounded Duplication Languages”.

28.

International Symposium on Mathematical Foundations of Computer Science
MFCS 2014, Budapest, Hungary, 08.2014:
“Generalised Lyndon-Schützenberger Equations”.

27.

International Symposium on Theoretical Aspects of Computer Science
STACS 2013, Kiel, Germany, 02.2013:
“Finding pseudo-repetitions”.

26.

Computability in Europe
CiE 2013, Milan, Italy, 07.2013:
“Discovering Hidden Repetitions in Words”.

25.

Computability in Europe
CiE 2012, Cambridge, UK, 06.2012:
“Connecting Partial Words and Regular Languages”.

24.

International Symposium on Mathematical Foundations of Computer Science
MFCS 2012, Bratislava, Slovakia, 08.2012:
“Fine and Wilf Theorem and Pseudo-repetitions”.

23.

International Conference on Unconventional and Natural Computation
UCNC 2012, Orleans, France, 09.2012:
“String Matching with Involutions”.

22.

International Conference on Unconventional Computation
UC 2011, Turku, Finland, 06.2011:
“On Normal Forms for Networks of Evolutionary Processors”.

21.

International Workshop on Descriptional Complexity of Formal Systems
DCFS 2011, Limburg, Germany, 07.2011:
“k-Local Internal Contextual Grammars”.

20.

International Workshop on Descriptional Complexity of Formal Systems
DCFS 2011, Limburg, Germany, 07.2011:
“On Contextual Grammars with Subregular Selection Languages”.

19.

Computability in Europe
CiE 2011, Sofia, Bulgaria, 07.2011:
“Deciding according to the shortest computations”.

18.

Workshop on Non-Classical Models for Automata and Applications
NCMA 2011, Milan, Italy, 08.2011:
“Generating Networks of Evolutionary Processors”.

17.

International Conference on Developments in Language Theory
DLT 2011, Milan, Italy, 08.2011:
“Deciding Networks of Evolutionary Processors”.

16.

International Symposium on Mathematical Foundations of Computer Science
MFCS 2011, Warsaw, Poland, 08.2011:
“Periodicity Algorithms for Partial Words”.

15.

International Conference on Language and Automata Theory and Applications
LATA 2010, Trier, Germany, 05.2010:
“Hard Counting Problems for Partial Words”.

14.

Computability in Europe
CiE 2010, Ponta Delgada, Portugal, 07.2010:
“Hairpin Lengthening”.

13.

International Conference on Agents and Artificial Intelligence
ICAART 2009, Porto, Portugal, 01.2009:
“Accepting Networks of Evolutionary Processors: Complexity Aspects. Recent Results and New Challenges”.

12.

International Conference on Developments in Language Theory
DLT 2009, Stuttgart, Germany, 07.2009:
“Some Remarks on Superposition Based on Watson-Crick-like Complementarity”.

11.

International Workshop on Descriptional Complexity of Formal Systems
DCFS 2009, Magdeburg, Germany, 07.2009:
“Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections”.

10.

International Symposium on Fundamentals of Computation Theory
FCT 2009, Wroclaw, Poland, 09.2009:
”Combinatorial Queries and Updates on Partial Words”.

9.

International Conference on Unconventional Computation
UC 2009, Ponta Delgada, Portugal, 09.2009:
“Networks of Evolutionary Picture Processors With Filtered Connections”.

8.

International Conference on Automata and Formal Languages
AFL 2008, Balatonfüred, Hungary, 05.2008:
“Some Remarks on the Hairpin Completion”.

7.

Computability in Europe
CiE 2007, Siena, Italy, 06.2007:
“Hairpin Completion Versus Hairpin Reduction”.

6.

International Conference on Machines, Computations, and Universality
MCU 2007, Orleans, France, 09.2007:
“Accepting Networks of Splicing Processors With Filtered Connections”.

5.

International Conference on Automata and Formal Languages
AFL 2005, Dobogókö, Hungary, 05.2004:
“A CYK-based parser for Local Internal Contextual Grammars with Context-Free choice”.

4.

Computability in Europe
CiE 2005, Amsterdam, The Netherlands, 06.2005:
“Accepting Networks of Splicing Processors”.

3.

European Conference on Artificial Intelligence Workshop on Symbolic Networks,
ECAI 2004 W05, Valencia, Spain, 08.2004:
“Using AHNEPs in the Recognition of Context Free Languages”.

2.

International Conference on Machines, Computations, and Universality
MCU 2004, Sankt Petersburg, Russia, 09.2004:
“Solving 3CNF-SAT and HPP in Linear Time Using WWW”.

1.

European Summer School in Logic, Language and Information Student Session
ESSLLI 2003 Student Session, Vienna, Austria, 08.2003:
“Contextual Grammars and Go Through Automata”.

Invitation-only workshop talks:

3.

Dagstuhl Seminar on Combinatorics and Algorithmics of Strings,
Schloß Dagstuhl, 03.2015.
“Testing k-binomial equivalence”.

2.

Second workshop “Representing Streams”
Lorentz Center, Leiden, The Netherlands, 01.2014:
“Pseudo-repetitions: combinatorics and stringology results”.

1.

Workshop on Challenges in Combinatorics on Words,
Fields Institute, Toronto. Canada, 04.2013.
“Discovering hidden repetitions in words”.

Workshop talks:

16.

30. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Vienna, Austria, 09.2020:
“On the structure of solution sets to regular word equations”.

15.

29. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Bremen, Germany, 09.2019:
“Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number”.

14.

28. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Wittenberg, Germany, 09.2018:
“The Satisfiability of Word Equations: Decidable and Undecidable Theories”.

13.

28. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Wittenberg, Germany, 09.2018:
“On Matching Repetitive Patterns”.

12.

27. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Bonn, Germany, 09.2017:
“On Matching Restricted Patterns with Variables”.

11.

74. Workshop über Algorithmen und Komplexität, und
Lübeck, Germany, 11.2017:
“Local Patterns”.

10.

25. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Speyer, Germany, 10.2015:
“Longest Gapped Repeats and Palindromes”.

9.

67. Theorietag über Algorithmen und Komplexität
Kiel, Germany, 05.2014:
“Finding generalised periodicities in words”.

8.

24. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Potsdam, Germany, 09.2014:
“News on the Square Conjecture”.

7.

68. Theorietag über Algorithmen und Komplexität
Jena, Germany, 11.2014:
“Pattern matching with variables: fast algorithms and new hardness results”.

6.

23. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Illmenau, Germany, 09.2013:
“Discovering hidden repetitions in words”.

5.

22. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Prague, Czech Republic, 10.2012:
“Finding Pseudo-Repetitions”.

4.

21. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Allrode im Harz, Germany, 09.2011:
“On Periodic Partial Words”.

3.

21. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Allrode im Harz, Germany, 09.2011:
“Algorithms and Pseudo-Periodicity in Words”.

2.

20. Theorietag der Fachgruppe “Automaten und Formale Sprachen”
Kassel, Germany, 09.2010:
“Algorithmic Results on Hairpin Completion and Lengthening”.

1.

Optimal Discrete Structures and Algorithms
ODSA 2010, Rostock, Germany, 09.2010:
“Two ways to construct partial words, seen from a combinatorics on words perspective”.

Invited seminar talks:

9.

Verification Seminar,
Oxford University, Oxford, UK, 10.2019:
“Matching Patterns with Variables”.

8.

Theoretical Computer Science Seminar,
Loughborough University, Loughborough, UK, 10.2019:
“Rollercoasters and Caterpillars”.

7.

Theoretical Computer Science Seminar,
University of Bucharest, Bucharest, Romania, 09.2019:
“Rollercoasters and Caterpillars”.

6.

AlgoLab, Department of Computer Science,
University of Milano-Bicocca, Milan, Italy, 04.2017:
“Matching Patterns with Variables”.

5.

Algorithms and Bioinformatics Group,
King’s College, London, UK, 01.2015:
“Finding generalised periodicities in words”.

4.

Logics Group,
Institute of Mathematics of the Romanian Academy, Bucharest, Romania, 06.2014:
“Finding generalised periodicities in words”.

3.

Computational Biomodelling Laboratory,
Åbo Akademi, Turku, Finland, 06.2011:
“Turing Machines Deciding According to the Shortest Computations”.

2.

Research Group on Mathematical Linguistics - GRLMC,
University of Tarragona, Spain, 07.2006
“Networks of Evolutionary processors: Computability and Complexity”,
“A Generalization of the Assignment Problem”.

1.

Research Group on Mathematical Linguistics - GRLMC,
University of Tarragona, Spain, 08.2004
“Using AHNEPs in the Recognition of Context Free Languages”.