The syntactic complexity of semi-flower languages

DOI10.1007/978-3-030-23247-4_11MaRDI QIDQ2179334zbMATH OpenOpenAlexFDO

Authors Kitti Gelle, Szabolcs Iván

Publication date 12 May 2020

Full work available at URL https://hal.inria.fr/hal-02387298/document

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On syntactic complexity of circular semi-flower automata
• Syntactic complexity of suffix-free languages
• Syntactic complexities of some classes of star-free languages
• Syntactic complexities of six classes of star-free languages
• Syntactic complexity of prefix-, suffix-, and bifix-free regular languages

Cited in

(2)

• On syntactic complexity of circular semi-flower automata
• scientific article; zbMATH DE number 759440 (Why is no real title available?)

This page was built for publication: The syntactic complexity of semi-flower languages

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