AI Chat AI Image Generator AI Video Text to Speech

On synchronization of partial automata

04/19/2020

∙

by Jakub Ruszil, et al.

∙

∙

A goal of this paper is to introduce the new construction of an automaton with shortest synchronizing word of length O(d^n/d), where d ∈ℕ and n is the number of states for that automaton. Additionally we introduce new transformation from any synchronizable DFA or carefully synchronizable PFA of n states to carefully synchronizable PFA of d · n states with shortest synchronizing word of length Ω(d^n/d).

page 1

page 2

page 3

page 4

research

∙ 07/03/2022

An Improved Algorithm for Finding the Shortest Synchronizing Words

A synchronizing word of a deterministic finite complete automaton is a w...

0 Marek Szykuła, et al. ∙

research

∙ 07/28/2022

Short Synchronizing Words for Random Automata

We prove that a uniformly random automaton with n states on a 2-letter a...

0 Guillaume Chapuy, et al. ∙

research

∙ 12/17/2019

New Bounds on Antipowers in Binary Words

Fici et al. defined a word to be a k-power if it is the concatenation of...

0 Lukas Fleischer, et al. ∙

research

∙ 05/04/2020

Synchronization of Deterministic Visibly Push-Down Automata

We generalize the concept of synchronizing words for finite automata, wh...

0 Henning Fernau, et al. ∙

research

∙ 02/02/2023

Asymmetric Cryptosystem Using Careful Synchronization

We present public-private key cryptosystem which utilizes the fact that ...

0 Jakub Ruszil, et al. ∙

research

∙ 10/04/2019

Synchronization under Dynamic Constraints

Imagine an assembly line where a box with a lid and liquid in it enters ...

0 Petra Wolf, et al. ∙

research

∙ 06/16/2018

Finding Short Synchronizing Words for Prefix Codes

We study the problems of finding a shortest synchronizing word and its l...

0 Andrew Ryzhikov, et al. ∙