Imagen de Portada

Composition Machines: Programming Self-Organising Software Models for the Emergence of Sequential Program Spaces

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Arellanes, Damian
Formato:	Preprint
Publicado:	2021
Materias:	Formal Languages and Automata Theory Artificial Intelligence F.1.1; I.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

AI-Oracle Machines for Intelligent Computing
por: Wang, Jie
Publicado: (2024)

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

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

Complex Event Recognition with Symbolic Register Transducers: Extended Technical Report
por: Alevizos, Elias, et al.
Publicado: (2024)

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

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

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

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

The Inclusion Depth of Pattern Languages: An Open Problem in Algorithmic Learning Theory
por: Luo, Wei
Publicado: (2026)

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

Exploring VASS Parameterised by Geometric Dimension
por: Czerwiński, Wojciech, et al.
Publicado: (2026)

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

Separability in Büchi Vass and Singly Non-Linear Systems of Inequalities
por: Baumann, Pascal, et al.
Publicado: (2024)

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)

Flattability of Priority Vector Addition Systems
por: Guttenberg, Roland
Publicado: (2024)

Checking Timed Bisimilarity with Virtual Clocks
por: Lieb, Alexander, et al.
Publicado: (2024)

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

Polynomial Bounds of CFLOBDDs against BDDs
por: Zhi, Xusheng, et al.
Publicado: (2024)

Dynamically Reprogrammable Runtime Monitors for Bounded-time MTL
por: Hebballi, Chirantan, et al.
Publicado: (2026)

Identity Testing for Stochastic Languages
por: Agarwal, Smayan, et al.
Publicado: (2025)

Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata
por: Bojańczyk, Mikołaj, et al.
Publicado: (2021)

Specifying and Verifying the Convergence Stairs of the Collatz Program
por: Ebnenasir, Ali
Publicado: (2024)

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

Geometric Characterization of Context-Free Intersections via the Inner Segment Dichotomy
por: Silva, Jorge Miguel
Publicado: (2026)

On Direct Product and Quotient of Strongly Connected Automata
por: Hu, Zino H.
Publicado: (2011)

Decidability Issues for Petri Nets -- a survey
por: Esparza, Javier, et al.
Publicado: (2024)

Exploring Large Language Models for Access Control Policy Synthesis and Summarization
por: Vatsa, Adarsh, et al.
Publicado: (2025)

On Repetitive Finite Automata with Translucent Words
por: Mráz, František, et al.
Publicado: (2025)

On the Boolean Closure of Deterministic Top-Down Tree Automata
por: Löding, Christof, et al.
Publicado: (2024)

On Minimization and Learning of Deterministic $ω$-Automata in the Presence of Don't Care Words
por: Löding, Christof, et al.
Publicado: (2022)

Recognizing Numbers
por: Gaba, Pranshu, et al.
Publicado: (2025)

Lexicographic transductions of finite words
por: Filiot, Emmanuel, et al.
Publicado: (2025)

Probabilistic Finite Automaton Emptiness is undecidable
por: Rote, Günter
Publicado: (2024)

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
por: Rote, Günter
Publicado: (2024)

Tilt Automata: Gathering Particles With Uniform External Control
por: Fekete, Sándor P., et al.
Publicado: (2026)

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

Inversion by Partial Evaluation: A Reversible Interpreter Experiment
por: Glück, Robert, et al.
Publicado: (2024)

Preprint: Exploring Inevitable Waypoints for Unsolvability Explanation in Hybrid Planning Problems
por: Sarwar, Mir Md Sajid, et al.
Publicado: (2025)