STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET

DOI10.1142/S0129054105003157zbMath1097.68065OpenAlexW1994383533MaRDI QIDQ5462123

No author found.

Publication date: 1 August 2005

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (10)

State complexity of permutation on finite languages over a binary alphabet ⋮ Syntactic complexity of bifix-free languages ⋮ The exact state complexity for the composition of root and reversal ⋮ On the size of inverse semigroups given by generators ⋮ Syntactic complexity of regular ideals ⋮ State complexity of deletion and bipolar deletion ⋮ Unnamed Item ⋮ Syntactic complexity of bifix-free regular languages ⋮ Descriptional complexity of regular languages ⋮ Combination of roots and Boolean operations: an application to state complexity

Cites Work

• Unnamed Item
• Unnamed Item
• The state complexities of some basic operations on regular languages
• Composition sequences for functions over a finite domain.
• Automata, Boolean matrices, and ultimate periodicity.
• State-complexity of finite-state devices, state compressibility and incompressibility

This page was built for publication: STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET