Zobrazeno 1 - 5
of 5
pro vyhledávání: '"20-06"'
Post's Correspondence Problem (the PCP) is a classical decision problem in theoretical computer science that asks whether for pairs of free monoid morphisms $g, h\colon\Sigma^*\to\Delta^*$ there exists any non-trivial $x\in\Sigma^*$ such that $g(x)=h
Externí odkaz:
http://arxiv.org/abs/2211.12158
Autor:
Ciobanu, Laura, Logan, Alan D.
The Post Correspondence Problem is a classical decision problem about equalisers of free monoid homomorphisms. We prove connections between several variations of this classical problem, but in the setting of free groups and free group homomorphisms.
Externí odkaz:
http://arxiv.org/abs/2104.05772
Autor:
Ciobanu, Laura, Logan, Alan D.
Publikováno v:
47th International Colloquium on Automata, Languages, and Programming (ICALP 2020), volume 168, pp. 120:1-120:16
A marked free monoid morphism is a morphism for which the image of each generator starts with a different letter, and immersions are the analogous maps in free groups. We show that the (simultaneous) PCP is decidable for immersions of free groups, an
Externí odkaz:
http://arxiv.org/abs/2002.07574
We present detailed summaries of the talks that were given during a week-long workshop on Arithmetic Groups at the Banff International Research Station in April 2013. The vast majority of these reports are based on abstracts that were kindly provided
Externí odkaz:
http://arxiv.org/abs/1309.5125
Autor:
Ralf Gramlich
Publikováno v:
Innov. Incidence Geom. 9, no. 1 (2009), 123-175
Geometric methods in the theory of Chevalley groups and their generalisations have made tremendous advances during the last few decades. Among the most noteworthy and influential of these advances are the systematic application of the concept of amal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51e3d72c8660b4a232028c3e7471ed43
https://doi.org/10.2140/iig.2009.9.123
https://doi.org/10.2140/iig.2009.9.123
