59 citations · 185 across the 53 of their papers we have counts for
Showing 2024Show all
2 papers · 1 filter
cs.FL2024
Alternating Nominal Automata with Name Allocation
Florian Frank, Daniel Hausmann, Stefan Milius +2
Formal languages over infinite alphabets serve as abstractions of structures and processes carrying data. Automata models over infinite alphabets, such as classical register automa…
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…