Tree Automata

swMATH28835MaRDI QIDQ40549FDOQ40549

Author name not available (Why is that?)

Cited In (3)

• Applying Data Refinement for Monadic Programs to Hopcroft’s Algorithm
• Automatic refinement to efficient data structures: a comparison of two approaches
• Reachability, confluence, and termination analysis with state-compatible automata

This page was built for software: Tree Automata