English
Related papers

Related papers: Hypergraph Automata: A Theoretical Model for Patte…

200 papers

This study significantly advances multi-texture synthesis using Neural Cellular Automata (NCAs) by introducing a novel training methodology that enables robust self-regeneration of textures in damaged regions. This inherent healing…

Neural and Evolutionary Computing · Computer Science 2026-05-14 Mirela-Magdalena Catrina , Ioana Cristina Plajer , Alexandra Băicoianu

We present a strict separation between the class of "mismatch free" self-assembly systems and general aTAM systems. Mismatch free systems are those systems in which concurrently grown parts must always agree with each other. Tile…

Computational Geometry · Computer Science 2015-02-20 Florent Becker , Pierre-Étienne Meunier

With the rapid progress of LLMs, high quality generative text has become widely available as a cover for text steganography. However, prevailing methods rely on hand-crafted or pre-specified strategies and struggle to balance efficiency,…

Cryptography and Security · Computer Science 2025-10-09 Jiuan Zhou , Yu Cheng , Yuan Xie , Zhaoxia Yin

We introduce AutoGraph, a scalable autoregressive model for attributed graph generation using decoder-only transformers. By flattening graphs into random sequences of tokens through a reversible process, AutoGraph enables modeling graphs as…

Machine Learning · Computer Science 2025-12-09 Dexiong Chen , Markus Krimmel , Karsten Borgwardt

This paper presents a stochastic Wang tiling based technique to compress or reconstruct disordered microstructures on the basis of given spatial statistics. Unlike the existing approaches based on a single unit cell, it utilizes a finite…

Materials Science · Physics 2012-10-24 Jan Novák , Anna Kučerová , Jan Zeman

Let $\mathcal{P}(\Sigma^*)$ be the semiring of languages, and consider its subset $\mathcal{P}(\Sigma)$. In this paper we define the language recognized by a weighted automaton over $\mathcal{P}(\Sigma)$ and a one-letter alphabet.…

Formal Languages and Automata Theory · Computer Science 2010-07-27 Edoardo Carta-Gerardino , Parisa Babaali

This paper presents a novel method that allows a machine learning algorithm following the transformation-based learning paradigm \cite{brill95:tagging} to be applied to multiple classification tasks by training jointly and simultaneously on…

Computation and Language · Computer Science 2007-05-23 Radu Florian , Grace Ngai

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers

In this paper, we work in a 2D version of the probabilistic variant of Winfree's abstract Tile Assembly Model defined by Chandran, Gopalkrishnan and Reif (SICOMP 2012) in which attaching tiles are sampled uniformly with replacement. First,…

Data Structures and Algorithms · Computer Science 2024-08-13 David Furcy , Scott M. Summers

Deep generative models have been used in recent years to learn coherent latent representations in order to synthesize high-quality images. In this work, we propose a neural network to learn a generative model for sampling consistent indoor…

Computer Vision and Pattern Recognition · Computer Science 2020-08-24 Pulak Purkait , Christopher Zach , Ian Reid

Language models and conversational systems are growing increasingly advanced, creating outputs that may be mistaken for humans. Consumers may thus be misled by advertising, media reports, or vagueness regarding the role of automation in the…

Human-Computer Interaction · Computer Science 2020-06-12 Justin Edwards , Allison Perrone , Philip R. Doyle

Several old and recent classes of picture grammars, that variously extend context-free string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such grammars can be unified and extended using a tiling based…

Formal Languages and Automata Theory · Computer Science 2011-01-11 Matteo Pradella , Alessandra Cherubini , Stefano Crespi Reghizzi

The increasing complexity of modern configurable systems makes it critical to improve the level of automation in the process of system configuration. Such automation can also improve the agility of the development cycle, allowing for rapid…

Formal Languages and Automata Theory · Computer Science 2021-08-20 Nestan Tsiskaridze , Maxwell Strange , Makai Mann , Kavya Sreedhar , Qiaoyi Liu , Mark Horowitz , Clark Barrett

We introduce layered automata, a subclass of alternating parity automata that generalises deterministic automata. Assuming a consistency property, these automata are history deterministic and 0-1 probabilistic. We show that every…

Formal Languages and Automata Theory · Computer Science 2026-01-23 Antonio Casares , Christof Löding , Igor Walukiewicz

Minimizing the size of finite automata is a fundamental problem in theoretical computer science. Beyond standard minimization, further reductions can be achieved by decomposing an automaton into smaller components whose languages combine…

Formal Languages and Automata Theory · Computer Science 2026-04-29 Mathias Berry , Pierre-Cyrille Héam , Ismaël Jecker

We study languages over infinite alphabets equipped with some structure that can be tested by recognizing automata. We develop a framework for studying such alphabets and the ensuing automata theory, where the key role is played by an…

Logic in Computer Science · Computer Science 2015-07-01 Mikołaj Bojańczyk , Bartek Klin , Sławomir Lasota

State-of-the-art text-to-image models produce visually impressive results but often struggle with precise alignment to text prompts, leading to missing critical elements or unintended blending of distinct concepts. We propose a novel…

Computer Vision and Pattern Recognition · Computer Science 2026-01-21 Paul Grimal , Michaël Soumm , Hervé Le Borgne , Olivier Ferret , Akihiro Sugimoto

This contribution belongs to a combinatorial approach to hyperbolic geometry and it is aimed at possible applications to computer simulations. It is based on the splitting method which was introduced by the author and which is reminded in…

Computational Geometry · Computer Science 2011-11-09 Maurice Margenstern

One emerging approach for the fabrication of complex architectures on the nanoscale is to utilize particles customized to intrinsically self-assemble into a desired structure. Inverse methods of statistical mechanics have proven…

Materials Science · Physics 2017-09-08 R. B. Jadrich , B. A. Lindquist , T. M. Truskett

We investigate the role of nondeterminism in Winfree's abstract Tile Assembly Model (aTAM), which was conceived to model artificial molecular self-assembling systems constructed from DNA. Of particular practical importance is to find tile…

Computational Complexity · Computer Science 2010-11-29 Nathaniel Bryans , Ehsan Chiniforooshan , David Doty , Lila Kari , Shinnosuke Seki
‹ Prev 1 3 4 5 6 7 10 Next ›