Results 21 to 30 of about 5,181 (248)
Infinite and Bi-infinite Words with Decidable Monadic Theories [PDF]
We study word structures of the form $(D,
Kuske, Dietrich +2 more
core +2 more sources
On representing recursively enumerable languages by internal contextual languages
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andrzej Ehrenfeucht +2 more
openaire +1 more source
Separating the Classes of Recursively Enumerable Languages Based on Machine Size [PDF]
In the late nineteen sixties it was observed that the r.e. languages form an infinite proper hierarchy [Formula: see text] based on the size of the Turing machines that accept them. We examine the fundamental position of the finite languages and their complements in the hierarchy.
Jan van Leeuwen, Jirí Wiedermann
openaire +4 more sources
Modal Logics of Topological Relations [PDF]
Logical formalisms for reasoning about relations between spatial regions play a fundamental role in geographical information systems, spatial and constraint databases, and spatial reasoning in AI.
A. Artale and E. Franconi +34 more
core +2 more sources
One and Two Polarizations, Membrane Creation and Objects Complexity in P Systems [PDF]
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursively enumerable sets of vectors of non-negative integers, even when no region ...
Alhazov, Artiom +2 more
core
Systematic Exploration of 3D Concrete Printing Parameters for Conformal Printing on Sloped Surfaces
A conformal slicing algorithm is developed for robotic 3D concrete printing (3DCP) on sloped surfaces as a first step toward printing slab‐on‐grade foundations on uneven terrain. Systematic experiments quantify the effects of nozzle speed, extrusion rate, and toolpath direction on filament dimension and stability.
Paniz Farrokhsiar +2 more
wiley +1 more source
On Measuring Non-Recursive Trade-Offs
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.
A. Malcher +29 more
core +4 more sources
We introduce AutomataGPT, a generative pretrained transformer (GPT) trained on synthetic spatiotemporal data from 2D cellular automata to learn symbolic rules. Demonstrating strong performance on both forward and inverse tasks, AutomataGPT establishes a scalable, domain‐agnostic framework for interpretable modeling, paving the way for future ...
Jaime A. Berkovich +2 more
wiley +1 more source
Solid Harmonic Wavelet Bispectrum for Image Analysis
The Solid Harmonic Wavelet Bispectrum (SHWB), a rotation‐ and translation‐invariant descriptor that captures higher‐order (phase) correlations in signals, is introduced. Combining wavelet scattering, bispectral analysis, and group theory, SHWB achieves interpretable, data‐efficient representations and demonstrates competitive performance across texture,
Alex Brown +3 more
wiley +1 more source
The Small-Is-Very-Small Principle
The central result of this paper is the small-is-very-small principle for restricted sequential theories. The principle says roughly that whenever the given theory shows that a property has a small witness, i.e.
Kaye R. +5 more
core +1 more source

