Corpus ID: 218486803

Synchronization of Deterministic Visibly Push-Down Automata

@article{Fernau2020SynchronizationOD,
  title={Synchronization of Deterministic Visibly Push-Down Automata},
  author={H. Fernau and Petra Wolf},
  journal={ArXiv},
  year={2020},
  volume={abs/2005.01374}
}
  • H. Fernau, Petra Wolf
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • We generalize the concept of synchronizing words for finite automata, which map all states of the automata to the same state, to deterministic visibly push-down automata. Here, a synchronizing word w does not only map all states to the same state but also fulfills some conditions on the stack content of each run after reading w. We consider three types of these stack constraints: after reading w, the stack (1) is empty in each run, (2) contains the same sequence of stack symbols in each run, or… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES
    Visibly pushdown languages
    518
    Complexity of input-driven pushdown automata
    29
    Decision procedures for families of deterministic pushdown automata
    55
    Synchronization of Pushdown Automata
    27
    Synchronizing Data Words for Register Automata
    5
    Reset Sequences for Monotonic Automata
    218
    Finite-Turn Pushdown Automata
    111