Zobrazeno 1 - 10
of 67 135
pro vyhledávání: '"formål"'
L-systems can be made to model and create simulations of many biological processes, such as plant development. Finding an L-system for a given process is typically solved by hand, by experts, in a hugely time-consuming process. It would be significan
Externí odkaz:
http://arxiv.org/abs/2411.19906
Autor:
Paul, Subrata, Das, Sukanta
In this work, we propose a variant of non-uniform cellular automata, named as Temporally Non-Uniform Cellular Automata (t-NUCAs), which temporally use two rules, $f$ and $g$ in a sequence $\mathcal{R}$. To observe reversibility in t-NUCAs, we study t
Externí odkaz:
http://arxiv.org/abs/2411.17421
Matrix grammars are one of the first approaches ever proposed in regulated rewriting, prescribing that rules have to be applied in a certain order. Originally, they have been introduced by \'Abrah\'am on linguistic grounds. In traditional regulated r
Externí odkaz:
http://arxiv.org/abs/2411.15338
Publikováno v:
EPTCS 412, 2024, pp. 19-34
We revisit the problem of synchronisability for communicating automata, i.e., whether the language of send messages for an asynchronous system is the same as the language of send messages with a synchronous communication. The un/decidability of the p
Externí odkaz:
http://arxiv.org/abs/2411.14580
Autor:
Radionova, Maria, Okhotin, Alexander
In this paper, different variants of reversible finite automata are compared, and their hierarchy by the expressive power is established. It is shown that one-way reversible automata with multiple initial states (MRFA) recognize strictly more languag
Externí odkaz:
http://arxiv.org/abs/2411.14538
Autor:
Kocsis, Bálint, Rot, Jurriaan
Conformance testing of automata is about checking the equivalence of a known specification and a black-box implementation. An important notion in conformance testing is that of a complete test suite, which guarantees that if an implementation satisfy
Externí odkaz:
http://arxiv.org/abs/2411.13412
Publikováno v:
29th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2024)
Executable QR codes, also known as eQR codes or just sQRy, are a special kind of QR codes that embed programs conceived to run on mobile devices like smartphones. Since the program is directly encoded in binary form within the QR code, it can be exec
Externí odkaz:
http://arxiv.org/abs/2411.13400
Autor:
Caltais, Georgiana, Di Giusto, Cinzia
Publikováno v:
EPTCS 412, 2024
This volume contains the proceedings of EXPRESS/SOS 2024: the Combined 31st International Workshop on Expressiveness in Concurrency and the 21st Workshop on Structural Operational Semantics, which was held in Calgary, Canada, as an affiliated worksho
Externí odkaz:
http://arxiv.org/abs/2411.13318
Autor:
Grazzi, Riccardo, Siems, Julien, Franke, Jörg K. H., Zela, Arber, Hutter, Frank, Pontil, Massimiliano
Linear Recurrent Neural Networks (LRNNs) such as Mamba, RWKV, GLA, mLSTM, and DeltaNet have emerged as efficient alternatives to Transformers in large language modeling, offering linear scaling with sequence length and improved training efficiency. H
Externí odkaz:
http://arxiv.org/abs/2411.12537
Autor:
van Spaendonck, P. H. M.
Behavioral models are incredibly useful for understanding and validating software. However, the automatic extraction of such models from actual industrial code remains a largely unsolved problem with current solutions often not scaling well with the
Externí odkaz:
http://arxiv.org/abs/2411.12386