Single-Rooted DAGs in Regular DAG Languages: Parikh Image and Path Languages
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
The problem with probabilistic DAG automata for semantic graphs
Semantic representations in the form of directed acyclic graphs (DAGs) have been introduced in recent years, and to model them, we need probabilistic models of DAGs. One model that has attracted some attention is the DAG…
Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
Rooted phylogenetic networks, or more generally, directed acyclic graphs (DAGs), are widely used to model species or gene relationships that traditional rooted trees cannot fully capture, especially in the presence of re…
Logical Languages Accepted by Transformer Encoders with Hard Attention
We contribute to the study of formal languages that can be recognized by transformer encoders. We focus on two self-attention mechanisms: (1) UHAT (Unique Hard Attention Transformers) and (2) AHAT (Average Hard Attention…
Hard AttentionCausal Discovery with a Mixture of DAGs
Causal processes in biomedicine may contain cycles, evolve over time or differ between populations. However, many graphical models cannot accommodate these conditions. We propose to model causation using a mixture of dir…
Causal DiscoveryCausal InferencePermutation Matching Under Parikh Budgets: Linear-Time Detection, Packing, and Disjoint Selection
We study permutation (jumbled/Abelian) pattern matching over a general alphabet $Σ$. Given a pattern P of length m and a text T of length n, the classical task is to decide whether T contains a length-m substring whose P…