Imagen de Portada

Networks of Moore Machines

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Yodaiken, Victor
Formato:	Preprint
Publicado:	2015
Materias:	Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Digital Circuits as Moore Machines
por: Yodaiken, Victor
Publicado: (2010)

Standard Automata Theory and Process Algebra
por: Yodaiken, Victor
Publicado: (2022)

State machines for large scale computer software and systems
por: Yodaiken, Victor
Publicado: (2016)

Notes on Stack Machines and Quantum Stack Machines
por: Qiu, Daowen
Publicado: (2025)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
por: Schwartz, Daniel G.
Publicado: (2025)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
por: Leys, Tim, et al.
Publicado: (2024)

Active Inference of Extended Finite State Machine Models with Registers and Guards
por: Groz, Roland, et al.
Publicado: (2026)

Counting Abstraction for the Verification of Structured Parameterized Networks
por: Bozga, Marius, et al.
Publicado: (2025)

Passive Learning of Lattice Automata from Recurrent Neural Networks
por: Slimi, Jaouhar, et al.
Publicado: (2025)

Verifying Parameterized Networks Specified by Vertex-Replacement Graph Grammars
por: Iosif, Radu, et al.
Publicado: (2025)

Designing and Comparing RPQ Semantics
por: Marsault, Victor, et al.
Publicado: (2026)

Self-Replicating Mechanical Universal Turing Machine
por: Lano, Ralph P.
Publicado: (2024)

WEX: Formal Specifications for Windows in Stream Processing
por: Hitarth, S, et al.
Publicado: (2022)

The Expansion Problem for Infinite Trees
por: Blumensath, Achim
Publicado: (2023)

A General Information Extraction Framework Based on Formal Languages
por: Schmid, Markus L.
Publicado: (2025)

Finite Automata for Efficient Graph Recognition
por: Drewes, Frank, et al.
Publicado: (2024)

Statistical process discovery
por: Cry, Pierre, et al.
Publicado: (2025)

Reasoning about Rare-Event Reachability in Stochastic Vector Addition Systems via Affine Vector Spaces
por: Jeppson, Joshua, et al.
Publicado: (2025)

Hyper pattern matching
por: Waga, Masaki, et al.
Publicado: (2025)

Input-Driven Pushdown Automata with Translucent Input Letters
por: Kutrib, Martin, et al.
Publicado: (2025)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
por: Akshay, S., et al.
Publicado: (2024)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
por: Kan, Shuanglong, et al.
Publicado: (2025)

Componentwise Automata Learning for System Integration (Extended Version)
por: Fujinami, Hiroya, et al.
Publicado: (2025)

Universality Frontier for Asynchronous Cellular Automata
por: Baburin, Ivan, et al.
Publicado: (2025)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
por: Lehaut, Mathieu, et al.
Publicado: (2026)

One-clock synthesis problems
por: Lasota, Sławomir, et al.
Publicado: (2026)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
por: Mazowiecki, Filip, et al.
Publicado: (2025)

Infinite-state Games with Energy Objectives Beyond Counters
por: Sağlam, Irmak, et al.
Publicado: (2026)

Nondeterministic state complexity of square root
por: Onishchenko, Sergey
Publicado: (2026)

Forgetting Event Order in Higher-Dimensional Automata
por: Zouari, Safa
Publicado: (2026)

Eilenberg theorems for many-sorted formations
por: Vidal, Juan Climent, et al.
Publicado: (2016)

Resynchronized Uniformization and Definability Problems for Rational Relations
por: Löding, Christof, et al.
Publicado: (2021)

Correctness Notions for Petri Nets with Identifiers
por: van der Werf, Jan Martijn E. M., et al.
Publicado: (2022)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
por: Chen, Zeyu, et al.
Publicado: (2026)

A Formal Approach for Tuning Stochastic Oscillators
por: Ballarini, Paolo, et al.
Publicado: (2024)

A Tree Sampler for Bounded Context-Free Languages
por: Considine, Breandan
Publicado: (2024)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
por: Hausmann, Daniel, et al.
Publicado: (2024)

Structural Reductions and Stutter Sensitive Properties
por: Paviot-Adet, Emmanuel, et al.
Publicado: (2022)

Frequency Automata: A novel formal model of hybrid systems in combined time and frequency domains
por: Kim, Moon, et al.
Publicado: (2025)

Castor Ministerialis
por: Hercher, Christian
Publicado: (2025)