@inproceedings{https___doi.org_10.4230_lipics.time.2025.5,
    doi = {10.4230/lipics.time.2025.5},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.5},
    author = {Bruse, Florian},
    keywords = {Timed Automata, Higher-Order Recursion Schemes, Tree Automata, Tail Recursion, Theory of computation → Timed and hybrid models, Theory of computation → Tree languages, Theory of computation → Automata over infinite objects},
    language = {en},
    title = {Higher-Order Timed Automata and Tail Recursion},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2025},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-11-11 14:53:58 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.time.2025.5, doi = {10.4230/lipics.time.2025.5}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2025.5}, author = {Bruse, Florian}, keywords = {Timed Automata, Higher-Order Recursion Schemes, Tree Automata, Tail Recursion, Theory of computation → Timed and hybrid models, Theory of computation → Tree languages, Theory of computation → Automata over infinite objects}, language = {en}, title = {Higher-Order Timed Automata and Tail Recursion}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2025}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-11-11 14:53:58 +0100} }