×

Found 213 Documents (Results 1–100)

A near time-optimal population protocol for self-stabilizing leader election on rings with a poly-logarithmic number of states. (English) Zbl 07824304

Oshman, Rotem (ed.) et al., Proceedings of the 42nd ACM symposium on principles of distributed computing, PODC ’23, Orlando, FL, USA, June 19–23, 2023. New York, NY: Association for Computing Machinery (ACM). 2-12 (2023).
MSC:  68M14 68W15

A tight upper bound on the length of maximal bordered box repetition-free words. (English) Zbl 1529.68245

Bordihn, Henning (ed.) et al., Descriptional complexity of formal systems. 25th IFIP WG 1.02 international conference, DCFS 2023, Potsdam, Germany, July 4–6, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13918, 181-196 (2023).
MSC:  68R15
Full Text: DOI

Clusters of repetition roots: single chains. (English) Zbl 1490.68172

Bureš, Tomáš (ed.) et al., SOFSEM 2021: theory and practice of computer science. 47th international conference on current trends in theory and practice of computer science, SOFSEM 2021, Bolzano-Bozen, Italy, January 25–29, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12607, 400-409 (2021).
MSC:  68R15

On avoding \(r\)-repetitions in \(\mathbb R^2\). (English) Zbl 1378.05055

Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 331-337 (2017).
MSC:  05C15
Full Text: DOI

Forty years of text indexing. (English) Zbl 1381.68067

Fischer, Johannes (ed.) et al., Combinatorial pattern matching. 24th annual symposium, CPM 2013, Bad Herrenalb, Germany, June 17–19, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38904-7/pbk). Lecture Notes in Computer Science 7922, 1-10 (2013).

Automatic theorem-proving in combinatorics on words. (English) Zbl 1297.68215

Moreira, Nelma (ed.) et al., Implementation and application of automata. 17th international conference, CIAA 2012, Porto, Portugal, July 17–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31605-0/pbk). Lecture Notes in Computer Science 7381, 180-191 (2012).
MSC:  68T15 68Q45 68R15

An answer to a conjecture on overlaps in partial words using periodicity algorithms. (English) Zbl 1234.68197

Dediu, Adrian Horia (ed.) et al., Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2–8, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00981-5/pbk). Lecture Notes in Computer Science 5457, 188-199 (2009).
MSC:  68Q45
Full Text: DOI

Counting ordered patterns in words generated by morphisms. (English) Zbl 1156.68512

Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13–19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-88281-7/pbk). Lecture Notes in Computer Science 5196, 287-298 (2008).
MSC:  68R15

Filter Results by …

Access

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software