Utilize este identificador para referenciar este registo: https://hdl.handle.net/10216/176483
Registo completo
Campo DCValorIdioma
dc.creatorDuarte, G
dc.creatorNelma Moreira
dc.creatorRogério Reis
dc.creatorPrigioniero, L
dc.date.accessioned2026-09-01T01:36:23Z-
dc.date.available2026-09-01T01:36:23Z-
dc.date.issued2024
dc.identifier.othersigarra:704328
dc.identifier.urihttps://hdl.handle.net/10216/176483-
dc.description.abstractIn this paper we consider block languages, namely sets of words having the same length, and study the deterministic and nondeterministic state complexity of several operations on these languages. Being a subclass of finite languages, the upper bounds of operational state complexity known for finite languages apply for block languages as well. However, in several cases, smaller values were found. Block languages can be represented as bitmaps, which are a good tool to study their minimal finite automata and their operations, as we illustrate here.
dc.language.isoeng
dc.relation.ispartofELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
dc.rightsopenAccess
dc.titleOperational State Complexity of Block Languages
dc.typeArtigo em Livro de Atas de Conferência Internacional
dc.contributor.uportoFaculdade de Ciências
dc.identifier.doi10.4204/eptcs.407.5
dc.identifier.authenticusP-017-4C6
Aparece nas coleções:FCUP - Artigo em Livro de Atas de Conferência Internacional

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
704328.pdfFinal version587.74 kBAdobe PDFThumbnail
Ver/Abrir


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