State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages

DOI10.1007/978-3-642-39310-5_9zbMath1388.68168OpenAlexW3022045249MaRDI QIDQ2843086

Hae-Sung Eom, Kai Salomaa, Yo-Sub Han

Publication date: 9 August 2013

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39310-5_9

zbMATH Keywords

state complexityprefix-free regular languages\(k\)-intersection\(k\)-union

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

State complexity of deletion and bipolar deletion ⋮ Prefix-Free Subsets of Regular Languages and Descriptional Complexity ⋮ Star-Complement-Star on Prefix-Free Languages

This page was built for publication: State Complexity of k-Union and k-Intersection for Prefix-Free Regular Languages