Search CORE

6 research outputs found

Marked D0L systems and the 2n-conjecture

Author: Honkala Juha
Publication venue: Elsevier B.V.
Publication date
Field of study

AbstractWe show that to test the equivalence of two D0L sequences over an n-letter alphabet generated by marked morphisms it suffices to compare the first 2n+1 initial terms of the sequences. Under an additional condition it is enough to consider the 2n initial terms

Elsevier - Publisher Connector

D0L sequence equivalence is in $P$ for fixed alphabets

Author: Ruohonen Keijo
Publication venue
Publication date: 01/01/2008
Field of study

Numérisation de Documents Anciens Mathématiques

35th Symposium on Theoretical Aspects of Computer Science: STACS 2018, February 28-March 3, 2018, Caen, France

Author: STACS
Publication venue: Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
Publication date: 01/02/2018
Field of study

Digitale Bibliothek Thüringen

LIPIcs, Volume 261, ICALP 2023, Complete Volume

Author: Etessami Kousha
Feige Uriel
Puppis Gabriele
Publication venue: LIPIcs - Leibniz International Proceedings in Informatics. 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Publication date: 01/01/2023
Field of study

LIPIcs, Volume 261, ICALP 2023, Complete Volum

Dagstuhl Research Online Publication Server

Subject Index Volumes 1–200

Author
Publication venue: Published by Elsevier B.V.
Publication date
Field of study

Elsevier - Publisher Connector