STATE COMPLEXITY OF CODE OPERATORS

DOI10.1142/S0129054111008957zbMath1252.68182OpenAlexW1994062790MaRDI QIDQ2909103

Emanuele Rodaro, Elena V. Pribavkina

Publication date: 29 August 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054111008957

zbMATH Keywords

regular languagecodestate complexity

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Descriptive complexity and finite models (68Q19)

Related Items (3)

Ideal regular languages and strongly connected synchronizing automata ⋮ On the decidability of infix inclusion problem ⋮ Groups and semigroups defined by colorings of synchronizing automata

Cites Work

• Synchronizing automata with finitely many minimal synchronizing words
• State complexity of basic operations on suffix-free regular languages
• On NFAs where all states are final, initial, or both
• Intersection and union of regular languages and state complexity
• State complexity of some operations on binary regular languages
• UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
• Synchronizing Automata and the Černý Conjecture
• On free monoids partially ordered by embedding
• Unnamed Item

This page was built for publication: STATE COMPLEXITY OF CODE OPERATORS