scientific article; zbMATH DE number 2201361

MaRDI QIDQ5313787zbMATH OpenFDO

Authors Michael Domaratzki, Kai Salomaa

Publication date 1 September 2005

zbMATH Keywords

descriptional complexityfinite automataslender languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On the State Complexity of the Shuffle of Regular Languages
• scientific article; zbMATH DE number 1916664
• A combinatorial approach for the state complexity of the shuffle product
• Commutative regular languages -- properties and state complexity
• On the shuffle automaton size for words

Cited in

(6)

• State complexity of basic operations on suffix-free regular languages
• State complexity of cyclic shift
• State Complexity of Combined Operations for Prefix-Free Regular Languages
• State complexity of combined operations for suffix-free regular languages
• A combinatorial approach for the state complexity of the shuffle product
• Deletion along trajectories

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 Q5313787)