Han, Yo-Sub Salomaa, Kai 2024-01-19T13:38:36Z 2024-01-19T13:38:36Z 2022-03-07 2007 0302-9743 https://pubs.kist.re.kr/handle/201004/116409 We investigate the state complexity of basic operations for suffix-free regular languages. The state complexity of an operation for regular languages is the number of states that are necessary and sufficient in the worst-case for the minimal deterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, Kleene star, reversal and the Boolean operations for suffix-free regular languages. English SPRINGER-VERLAG BERLIN State complexity of basic operations on suffix-free regular languages Conference 1 32nd International Symposium on Mathematical Foundations of Computer Science, v.4708, pp.501 - + 32nd International Symposium on Mathematical Foundations of Computer Science 4708 501 + GE Cesky Krumlov, CZECH REPUBLIC 2007-08-26 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2007, PROCEEDINGS 000250380200044 2-s2.0-38049089885 Proceedings Paper