2 Search Results for "Silva, Manuel"


Document
Feedback Systems for Students Solving Problems Related to Polynomials of Degree Two or Lower

Authors: Luke Adrian Gubbins Bayzid, Ana Maria Reis D'Azevedo Breda, Eugénio Alexandre Miguel Rocha, and José Manuel Dos Santos Dos Santos

Published in: OASIcs, Volume 102, Third International Computer Programming Education Conference (ICPEC 2022)


Abstract
In this paper, we present the first attempts to design and implement an algorithm that effectively responds to errors in a student’s resolution in problems related to polynomials of degree two or lower. The algorithm analyzes the student’s input by comparing pre-established resolution patterns. The obtained results of the implementation show that the algorithm is effective at the classes of problems created within the project’s scope. Future work will concern the expansion of the number of classes to other common types of problems, such as higher-degree polynomials, and its use at a large scale using open-source software with CAS capabilities.

Cite as

Luke Adrian Gubbins Bayzid, Ana Maria Reis D'Azevedo Breda, Eugénio Alexandre Miguel Rocha, and José Manuel Dos Santos Dos Santos. Feedback Systems for Students Solving Problems Related to Polynomials of Degree Two or Lower. In Third International Computer Programming Education Conference (ICPEC 2022). Open Access Series in Informatics (OASIcs), Volume 102, pp. 5:1-5:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)


Copy BibTex To Clipboard

@InProceedings{bayzid_et_al:OASIcs.ICPEC.2022.5,
  author =	{Bayzid, Luke Adrian Gubbins and Breda, Ana Maria Reis D'Azevedo and Rocha, Eug\'{e}nio Alexandre Miguel and Dos Santos, Jos\'{e} Manuel Dos Santos},
  title =	{{Feedback Systems for Students Solving Problems Related to Polynomials of Degree Two or Lower}},
  booktitle =	{Third International Computer Programming Education Conference (ICPEC 2022)},
  pages =	{5:1--5:10},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-229-7},
  ISSN =	{2190-6807},
  year =	{2022},
  volume =	{102},
  editor =	{Sim\~{o}es, Alberto and Silva, Jo\~{a}o Carlos},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.ICPEC.2022.5},
  URN =		{urn:nbn:de:0030-drops-166094},
  doi =		{10.4230/OASIcs.ICPEC.2022.5},
  annote =	{Keywords: Automatic feedback, Algorithms, Algebraic systems}
}
Document
Anti-Powers in Infinite Words

Authors: Gabriele Fici, Antonio Restivo, Manuel Silva, and Luca Q. Zamboni

Published in: LIPIcs, Volume 55, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)


Abstract
In combinatorics of words, a concatenation of k consecutive equal blocks is called a power of order k. In this paper we take a different point of view and define an anti-power of order k as a concatenation of k consecutive pairwise distinct blocks of the same length. As a main result, we show that every infinite word contains powers of any order or anti-powers of any order. That is, the existence of powers or anti-powers is an unavoidable regularity. Indeed, we prove a stronger result, which relates the density of anti-powers to the existence of a factor that occurs with arbitrary exponent. From these results, we derive that at every position of an aperiodic uniformly recurrent word start anti-powers of any order. We further show that any infinite word avoiding anti-powers of order 3 is ultimately periodic, and that there exist aperiodic words avoiding anti-powers of order 4. We also show that there exist aperiodic recurrent words avoiding anti-powers of order 6, and leave open the question whether there exist aperiodic recurrent words avoiding anti-powers of order k for k=4,5.

Cite as

Gabriele Fici, Antonio Restivo, Manuel Silva, and Luca Q. Zamboni. Anti-Powers in Infinite Words. In 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 55, pp. 124:1-124:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{fici_et_al:LIPIcs.ICALP.2016.124,
  author =	{Fici, Gabriele and Restivo, Antonio and Silva, Manuel and Zamboni, Luca Q.},
  title =	{{Anti-Powers in Infinite Words}},
  booktitle =	{43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
  pages =	{124:1--124:9},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-013-2},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{55},
  editor =	{Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.124},
  URN =		{urn:nbn:de:0030-drops-62599},
  doi =		{10.4230/LIPIcs.ICALP.2016.124},
  annote =	{Keywords: infinite word, anti-power, unavoidable regularity, avoidability}
}
  • Refine by Author
  • 1 Bayzid, Luke Adrian Gubbins
  • 1 Breda, Ana Maria Reis D'Azevedo
  • 1 Dos Santos, José Manuel Dos Santos
  • 1 Fici, Gabriele
  • 1 Restivo, Antonio
  • Show More...

  • Refine by Classification
  • 1 Computing methodologies
  • 1 Mathematics of computing

  • Refine by Keyword
  • 1 Algebraic systems
  • 1 Algorithms
  • 1 Automatic feedback
  • 1 anti-power
  • 1 avoidability
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2016
  • 1 2022

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail