Image de couverture de livre

On the Computational Power of Particle Methods

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Pahlke, Johannes, Sbalzarini, Ivo F.
Format:	Preprint
Publié:	2023
Sujets:	Formal Languages and Automata Theory Numerical Analysis
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Backward Responsibility in Transition Systems Using General Power Indices
par: Baier, Christel, et autres
Publié: (2024)

Non-Global Parikh Tree Automata
par: Herrmann, Luisa, et autres
Publié: (2024)

On the Expressive Power of Regular Expressions with Backreferences
par: Nogami, Taisei, et autres
Publié: (2023)

On Decidability and Expressive Power of Fusion Grammars
par: Pshenitsyn, Tikhon
Publié: (2023)

The Power-Set Construction for Tree Algebras
par: Blumensath, Achim
Publié: (2022)

Computational Complexity of Alignments
par: Schwanen, Christopher T., et autres
Publié: (2026)

Responsibility in Actor-Based Systems
par: Baier, Christel, et autres
Publié: (2024)

Computational Model for Parsing Expression Grammars
par: Rubtsov, Alexander, et autres
Publié: (2024)

Temporal Causal Models as a Model of Computation
par: Gladyshev, Maksim, et autres
Publié: (2026)

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
par: Principato, Flavio T., et autres
Publié: (2025)

Computing measures of weak-MSO definable sets of trees
par: Niwiński, Damian, et autres
Publié: (2024)

The Power of Hard Attention Transformers on Data Sequences: A Formal Language Theoretic Perspective
par: Bergsträßer, Pascal, et autres
Publié: (2024)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
par: Schwartz, Daniel G.
Publié: (2025)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
par: Becker, Ruben, et autres
Publié: (2024)

Fast and General Automatic Differentiation for Finite-State Methods
par: Yang, Lucas Ondel, et autres
Publié: (2026)

Backward Responsibility in Transition Systems Beyond Safety
par: Baier, Christel, et autres
Publié: (2025)

An Automata-Based Method to Formalize Psychological Theories -- The Case Study of Lazarus and Folkman's Stress Theory
par: Finkel, Alain, et autres
Publié: (2025)

Quantum finite automata and linear context-free languages: a decidable problem
par: Bertoni, A., et autres
Publié: (2013)

The Complexity of Aggregates over Extractions by Regular Expressions
par: Doleschal, Johannes, et autres
Publié: (2020)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
par: Bell, Jason P., et autres
Publié: (2022)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
par: Zahraei, Pardis Sadat, et autres
Publié: (2024)

Motion Planning for Automata-based Objectives using Efficient Gradient-based Methods
par: Balakrishnan, Anand, et autres
Publié: (2024)

The Expansion Problem for Infinite Trees
par: Blumensath, Achim
Publié: (2023)

Mata, a Fast and Simple Finite Automata Library (Technical Report)
par: Chocholatý, David, et autres
Publié: (2023)

Simulation Limitations of Affine Cellular Automata
par: Hudcová, Barbora, et autres
Publié: (2023)

Safety and Liveness of Quantitative Properties and Automata
par: Boker, Udi, et autres
Publié: (2023)

Note on dissecting power of regular languages
par: Rukavicka, Josef
Publié: (2023)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
par: Lacroce, Clara, et autres
Publié: (2023)

Checking History-Determinism is NP-hard for Parity Automata
par: Prakash, Keya
Publié: (2023)

Closure Properties of General Grammars -- Formally Verified
par: Dvorak, Martin, et autres
Publié: (2023)

A Linear-time Simulation of Deterministic $d$-Limited Automata
par: Rubtsov, Alexander
Publié: (2023)

Reset thresholds of transformation monoids
par: Rystsov, Igor, et autres
Publié: (2023)

Closure and Decision Properties for Higher-Dimensional Automata
par: Amrane, Amazigh, et autres
Publié: (2023)

Deciding Linear Height and Linear Size-to-Height Increase for Macro Tree Transducers
par: Gallot, Paul, et autres
Publié: (2023)

Constructing Deterministic Parity Automata from Positive and Negative Examples
par: Bohn, León, et autres
Publié: (2023)

Black-box Testing Liveness Properties of Partially Observable Stochastic Systems
par: Esparza, Javier, et autres
Publié: (2023)

Deciding whether an Attributed Translation can be realized by a Top-Down Transducer
par: Maneth, Sebastian, et autres
Publié: (2023)

Adding Reconfiguration to Zielonka's Asynchronous Automata
par: Lehaut, Mathieu, et autres
Publié: (2023)

A Unified Model for Real-Time Systems: Symbolic Techniques and Implementation
par: Akshay, S, et autres
Publié: (2023)

Invariants and Home Spaces in Transition Systems and Petri Nets
par: Memmi, Gerard
Publié: (2023)