1 citations · 1 across the 4 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2026
Nominal Automata with Name Deallocation
Simon Prucker, Stefan Milius, Lutz Schröder
Data words with binders formalize concurrently allocated memory. Most name-binding mechanisms in formal languages, such as the -calculus, adhere to properly nested scoping. In c…
cs.FL2024
Nominal Tree Automata With Name Allocation
Simon Prucker, Lutz Schröder
Data trees serve as an abstraction of structured data, such as XML documents. A number of specification formalisms for languages of data trees have been developed, many of them adh…