scientific article; zbMATH DE number 6415494

DOI10.25596/JALC-2012-061MaRDI QIDQ5178448zbMATH OpenFDO

Authors Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini

Publication date 16 March 2015

zbMATH Keywords

state complexityKleene stardown closureinverse operationsup closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On inverse operations and their descriptional complexity
• Structural analysis of the complexity of inverse functions
• On the descriptional complexity of operations on semilinear sets
• On the complexity of inverse semigroup conjugacy
• The complexity of satisfaction problems in reverse mathematics
• The Complexity of Satisfaction Problems in Reverse Mathematics
• On the circuit-size of inverses
• State complexity of inversion operations
• State complexity of inversion operations
• On the positive and the inversion complexity of Boolean functions

Cited in

(9)

• On the Inversion Complexity of a System of Functions
• Descriptional complexity of chop operations on unary and finite languages
• Descriptional complexity and operations -- two non-classical cases
• Descriptional complexity of the forever operator
• Inverse star, borders, and palstars
• On inverse operations and their descriptional complexity
• scientific article; zbMATH DE number 2201358 (Why is no real title available?)
• On the state complexity of closures and interiors of regular languages with subwords and superwords
• State complexity of inversion operations

This page was built for publication:

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