Utilize este identificador para referenciar este registo: https://hdl.handle.net/10216/176466
Registo completo
Campo DCValorIdioma
dc.creatorDuarte, G
dc.creatorNelma Moreira
dc.creatorPrigioniero, L
dc.creatorRogério Reis
dc.date.accessioned2026-09-01T01:32:18Z-
dc.date.available2026-09-01T01:32:18Z-
dc.date.issued2024
dc.identifier.othersigarra:704330
dc.identifier.urihttps://hdl.handle.net/10216/176466-
dc.description.abstractIn this paper we consider block languages, namely sets of words having the same length, and we propose a new representation for these languages. In particular, given an alphabet of size k and a length l, a block language can be represented by a bitmap of length k(l), where each bit indicates whether the corresponding word, according to the lexicographical order, belongs, or not, to the language (bit equal to 1 or 0, respectively). This representation turns out to be a good tool for the investigation of several properties of block languages, making proofs simpler and reasoning clearer. First, we show how to convert bitmaps into deterministic and nondeterministic finite automata. We then focus on the size of the machines obtained from the conversion and we prove that their size is minimal. Finally, we give an analysis of the maximum number of states sufficient to accept every block language in the deterministic and nondeterministic case.
dc.language.isoeng
dc.relation.ispartofIMPLEMENTATION AND APPLICATION OF AUTOMATA, CIAA 2024
dc.rightsopenAccess
dc.titleBlock Languages and Their Bitmap Representations
dc.typeArtigo em Livro de Atas de Conferência Internacional
dc.contributor.uportoFaculdade de Ciências
dc.identifier.doi10.1007/978-3-031-71112-1_9
dc.identifier.authenticusP-016-X21
Aparece nas coleções:FCUP - Artigo em Livro de Atas de Conferência Internacional

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
704330.pdfFinal version346.95 kBAdobe PDFThumbnail
Ver/Abrir


Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.