Results 11 to 20 of about 58,184 (331)
Graph Tilings in Incompatibility Systems
SIAM Journal on Discrete Mathematics, 2023 An \emph{incompatibility system} $(G,\mathcal{F})$ consists of a graph $G$ and a family $\mathcal{F}=\{F_v\}_{v\in V(G)}$ over $G$ with $F_v\subseteq \{\{e,e'\}\in {E(G)\choose 2}: e\cap e'=\{v\}\}$. We say that two edges $e,e'\in E(G)$ are \emph{incompatible} if $\{e,e'\}\in F_v$ for some $v\in V(G)$, and otherwise \emph{compatible}. A subgraph $H$ of
Jie Hu, Hao Li, Yue Wang, Donglei Yang
openaire +2 more sources
Conjugacies for Tiling Dynamical Systems [PDF]
Communications in Mathematical Physics, 2004 We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions, including the Penrose and pinwheel systems, we show that substitutions are invertible and that conjugacies are ...
Holton, Charles +2 more
openaire +2 more sources
Glial Tiling in the Insect Nervous System [PDF]
Frontiers in Cellular Neuroscience, 2022 The Drosophila nervous system comprises a small number of well characterized glial cell classes. The outer surface of the central nervous system (CNS) is protected by a glial derived blood-brain barrier generated by perineurial and subperineurial glia. All neural stem cells and all neurons are engulfed by cortex glial cells.
Nicole Pogodalla +2 more
openaire +3 more sources
Cell Reports, 2016 Simple cell-cell interactions can give rise to complex cellular patterns. For example, neurons of the same type can interact to create a complex patchwork of non-overlapping dendrite arbors, a pattern known as dendrite tiling.
Zhiqi Candice Yip, Maxwell G. Heiman
doaj +1 more source
Ideal and Predictable Hit Ratio for Matrix Transposition in Data Caches
Mathematics, 2020 Matrix transposition is a fundamental operation, but it may present a very low and hardly predictable data cache hit ratio for large matrices. Safe (worst-case) hit ratio predictability is required in real-time systems.
Alba Pedro-Zapater +4 more
doaj +1 more source
Snake-Deterministic Tiling Systems [PDF]
, 2009 The concept of determinism, while clear and well assessed for string languages, is still matter of research as far as picture languages are concerned. We introduce here a new kind of determinism, called snake, based on the boustrophedonic scanning strategy, that is a natural scanning strategy used by many algorithms on 2D arrays and pictures.
Violetta Lonati, Matteo Pradella
openaire +3 more sources
Tiling Systems versus Tile Rewriting Grammars
Theoretical Computer Science, 2006 Two formal models of pictures, i.e., two dimensional (2D) languages are compared: tiling systems and tile rewriting grammars, which resp. extend to 2D the regular and context-free languages. Two results extending classical language properties into 2D are proved. First, non-recursive tile writing grammars (TRG) coincide with tiling systems (TS). Second,
A Cherubini +3 more
openaire +4 more sources
Test generation from recursive tile systems [PDF]
Software Testing, Verification and Reliability, 2012 SUMMARYThis paper explores the generation of conformance test cases for recursive tile systems (RTSs) in the framework of the classical ioco testing theory. The RTS model allows the description of reactive systems with recursion and is very similar to other models like pushdown automata, hyperedge replacement grammars or recursive state machines.
Chédor, Sébastien +2 more
openaire +5 more sources
L-Convex Polyominoes are Recognizable in Real Time by 2D Cellular Automata [PDF]
, 2015 A polyomino is said to be L-convex if any two of its cells are connected by a 4-connected inner path that changes direction at most once. The 2-dimensional language representing such polyominoes has been recently proved to be recognizable by tiling ...
AR Smith III +6 more
core +2 more sources
The Symbolic Dynamics Of Multidimensional Tiling Systems [PDF]
, 2003 We prove a multidimensional version of the theorem that every shift of finite type has a power that can be realized as the same power of a tiling system.
Coven, E. M. +3 more
core +2 more sources