Daniel Tischner

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We consider the problem of state-space reduction for nondeterministic weakly-hierarchical visibly pushdown automata (Vpa). Vpa recognize a robust and algorithmically tractable fragment of context-free languages that is natural for modeling programs. We define an equivalence relation that is sufficient for language-preserving quotienting of Vpa. Our(More)
We present an algorithm, which reduces the size of Büchi automata using fair simulation. Its time complexity is O(|Q|4 · |∆|2), the space complexity is O(|Q| · |∆|). Simulation is a common approach for minimizing ω-automata such as Büchi automata. Direct simulation, delayed simulation and fair simulation are different types of simulation. As we will show,(More)
  • 1