State Complexity of Union and Intersection of Finite Languages

DOI10.1007/978-3-540-73208-2_22zbMath1202.68227OpenAlexW1571429055MaRDI QIDQ5428233

Yo-Sub Han, Kai Salomaa

Publication date: 28 November 2007

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73208-2_22

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

Time window temporal logic ⋮ Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity

This page was built for publication: State Complexity of Union and Intersection of Finite Languages