Zobrazeno 1 - 10 of 77 pro vyhledávání: '"Puppis, G."'
1
Report
Decidability of the interval temporal logic ABBar over the natural numbers
Autor: Montanari, A., Puppis, G., Sala, P., Sciavicco, G.
In this paper, we focus our attention on the interval temporal logic of the Allen's relations "meets", "begins", and "begun by" (ABBar for short), interpreted over natural numbers. We first introduce the logic and we show that it is expressive enough
Externí odkaz: http://arxiv.org/abs/0912.3429
Zobrazit plný text záznamu
2
Dynamic Data Structures for Timed Automata Acceptance
Autor: Grez, A., Mazowiecki, F., Pilipczuk, M., Puppis, G., Riveros, C.
We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so through the lenses of parameterized dynamic data structures: we assume that th
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77be794639a520ae989e0df69d9bb3ec
http://hdl.handle.net/11390/1234444
Zobrazit plný text záznamu
3
Minimizing resources of sweeping and streaming string transducers
Autor: Baschenis, F., Gauwin, O., Muscholl, A., Puppis, G.
Publikováno v: Leibniz International Proceedings in Informatics (LIPIcs)
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016), Jul 2016, Rome, Italy. pp.114:1--114:14, ⟨10.4230/LIPIcs.ICALP.2016.114⟩
International audience; We consider minimization problems for natural parameters of word transducers: the number of passes performed by two-way transducers and the number of registers used by streaming transducers. We show how to compute in ExpSpace
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::00f55c78b42efe015ffef18379fbe0e5
https://hal.archives-ouvertes.fr/hal-01274992v3/file/long-version.pdf
Zobrazit plný text záznamu
4
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
5
Conference
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
6
Zielonka's recursive algorithm : dull, weak and solitaire games and tighter bounds
Autor: Gazda, M.W., Willemse, T.A.C., Puppis, G., Villa, T.
Publikováno v: Fourth International Symposium on Games, Automata, Logics and Formal Verification (Borca di Cadore, Dolomites, Italy, August 29-31, 2013), 7-20
STARTPAGE=7;ENDPAGE=20;TITLE=Fourth International Symposium on Games, Automata, Logics and Formal Verification (Borca di Cadore, Dolomites, Italy, August 29-31, 2013)
GandALF
Electronic Proceedings in Theoretical Computer Science, Vol 119, Iss Proc. GandALF 2013, Pp 7-20 (2013)
Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms. We invest
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e19ac49b63bb521a56abb3d3956237c
https://research.tue.nl/nl/publications/ca643b4b-9596-47d2-afee-63b3ad561934
Zobrazit plný text záznamu
9
Automata for Branching and Layered Temporal Structures: an Investigation into Regularities of Infinite Transition Systems
Autor: Puppis, G
Publikováno v: Springer, pp.1-206, 2010, LNAI, 978-3-642-11880-7. ⟨10.1007/978-3-642-11881-4⟩
International audience; Since 2002, FoLLI, the Association for Logic, Language, and Information (www.folli.org), has awarded an annual prize for an outstanding dissertation in the fields of logic, language, and information. The prize is named after
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b91bdc387662dc6f808ceaefe5c38267
https://hal.archives-ouvertes.fr/hal-00717778
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje