Algorithms Based on Finite Automata for Testing of Omega-Codes

Abstract

We establish an algorithm that, given as input a finite automaton recognizing a regular language L, decides whether L is an x-code. In case the input is a non-deterministic finite automaton, the algorithm has time complexity O(n 4 ). In special case, if the input is a deterministic finite automaton, the time complexity of the algorithm is reduced to O(n 2 ), where n is the number of states of that automaton.