Zobrazeno 1 - 10
of 24 165
pro vyhledávání: '"p-automaton"'
Autor:
Rote, Günter
We construct a probabilistic finite automaton (PFA) with 7 states and an input alphabet of 5 symbols for which the PFA Emptiness Problem is undecidable. The only input for the decision problem is the starting distribution. For the proof, we use reduc
Externí odkaz:
http://arxiv.org/abs/2412.05198
Autor:
Lussi, Eduardo Willwock, de Sousa, Lucas Cavalcante, Marchi, Jerusa, de Santiago, Rafael, Duzzioni, Eduardo Inacio
Quantum finite automata can be used for pattern recognition. Present implementations on actual quantum devices face decoherence issues, which compromise the quality of long strings computation. In this work, we focus on the Measure Once 1-way Quantum
Externí odkaz:
http://arxiv.org/abs/2412.06977
Speculative decoding (SD) has been demonstrated as an effective technique for lossless LLM inference acceleration. Retrieval-based SD methods, one kind of model-free method, have yielded promising speedup, but they often rely on incomplete retrieval
Externí odkaz:
http://arxiv.org/abs/2411.10666
We construct a local decoder for the 2D toric code using ideas from the hierarchical classical cellular automata of Tsirelson and G\'acs. Our decoder is a circuit of strictly local quantum operations preserving a logical state for exponential time in
Externí odkaz:
http://arxiv.org/abs/2412.19803
Autor:
Fukś, Henryk, Soto, José Manuel Gómez
We propose a simple cellular automaton model of a self-healing system and investigate its properties. In the model, the substrate is a two-dimensional checkerboard configuration which can be damaged by changing values of a finite number of sites. The
Externí odkaz:
http://arxiv.org/abs/2410.13689
Many graph algorithms can be viewed as sets of rules that are iteratively applied, with the number of iterations dependent on the size and complexity of the input graph. Existing machine learning architectures often struggle to represent these algori
Externí odkaz:
http://arxiv.org/abs/2408.11042
Young's cellular automaton, recently applied to study the spatiotemporal evolution of binary patterns for favorable/hostile environments, has now been modified from a different point of view. In this model, each differentiated cell (DC) produces two
Externí odkaz:
http://arxiv.org/abs/2410.09624
The emergent dynamics in spacetime diagrams of cellular automata (CAs) is often organised by means of a number of behavioural classes. Whilst classification of elementary CAs is feasible and well-studied, non-elementary CAs are generally too diverse
Externí odkaz:
http://arxiv.org/abs/2409.02740
Autor:
Ba'ba'a, Hasan B. Al
Periodic lattices have been predominantly explored for decades, owing to their peculiar vibrational behavior. On the other hand, certain types of aperiodic lattices have enabled new phenomena that may not be otherwise attainable in periodic ones. In
Externí odkaz:
http://arxiv.org/abs/2407.12577
We extend the notion of activity for automaton semigroups and monoids introduced by Bartholdi, Godin, Klimann and Picantin to a more general setting. Their activity notion was already a generalization of Sidki's activity hierarchy for automaton group
Externí odkaz:
http://arxiv.org/abs/2406.20056