State complexity of pseudocatenation

DOI10.1007/978-3-030-13435-8_15MaRDI QIDQ2278276zbMATH OpenOpenAlexFDO

Authors Lila Kari, Timothy Ng

Publication date 4 December 2019

Full work available at URL https://doi.org/10.1007/978-3-030-13435-8_15

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• State complexity of multiple catenations
• State complexity of catenation combined with star and reversal
• State complexity of catenation combined with union and intersection
• State complexity of catenation combined with a Boolean operation: a unified approach
• State complexity and limited nondeterminism
• State complexity of finite partial languages
• State complexity of finite partial languages
• scientific article; zbMATH DE number 7301304
• State complexity and approximation
• scientific article; zbMATH DE number 1773091

Cited in

(4)

• State complexity of overlap assembly
• State complexity of cyclic shift
• State complexity of overlap assembly
• Watson-Crick conjugates of words and languages

This page was built for publication: State complexity of pseudocatenation

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