Imagen de Portada

A Framework for Universality in Physics, Computer Science, and Beyond

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gonda, Tomáš, Reinhart, Tobias, Stengele, Sebastian, Coves, Gemma De les
Formato:	Preprint
Publicado:	2023
Materias:	Computational Complexity Formal Languages and Automata Theory Logic in Computer Science Mathematical Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Invitation to Universality in Physics, Computer Science, and Beyond
por: Gonda, Tomáš, et al.
Publicado: (2024)

CMSO-transducing tree-like graph decompositions
por: Campbell, Rutger, et al.
Publicado: (2024)

Weighted basic parallel processes and combinatorial enumeration
por: Clemente, Lorenzo
Publicado: (2024)

Non-commutative linear logic fragments with sub-context-free complexity
por: Nishimiya, Yusaku, et al.
Publicado: (2025)

Nets-within-Nets through the Lens of Data Nets
por: Di Cosmo, Francesco, et al.
Publicado: (2025)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
por: Göller, Stefan, et al.
Publicado: (2023)

On Higher Order Busy Beaver Function
por: Cao, Zining
Publicado: (2025)

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter
por: Shakiba, Yousef, et al.
Publicado: (2025)

Stochastic Process Turing Machines
por: Wolpert, David, et al.
Publicado: (2024)

Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
por: Achilleos, Antonis, et al.
Publicado: (2024)

Reachability in Geometrically $d$-Dimensional VASS
por: Fu, Yuxi, et al.
Publicado: (2025)

The Complexity of Nested Reset Counter Systems
por: Balasubramanian, A. R., et al.
Publicado: (2026)

Counting and Sampling Traces in Regular Languages
por: de Colnet, Alexis, et al.
Publicado: (2025)

Cypher is Turing-Complete: A Formal Proof via 2-Counter Machine Simulation
por: Halftermeyer, Pierre
Publicado: (2026)

A positional $\mathbfΠ^0_3$-complete objective
por: Casares, Antonio, et al.
Publicado: (2024)

An Elementary Proof of the FMP for Kleene Algebra
por: Kappé, Tobias
Publicado: (2022)

Beyond Decisiveness of Infinite Markov Chains
por: Barbot, Benoît, et al.
Publicado: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
por: Das, Anupam, et al.
Publicado: (2024)

An algebraic theory of ω-regular languages, via μν-expressions
por: Das, Anupam, et al.
Publicado: (2025)

Cyclic system for an algebraic theory of alternating parity automata
por: Das, Anupam, et al.
Publicado: (2025)

The commutativity problem for effective varieties of formal series, and applications
por: Clemente, Lorenzo
Publicado: (2025)

Complete Compositional Syntax for Finite Transducers on Finite and Bi-Infinite Words
por: Carette, Titouan, et al.
Publicado: (2025)

Model Checking Temporal Properties of Recursive Probabilistic Programs
por: Winkler, Tobias, et al.
Publicado: (2021)

Synthesis of Computable Regular Functions of Infinite Words
por: Dave, V., et al.
Publicado: (2019)

Synthesizing Computable Functions from Rational Specifications over Infinite Words
por: Filiot, Emmanuel, et al.
Publicado: (2021)

Parikh Automata on Finite and Infinite Words
por: Grobler, Mario, et al.
Publicado: (2023)

Learning Verified Monitors for Hidden Markov Models
por: van der Maas, Luko, et al.
Publicado: (2025)

Tracy, Traces, and Transducers: Computable Counterexamples and Explanations for HyperLTL Model-Checking
por: Winter, Sarah, et al.
Publicado: (2024)

A Uniform Framework for Language Inclusion Problems
por: Doveri, Kyveli, et al.
Publicado: (2024)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
por: Chen, Yu-Fang, et al.
Publicado: (2025)

Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
por: Heck, Linus, et al.
Publicado: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
por: Li, Junle, et al.
Publicado: (2025)

Solving MDPs with LTLf+ and PPLTL+ Temporal Objectives
por: De Giacomo, Giuseppe, et al.
Publicado: (2025)

Fast Obligation Translation and Synthesis
por: Duret-Lutz, Alexandre, et al.
Publicado: (2026)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
por: Rooduijn, Jan, et al.
Publicado: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
por: Barloy, Corentin, et al.
Publicado: (2025)

Positive First-order Logic on Words and Graphs
por: Kuperberg, Denis
Publicado: (2022)

Function spaces for orbit-finite sets
por: Bojańczyk, Mikołaj, et al.
Publicado: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

The Complexity of Pure Strategy Relevant Equilibria in Concurrent Games
por: Bhaduri, Purandar
Publicado: (2025)