Operational state complexity of block languages
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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Default Conference proceeding |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/2134/27645756.v1 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|