Operational state complexity of block languages

DOI10.4204/EPTCS.407.5MaRDI QIDQ6940559zbMATH OpenFDO

Authors Guilherme Duarte, Nelma Moreira, Luca Prigioniero, Rogério Reis

Publication date 19 August 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4204/EPTCS.407.5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• A survey on operational state complexity
• Block languages and their bitmap representations
• EXACT GENERATION OF MINIMAL ACYCLIC DETERMINISTIC FINITE AUTOMATA
• Finite automata, image manipulation, and automatic real functions
• scientific article; zbMATH DE number 1156489 (Why is no real title available?)
• scientific article; zbMATH DE number 1962776 (Why is no real title available?)
• scientific article; zbMATH DE number 2081044 (Why is no real title available?)
• scientific article; zbMATH DE number 2201359 (Why is no real title available?)
• Minimisation of acyclic deterministic automata in linear time
• On the determinization blowup for finite automata recognizing equal-length languages
• Randomized generation of error control codes with automata and transducers
• STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES
• The mathematics of perfect shuffles
• The state complexities of some basic operations on regular languages

Cited in

(1)

• Two-word shuffle: some results

This page was built for publication: Operational state complexity of block languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940559)