Basic operations on binary suffix-free languages

Authors:
Roland Cmorik;Galina Jir$#225/skov$#225/
Affiliations:
Institute of Computer Science, P.J. Š/af$#225/rik University, Ko$#353/ice, Slovakia;Mathematical Institute, Slovak Academy of Sciences, Ko$#353/ice, Slovakia
Venue:
MEMICS'11 Proceedings of the 7th international conference on Mathematical and Engineering Methods in Computer Science
Year:
2011

Citing 10
Cited 1

Regular languages

Handbook of formal languages, vol. 1
Introduction to the Theory of Computation

Introduction to the Theory of Computation
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
Errata to: "finite automata and unary languages"

Theoretical Computer Science
State complexity of basic operations on suffix-free regular languages

Theoretical Computer Science
Determination of finite automata accepting subregular languages

Theoretical Computer Science
Finite automata and their decision problems

IBM Journal of Research and Development
Complexity in union-free regular languages

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Quotient complexity of ideal languages

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Quotient complexity of closed languages

CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications

State complexity of combined operations for suffix-free regular languages

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a characterization of nondeterministic automata accepting suffix-free languages, and a sufficient condition on deterministic automata to accept suffix-free languages. Then we investigate the state complexity of basic operations on binary suffix-free regular languages. In particular, we show that the upper bounds on the state complexity of all the boolean operations as well as of Kleene star are tight in the binary case. On the other hand, we prove that the bound for reversal cannot be met by binary languages. This solves several open questions stated by Han and Salomaa (Theoret. Comput. Sci. 410, 2537-2548, 2009).