@krystian

An O(n 2 ) Time Algorithm for Deciding Whether a Regular Language is a Code

. Journal of Computing and Information, (1996)

Description

An O(n 2 ) Time Algorithm for Deciding Whether a Regular Language is a Code - CiteSeerX

Links and resources

Tags