State complexity of basic operations on non-returning regular languages

DOI10.3233/FI-2016-1326MaRDI QIDQ2968533zbMATH OpenFDO

Authors Hae-Sung Eom, Yo-Sub Han, Galina Jirásková

Publication date 16 March 2017

Published in Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

finite automatastate complexitybasic operationsnon-returning regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• State complexity of basic operations on non-returning regular languages
• Most complex non-returning regular languages
• Most complex non-returning regular languages
• State Complexity of Basic Operations on Suffix-Free Regular Languages
• State complexity of basic operations on suffix-free regular languages

Cited in

(8)

• Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages
• Most complex non-returning regular languages
• State complexity of permutation on finite languages over a binary alphabet
• The state complexities of some basic operations on regular languages
• Complexity of bifix-free regular languages
• Complexity of bifix-free regular languages
• State complexity of basic operations on non-returning regular languages
• Most complex non-returning regular languages

This page was built for publication: State complexity of basic operations on non-returning regular languages

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