Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Achille Frigeri"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Automata, Logic and Semantics (2017)
A finite deterministic (semi)automaton A = (Q, Σ, δ) is k-compressible if there is some word w ∈ Σ + such that theimage of its state set Q under the natural action of w is reduced by at least k states. Such word w, if it exists, is calleda k-com
Externí odkaz:
https://doaj.org/article/afb41477d6e347789f7008623380789e
Autor:
Christian Choffrut, Achille Frigeri
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 12 no. 1, Iss Automata, Logic and Semantics (2010)
Automata, Logic and Semantics
Externí odkaz:
https://doaj.org/article/d02c4e906712430b9264f963162c3aad
Autor:
Achille Frigeri, Alessandra Cherubini
Publikováno v:
Semigroup Forum. 98:571-588
The notion of semigroups with apartness has been introduced recently as a constructive counterpart of classical semigroups. On such structures, a constructive analogue of the isomorphism theorem has been proved, and quasiorder relations and related s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::64ad45e60de24091b502c8ff0a114f77
https://doi.org/10.1007/s00233-019-10019-y
https://doi.org/10.1007/s00233-019-10019-y
Publikováno v:
International Journal of Algebra and Computation. 31:983-984
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af549f783955a97ed5ba6ffc90ec4bb7
https://doi.org/10.1142/s021819672102001x
https://doi.org/10.1142/s021819672102001x
Publikováno v:
Electronic Notes in Discrete Mathematics. 40:265-269
Let \({(N, \Phi)}\) be a finite circular Ferrero pair. We define the disk with center b and radius \({a, \mathcal{D}(a;b)}\), as $$\mathcal{D} (a; b) = \{x \in \Phi(r)+c \mid r \neq 0, b\in \Phi (r)+c, |(\Phi (r)+c) \cap ( \Phi(a)+b)|=1\}.$$ Using th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7ddec01b279de90cc683aa6a4dd461a
https://doi.org/10.1016/j.endm.2013.05.047
https://doi.org/10.1016/j.endm.2013.05.047
In the past years, the adoption of adaptive systems has increased in many fields of computer science, such as databases and software engineering. These systems are able to automatically react to events by collecting information from the external envi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::764ab889632493d14377a9128607567d
http://hdl.handle.net/11311/1063814
http://hdl.handle.net/11311/1063814
Let \({(N, \Phi)}\) be a finite circular Ferrero pair. We define the disk with center b and radius \({a, \mathcal{D}(a;b)}\), as $$\mathcal{D} (a; b) = \{x \in \Phi(r)+c \mid r \neq 0, b\in \Phi (r)+c, |(\Phi (r)+c) \cap ( \Phi(a)+b)|=1\}.$$ Using th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb04f6f5a4a3fc1aa2fad437effee2db
http://hdl.handle.net/11379/174908
http://hdl.handle.net/11379/174908
Autor:
Matteo Pradella, Matteo Rossi, Pierluigi San Pietro, Angelo Morzenti, Marcello M. Bersani, Achille Frigeri
This paper introduces a novel technique to decide the satisfiability of formulae written in the language of Linear Temporal Logic with Both future and past operators and atomic formulae belonging to constraint system D (CLTLB(D) for short). The techn
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::040ccfdf25fbcb6520738cc7ac2e582f
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642210723
IWCIA
IWCIA
Many formal models have been proposed to recognize or to generate two-dimensional words. In this paper, we focus our analysis on (regular) pure 2D context-free grammars, regional tile grammars and Průsa grammars, showing that nevertheless they have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c9aedf6512265f97019dbb90cdfd86ae
https://doi.org/10.1007/978-3-642-21073-0_21
https://doi.org/10.1007/978-3-642-21073-0_21
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642242878
RP
RP
We show that the satisfiability problem for LTL (with past operators) over arithmetic constraints (Constraint LTL) can be answered by solving a finite amount of instances of bounded satisfiability problems when atomic formulae belong to certain suita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a0ea836d22c22931c9746b6a89b86415
http://hdl.handle.net/11311/635439
http://hdl.handle.net/11311/635439