State Complexity of Basic Operations on Non-returning Regular Languages

DOI10.1007/978-3-642-39310-5_7zbMath1388.68166OpenAlexW2291302052MaRDI QIDQ2843084

Hae-Sung Eom, Galina Jirásková, 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_7

zbMATH Keywords

finite automatastate complexitybasic operationsnon-returning regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

State complexity of deletion and bipolar deletion

This page was built for publication: State Complexity of Basic Operations on Non-returning Regular Languages