activity
20092026
most citedSimulation vs. Equivalence

13 citations · 46 across the 14 of their papers we have counts for

collaborators

15 papers

cs.CR2026

Process-Mining of Hypertraces: Enabling Scalable Formal Security Verification of (Automotive) Network Architectures

Julius Figge, David Knuplesch, Andreas Maletti +1

The automotive domain is transitioning: vehicles act as rolling servers, persistently connected to numerous external entities. This connectivity, combined with rising on-board comp…

cs.FL2023★ 1 cited

Weighted HOM-Problem for Nonnegative Integers

Andreas Maletti, Andreea-Teodora Nász, Erik Paul

The HOM-problem asks whether the image of a regular tree language under a given tree homomorphism is again regular. It was recently shown to be decidable by Godoy, Giménez, Ramos,…

cs.FL2023★ 1 cited

Weighted Tree Automata with Constraints

Andreas Maletti, Andreea-Teodora Nász

The HOM problem, which asks whether the image of a regular tree language under a given tree homomorphism is again regular, is known to be decidable [Godoy & Giménez: The HOM proble…

cs.FL2022★ 3 cited

Strong Equivalence of TAG and CCG

Andreas Maletti, Lena Katharina Schiffer

Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressiv…

cs.FL2017★ 6 cited

Recurrent Neural Networks as Weighted Language Recognizers

Yining Chen, Sorcha Gilroy, Andreas Maletti +2

We investigate the computational complexity of various problems for simple recurrent neural networks (RNNs) as formal models for recognizing weighted languages. We focus on the sin…

cs.FL2017

Multiple Context-Free Tree Grammars: Lexicalization and Characterization

Joost Engelfriet, Andreas Maletti, Sebastian Maneth

Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous ca…