Zobrazeno 1 - 10
of 64
pro vyhledávání: '"F.4.m"'
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
Autor:
Neuper, Walther
Publikováno v:
EPTCS 400, 2024, pp. 120-138
The paper presents the second part of a precise description of the prototype that has been developed in the course of the ISAC project over the last two decades. This part describes the "specify-phase", while the first part describing the "solve-phas
Externí odkaz:
http://arxiv.org/abs/2404.05462
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable by giving a reduction from Post's Correspondence Problem. This construction seems to be quite versatile and we also immediately obtain that the prob
Externí odkaz:
http://arxiv.org/abs/2402.01372
We consider numbers of the form $S_\beta(\boldsymbol{u}):=\sum_{n=0}^\infty \frac{u_n}{\beta^n}$ for $\boldsymbol{u}=\langle u_n \rangle_{n=0}^\infty$ a Sturmian sequence over a binary alphabet and $\beta$ an algebraic number with $|\beta|>1$. We sho
Externí odkaz:
http://arxiv.org/abs/2308.13657
Publikováno v:
In: Bordihn, H., Tran, N., Vaszil, G. (eds) Descriptional Complexity of Formal Systems. DCFS 2023. Lecture Notes in Computer Science, vol 13918. Springer, Cham
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the uniform word pro
Externí odkaz:
http://arxiv.org/abs/2302.10670
Autor:
Gajda, Michał J.
Publikováno v:
Analytics in Finance and Risk Management 2024
Can we infer sources of errors from outputs of the complex data analytics software? Bidirectional programming promises that we can reverse flow of software, and translate corrections of output into corrections of either input or data analysis. This a
Externí odkaz:
http://arxiv.org/abs/2301.12583
Autor:
Rodaro, Emanuele, Wächter, Jan Philipp
Publikováno v:
RIMS K\^oky\^uroku 2229 (2022) 11-20
We give a survey on results regarding self-similar and automaton presentations of free groups and semigroups and related products. Furthermore, we discuss open problems and results with respect to algebraic decision problems in this area.
Externí odkaz:
http://arxiv.org/abs/2205.10248
Epistemic modals have peculiar logical features that are challenging to account for in a broadly classical framework. For instance, while a sentence of the form $p\wedge\Diamond\neg p$ ('$p$, but it might be that not $p$') appears to be a contradicti
Externí odkaz:
http://arxiv.org/abs/2203.02872
Publikováno v:
Fundamenta Informaticae, Volume 186, Issues 1-4: Trakhtenbrot's centenary (October 21, 2022) fi:8962
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial function.
Externí odkaz:
http://arxiv.org/abs/2106.12846
Autor:
Pinna, G. Michele
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 4 (December 2, 2021) lmcs:6950
The execution of an event in a complex and distributed system where the dependencies vary during the evolution of the system can be represented in many ways, and one of them is to use Context-Dependent Event structures. Event structures are related t
Externí odkaz:
http://arxiv.org/abs/2012.00118