Florin Manea

Tomohiro I

Shunsuke Inenaga

Dominik Köppl

Theory Comput. Syst., 2018

On the Complexity of Solving Restricted Word Equations.

[BibT_eX]

[DOI]

Markus L. Schmid

Int. J. Found. Comput. Sci., 2018

The Satisfiability of Extended Word Equations: The Boundary Between Decidability and Undecidability.

[BibT_eX]

[DOI]

CoRR, 2018

The Satisfiability of Word Equations: Decidable and Undecidable Theories.

[BibT_eX]

[DOI]

Proceedings of the Reachability Problems - 12th International Conference, 2018

Rollercoasters and Caterpillars.

[BibT_eX]

[DOI]

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

On Matching Generalised Repetitive Patterns.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

TCS Special Issue on Languages and Combinatorics in Theory and Nature.

[BibT_eX]

[DOI]

György Vaszil

Theor. Comput. Sci., 2017

TCS Special Issue: Combinatorics on Words - WORDS 2015.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The extended equation of Lyndon and Schützenberger.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2017

Preface.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2017

Longest Gapped Repeats and Palindromes.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

Detecting One-Variable Patterns.

[BibT_eX]

[DOI]

Dmitry Kosolobov

Proceedings of the String Processing and Information Retrieval, 2017

The Hardness of Solving Simple Word Equations.

[BibT_eX]

[DOI]

Joel D. Day

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Local Patterns.

[BibT_eX]

[DOI]

Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016

Detecting Unary Patterns.

[BibT_eX]

[DOI]

Dmitry Kosolobov

CoRR, 2016

Efficiently Finding All Maximal alpha-gapped Repeats.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On the Solvability Problem for Restricted Classes of Word Equations.

[BibT_eX]

[DOI]

Markus L. Schmid

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

Factorizing a String into Squares in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015

Hairpin lengthening: language theoretic and algorithmic results.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

k-Abelian pattern matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Cubic patterns with permutations.

[BibT_eX]

[DOI]

Mike Müller

J. Comput. Syst. Sci., 2015

Bounded Prefix-Suffix Duplication: Language Theoretic and Algorithmic Results.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2015

On the Power of Accepting Networks of Evolutionary Processors with Special Topologies and Random Context Filters.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Efficiently Finding All Maximal $α$-gapped Repeats.

[BibT_eX]

[DOI]

CoRR, 2015

Testing k-binomial equivalence.

[BibT_eX]

[DOI]

Dominik D. Freydenberger

CoRR, 2015

Pattern Matching with Variables: Fast Algorithms and New Hardness Results.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

On Prefix/Suffix-Square Free Words.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2015

Longest Gapped Repeats and Palindromes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Longest α-Gapped Repeat and Palindrome.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 20th International Symposium, 2015

Unary Patterns with Permutations.

[BibT_eX]

[DOI]

James D. Currie

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Square-Density Increasing Mappings.

[BibT_eX]

[DOI]

Shinnosuke Seki

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Prefix-Suffix Square Completion.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Accepting Networks of Evolutionary Processors with Subregular Filters.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Prefix-suffix duplication.

[BibT_eX]

[DOI]

Jesús García-López

J. Comput. Syst. Sci., 2014

Regular languages of partial words.

[BibT_eX]

[DOI]

Inf. Sci., 2014

Inner Palindromic Closure.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

The pseudopalindromic completion of regular languages.

[BibT_eX]

[DOI]

Szilárd Zsolt Fazekas

Kayoko Shikishima-Tsuji

Inf. Comput., 2014

Syllabic Languages and Go-through Automata.

[BibT_eX]

[DOI]

Liviu P. Dinu

Fundam. Informaticae, 2014

An algorithmic toolbox for periodic partial words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Bounded Prefix-Suffix Duplication.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2014

Testing Generalised Freeness of Words.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

A Stronger Square Conjecture on Binary Words.

[BibT_eX]

[DOI]

Natasa Jonoska

Shinnosuke Seki

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Generalised Lyndon-Schützenberger Equations.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Two Variants of Synchronized Shuffle on Backbones.

[BibT_eX]

Henning Bordihn

Daniel-Claudian Voinescu

Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013

The hardness of counting full words compatible with partial words.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Networks of evolutionary processors: the power of subregular filters.

[BibT_eX]

[DOI]

Acta Informatica, 2013

Finding Pseudo-repetitions.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

On the Pseudoperiodic Extension of u^l = v^m w^n.

[BibT_eX]

[DOI]

Mike Müller

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

Discovering Hidden Repetitions in Words.

[BibT_eX]

[DOI]

Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012

Language classes generated by tree controlled grammars with bounded nonterminal complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Complexity results for deciding Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

On external contextual grammars with subregular selection languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Networks of evolutionary processors: computationally complete normal forms.

[BibT_eX]

[DOI]

Nat. Comput., 2012

On Subregular Selection Languages in Internal Contextual Grammars.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2012

Generating Networks of Splicing Processors.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2012

String Matching with Involutions.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation and Natural Computation, 2012

Fine and Wilf's Theorem and Pseudo-repetitions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

The Avoidability of Cubes under Permutations.

[BibT_eX]

[DOI]

Mike Müller

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

On Internal Contextual Grammars with Subregular Selection Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2012

Connecting Partial Words and Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the How the World Computes, 2012

Hairpin Lengthening and Shortening of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Languages Alive, 2012

2011

Complexity-preserving simulations among three variants of accepting networks of evolutionary processors.

[BibT_eX]

[DOI]

Nat. Comput., 2011

Bounded hairpin completion.

[BibT_eX]

[DOI]

Inf. Comput., 2011

On Normal Forms for Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation - 10th International Conference, 2011

Periodicity Algorithms for Partial Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Networks of Evolutionary Processors with Subregular Filters.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Deciding Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

<i>k</i>-Local Internal Contextual Grammars.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

On Contextual Grammars with Subregular Selection Languages.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

Deciding According to the Shortest Computations.

[BibT_eX]

[DOI]

Proceedings of the Models of Computation in Context, 2011

Context Insertions.

[BibT_eX]

[DOI]

Proceedings of the Computation, 2011

2010

A series of algorithmic results related to the iterated hairpin completion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

A New Characterization of NP, P, and PSPACE with Accepting Hybrid Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Maurice Margenstern

Mario J. Pérez-Jiménez

Theory Comput. Syst., 2010

Some Remarks on the Hairpin Completion.

[BibT_eX]

[DOI]

Takashi Yokomori

Int. J. Found. Comput. Sci., 2010

Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Small universal accepting hybrid networks of evolutionary processors.

[BibT_eX]

[DOI]

Remco Loos

Acta Informatica, 2010

Hard Counting Problems for Partial Words.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

Hairpin Lengthening.

[BibT_eX]

[DOI]

Proceedings of the Programs, Proofs, Processes, 6th Conference on Computability in Europe, 2010

Accepting Networks of Evolutionary Word and Picture Processors: A Survey.

[BibT_eX]

Proceedings of the Scientific Applications of Language Methods., 2010

2009

Two complementary operations inspired by the DNA hairpin formation: Completion and reduction.

[BibT_eX]

[DOI]

Takashi Yokomori

Theor. Comput. Sci., 2009

On small, reduced, and fast universal accepting networks of splicing processors.

[BibT_eX]

[DOI]

Remco Loos

Theor. Comput. Sci., 2009

On some algorithmic problems regarding the hairpin completion.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Small Universal Accepting Networks of Evolutionary Processors with Filtered Connections

[BibT_eX]

[DOI]

Remco Loos

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Networks of Evolutionary Picture Processors with Filtered Connections.

[BibT_eX]

[DOI]

Proceedings of the Unconventional Computation, 8th International Conference, 2009

Accepting Networks of Evolutionary Processors: Complexity Aspects - Recent Results and New Challenges.

[BibT_eX]

Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

Combinatorial Queries and Updates on Partial Words.

[BibT_eX]

[DOI]

Adrian Diaconu

Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Filter Position in Networks of Evolutionary Processors Does Not Matter: A Direct Proof.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing and Molecular Programming, 15th International Conference, 2009

Some Remarks on Superposition Based on Watson-Crick-Like Complementarity.

[BibT_eX]

[DOI]

José M. Sempere

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

On the Descriptional Complexity of Accepting Networks of Evolutionary Processors with Filtered Connections.

[BibT_eX]

[DOI]

Cezara Dragoi

Int. J. Found. Comput. Sci., 2008

2007

Erratum to: "Accepting networks of splicing processors: Complexity results" [Theoret. Comput. Sci. 371(2007) 72-82].

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Accepting networks of splicing processors: Complexity results.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Freeness of partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the size complexity of universal accepting hybrid networks of evolutionary processors.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2007

Accepting Networks of Evolutionary Processors with Filtered Connections.

[BibT_eX]

[DOI]

Cezara Dragoi

J. Univers. Comput. Sci., 2007

All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

On the recognition of context-free languages using accepting hybrid networks of evolutionary processors.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2007

A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem.

[BibT_eX]

[DOI]

Calina Ploscaru

Fundam. Informaticae, 2007

Accepting Networks of Splicing Processors with Filtered Connections.

[BibT_eX]

[DOI]

Juan Castellanos

Luis Fernando de Mingo López

Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

On the syllabification of words via go-through automata.

[BibT_eX]

Liviu Petrisor Dinu

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

Hairpin Completion Versus Hairpin Reduction.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

An efficient approach for the rank aggregation problem.

[BibT_eX]

[DOI]

Liviu Petrisor Dinu

Theor. Comput. Sci., 2006

Synchronized Shuffle on Backbones.

[BibT_eX]

[DOI]

Daniel-Claudian Voinescu

Fundam. Informaticae, 2006

All NP-Problems Can Be Solved in Polynomial Time by Accepting Networks of Splicing Processors of Constant Size.

[BibT_eX]

[DOI]

Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005

Parsing Local Internal Contextual Languages with Context-Free Choice.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

A Universal Accepting Hybrid Network of Evolutionary Processors.

[BibT_eX]

[DOI]

Proceedings of the First International Workshop on Developments in Computational Models, 2005

Timed Accepting Hybrid Networks of Evolutionary Processors.

[BibT_eX]

[DOI]

Proceedings of the Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach: First International Work-Conference on the Interplay Between Natural and Artificial Computation, 2005

Accepting Networks of Splicing Processors.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Solving 3CNF-SAT and HPP in Linear Time Using WWW.

[BibT_eX]

[DOI]