On the average state complexity of shuffle ideals

DOI10.1007/978-3-032-32016-2_3MaRDI QIDQ7412085zbMATH OpenFDO

Authors Guilherme Duarte, Markus Holzer, Nelma Moreira, Rogério Reis

Publication date 2027

Full work available at URL https://doi.org/10.1007/978-3-032-32016-2_3

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A hitchhiker's guide to descriptional complexity through analytic combinatorics
• Analytic combinatorics
• Classification of finite monoids: the language approach
• Finite semigroup varieties of the form V*D
• scientific article; zbMATH DE number 4028925 (Why is no real title available?)
• More on the Size of Higman-Haines Sets: Effective Constructions
• On languages piecewise testable in the strict sense
• On Shuffle Ideals
• On the Average Number of States of Partial Derivative Automata
• On the learnability of shuffle ideals
• On the state complexity of closures and interiors of regular languages with subwords and superwords
• Ordering by Divisibility in Abstract Algebras
• Partial derivatives of regular expressions and finite automaton constructions
• Partial orders on words, minimal elements of regular languages, and state complexity
• The size of Higman-Haines sets

This page was built for publication: On the average state complexity of shuffle ideals

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