Imagen de Portada

Tilt Automata: Gathering Particles With Uniform External Control

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fekete, Sándor P., Friemel, Jonas, Kramer, Peter, Reinhardt, Jan-Marc, Rieck, Christian, Scheffer, Christian
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry Formal Languages and Automata Theory F.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Drainability and Fillability of Polyominoes in Diverse Models of Global Control
por: Fekete, Sándor P., et al.
Publicado: (2025)

Active Automata Learning with Advice
por: Fica, Michał, et al.
Publicado: (2025)

Learning Tree Automata with Term Rewriting
por: Kopystiański, Jakub, et al.
Publicado: (2026)

Jump Complexity of Deterministic Finite Automata with Translucent Letters
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2025)

Efficient Reconfiguration of Tile Arrangements by a Single Active Robot
por: Becker, Aaron T., et al.
Publicado: (2025)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain
por: Fekete, Sándor P., et al.
Publicado: (2024)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
por: Krishnamoorthy, Abhishek, et al.
Publicado: (2025)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform External Forces
por: Becker, Aaron T., et al.
Publicado: (2024)

Efficiently Reconfiguring a Connected Swarm of Labeled Robots
por: Fekete, Sándor P., et al.
Publicado: (2022)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons
por: Fekete, Sándor P., et al.
Publicado: (2024)

Implementation of Polynomial NP-Complete Algorithms Based on the NP Verifier Simulation Framework
por: Lee, Changryeol
Publicado: (2026)

A Uniform Framework for Problems on Context-Free Grammars
por: Esparza, Javier, et al.
Publicado: (2024)

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces
por: Arellanes, Damian
Publicado: (2021)

Various Types of Comet Languages and their Application in External Contextual Grammars
por: Ködding, Marvin, et al.
Publicado: (2024)

Construction of Minkowski Sums by Cellular Automata
por: Tahay, Pierre-Adrien
Publicado: (2024)

Guarding Offices with Maximum Dispersion
por: Fekete, Sándor P., et al.
Publicado: (2025)

On some Classes of Reversible 2-head Automata
por: Nagy, Benedek, et al.
Publicado: (2025)

Finite Automata Encoding Piecewise Polynomials
por: Berdinsky, Dmitry, et al.
Publicado: (2021)

Techniques for Showing the Decidability of the Boundedness Problem of Language Acceptors
por: Ibarra, Oscar H., et al.
Publicado: (2024)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
por: Grabmayer, Clemens
Publicado: (2024)

Subsequence Matching and Analysis Problems for Formal Languages
por: Fazekas, Szilárd Zsolt, et al.
Publicado: (2024)

A Theory of Hanoi Omega-Automata and Games
por: Filiot, Emmanuel, et al.
Publicado: (2026)

Automata with Timers
por: Bruyère, Véronique, et al.
Publicado: (2023)

Turn Complexity of Context-free Languages, Pushdown Automata and One-Counter Automata
por: Pighizzini, Giovanni
Publicado: (2026)

Deterministic Suffix-reading Automata
por: Keerthan, R, et al.
Publicado: (2024)

Regular Expressions with Backreferences: Polynomial-Time Matching Techniques
por: Schmid, Markus L.
Publicado: (2019)

On the Connectivity of the Flip Graph of Plane Spanning Paths
por: Kleist, Linda, et al.
Publicado: (2024)

Tile Reconfiguration by a Finite Automaton
por: Friemel, Jonas, et al.
Publicado: (2025)

Learning Realtime One-Counter Automata
por: Bruyère, Véronique, et al.
Publicado: (2021)

On Constructing Finite Automata by Relational Programming
por: Egri-Nagy, Attila, et al.
Publicado: (2025)

FSM Builder: A Tool for Writing Autograded Finite Automata Questions
por: Robson, Eliot Wong, et al.
Publicado: (2024)

Parameterized Verification of Timed Networks with Clock Invariants
por: André, Étienne, et al.
Publicado: (2024)

Parsing Hypergraphs using Context-Free Positional Grammars
por: Costagliola, Gennaro, et al.
Publicado: (2026)

The Word Problem for Finitary Automaton Groups
por: Kotowsky, Maximilian, et al.
Publicado: (2023)

Around Context-Free Grammars -- a Normal Form, a Representation Theorem, and a Regular Approximation
por: Cojocaru, Liliana
Publicado: (2015)

Reachability for Multi-Priced Timed Automata with Positive and Negative Rates
por: Scoones, Andrew, et al.
Publicado: (2024)

Equivalence of Deterministic Weighted Real-time One-Counter Automata
por: Mathew, Prince, et al.
Publicado: (2024)

Temporally Non-Uniform Cellular Automata: Surjectivity, Reversibility and Cyclic Behavior
por: Paul, Subrata, et al.
Publicado: (2024)

Computing Maximal Repeating Subsequences in a String
por: Gong, Mingyang, et al.
Publicado: (2026)

The Target Discounted-Sum Problem
por: Boker, Udi, et al.
Publicado: (2025)