Zobrazeno 1 - 10
of 416
pro vyhledávání: '"68Q70"'
Autor:
Puch, Antoni, Smertnig, Daniel
We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup representations by
Externí odkaz:
http://arxiv.org/abs/2410.03444
We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining graph. Furtherm
Externí odkaz:
http://arxiv.org/abs/2409.11335
Autor:
Lopez, Aliaume
A fundamental construction in formal language theory is the Myhill-Nerode congruence on words, whose finitedness characterizes regular language. This construction was generalized to functions from $\Sigma^*$ to $\mathbb{Z}$ by Colcombet, Dou\'eneau-T
Externí odkaz:
http://arxiv.org/abs/2409.07882
We define a new class of groups arising from context-free inverse graphs. We provide closure properties, prove that their co-word problems are context-free, study the torsion elements, and realize them as subgroups of the asynchronous rational group.
Externí odkaz:
http://arxiv.org/abs/2408.13070
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
The bandwidth of timed automata characterizes the quantity of information produced/transmitted per time unit. We previously delimited 3 classes of TA according to the nature of their asymptotic bandwidth: meager, normal, and obese. In this paper, we
Externí odkaz:
http://arxiv.org/abs/2406.12694
Publikováno v:
In LICS'24: Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, ACM, 2024, Article No.: 2, Pages 1-13
We propose a local, past-oriented fragment of propositional dynamic logic to reason about concurrent scenarios modelled as Mazurkiewicz traces, and prove it to be expressively complete with respect to regular trace languages. Because of locality, spe
Externí odkaz:
http://arxiv.org/abs/2405.11308
Autor:
Bondarenko, Ievgen
Let $\mathrm{WP}_G$ denote the word problem in a finitely generated group $G$. We consider the complexity of $\mathrm{WP}_G$ with respect to standard deterministic Turing machines. Let $\mathrm{DTIME}_k(t(n))$ be the complexity class of languages sol
Externí odkaz:
http://arxiv.org/abs/2403.11148
The definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(\Sigma\Sigma)^*$ has period two because the length of a recursion (cycle) i
Externí odkaz:
http://arxiv.org/abs/2403.05088
Gaussian binomial coefficients are q-analogues of the binomial coefficients of integers. On the other hand, binomial coefficients have been extended to finite words, i.e., elements of the finitely generated free monoids. In this paper we bring togeth
Externí odkaz:
http://arxiv.org/abs/2402.05838