Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Sénizergues, Géraud"'
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 1, 2022) lmcs:7241
We study the matching problem of regular tree languages, that is, "$\exists \sigma:\sigma(L)\subseteq R$?" where $L,R$ are regular tree languages over the union of finite ranked alphabets $\Sigma$ and $\mathcal{X}$ where $\mathcal{X}$ is an alphabet
Externí odkaz:
http://arxiv.org/abs/2004.09926
Autor:
Cadilhac, Michaël, Mazowiecki, Filip, Paperman, Charles, Pilipczuk, Michał, Sénizergues, Géraud
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where (non)expres
Externí odkaz:
http://arxiv.org/abs/2002.08630
Autor:
Sénizergues, Géraud, Weiß, Armin
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our algorithm is n
Externí odkaz:
http://arxiv.org/abs/1802.07085
Autor:
Cadilhac, Michaël, Mazowiecki, Filip, Paperman, Charles, Pilipczuk, Michał, Sénizergues, Géraud
Publikováno v:
Theory of Computing Systems; Aug2024, Vol. 68 Issue 4, p593-614, 22p
We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse monoid has a
Externí odkaz:
http://arxiv.org/abs/1412.4737
Autor:
Sénizergues, Géraud
These proceedings are gathering twelve different research papers developping the theory of recognizability for various kinds of discrete objects: words. terms, graphs, etc...
Comment: Proceedings of the conference FREC 14 held in Marseille, 38-3
Comment: Proceedings of the conference FREC 14 held in Marseille, 38-3
Externí odkaz:
http://arxiv.org/abs/1411.5611
Autor:
Sénizergues, Géraud
We construct an example of proof within the main formal system from arXiv:1010.4760v3, which is intended to capture the bisimulation equivalence for non-deterministic first-order grammars, and show that its conclusion is semantically false. We then l
Externí odkaz:
http://arxiv.org/abs/1101.5046
Autor:
Durand, Irene, Senizergues, Geraud
For the whole class of linear term rewriting systems, we define \emph{bottom-up rewriting} which is a restriction of the usual notion of rewriting. We show that bottom-up rewriting effectively inverse-preserves recognizability and analyze the complex
Externí odkaz:
http://arxiv.org/abs/0903.2554
Publikováno v:
Logical Methods in Computer Science. 18
We study the matching problem of regular tree languages, that is, "$\exists \sigma:\sigma(L)\subseteq R$?" where $L,R$ are regular tree languages over the union of finite ranked alphabets $\Sigma$ and $\mathcal{X}$ where $\mathcal{X}$ is an alphabet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e0c1c7783390643bad1eaf2807c435cf
https://doi.org/10.46298/lmcs-18(1:25)2022
https://doi.org/10.46298/lmcs-18(1:25)2022
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.