Synchronizing Deterministic Push-Down Automata Can Be Really Hard

@article{Fernau2020SynchronizingDP,
  title={Synchronizing Deterministic Push-Down Automata Can Be Really Hard},
  author={H. Fernau and Petra Wolf and T. Yamakami},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.01381}
}
  • H. Fernau, Petra Wolf, T. Yamakami
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • The question if a deterministic finite automaton admits a software reset in the form of a so-called synchronizing word can be answered in polynomial time. In this paper, we extend this algorithmic question to deterministic automata beyond finite automata. We prove that the question of synchronizability becomes undecidable even when looking at deterministic one-counter automata. This is also true for another classical mild extension of regularity, namely that of deterministic one-turn push-down… CONTINUE READING
    Synchronization of Deterministic Visibly Push-Down Automata
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 43 REFERENCES
    Synchronization of Deterministic Visibly Push-Down Automata
    1
    Decision procedures for families of deterministic pushdown automata
    55
    Synchronizing Data Words for Register Automata
    5
    Visibly pushdown languages
    518
    Synchronization of Pushdown Automata
    27
    Reset Sequences for Monotonic Automata
    218
    The Inclusion Problem for Simple Languages
    50