Regularity Problems for Visibly Pushdown Languages

@inproceedings{Brny2006RegularityPF,
  title={Regularity Problems for Visibly Pushdown Languages},
  author={Vince B{\'a}r{\'a}ny and Christof L{\"o}ding and Olivier Serre},
  booktitle={STACS},
  year={2006}
}
  • Vince Bárány, Christof Löding, Olivier Serre
  • Published in STACS 2006
  • Computer Science
  • Visibly pushdown automata are special pushdown automata whose stack behavior is driven by the input symbols according to a partition of the alphabet. We show that it is decidable for a given visibly pushdown automaton whether it is equivalent to a visibly counter automaton, i.e. an automaton that uses its stack only as counter. In particular, this allows to decide whether a given visibly pushdown language is a regular restriction of the set of well-matched words, meaning that the language can… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 29 CITATIONS

    Learning Visibly One-Counter Automata in Polynomial Time

    VIEW 4 EXCERPTS
    CITES METHODS & BACKGROUND
    HIGHLY INFLUENCED

    Querying languages over sliding windows

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Invisible Pushdown Languages

    • Eryk Kopczynski
    • Computer Science, Mathematics
    • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    • 2016
    VIEW 1 EXCERPT
    CITES BACKGROUND

    Schema Validation via Streaming Circuits

    VIEW 2 EXCERPTS
    CITES BACKGROUND

    A new algorithm for the determinisation of visibly pushdown automata

    VIEW 1 EXCERPT

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 17 REFERENCES