On the State Complexity of Closures and Interiors of Regular Languages with Subwords

DOI10.1007/978-3-319-09704-6_21zbMath1416.68100OpenAlexW64755865MaRDI QIDQ5496192

Philippe Schnoebelen, Prateek Karandikar

Publication date: 7 August 2014

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

Full work available at URL: https://doi.org/10.1007/978-3-319-09704-6_21

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

On Upper and Lower Bounds on the Length of Alternating Towers

This page was built for publication: On the State Complexity of Closures and Interiors of Regular Languages with Subwords