Operational State Complexity of Block Languages
Formal Languages and Automata Theory
2024-09-12 v1
Abstract
In 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.
Cite
@article{arxiv.2409.06970,
title = {Operational State Complexity of Block Languages},
author = {Guilherme Duarte and Nelma Moreira and Luca Prigioniero and Rogério Reis},
journal= {arXiv preprint arXiv:2409.06970},
year = {2024}
}
Comments
In Proceedings NCMA 2024, arXiv:2409.06120