A note on SE-Systems and regular canonical systems

• Autorzy: Tiplea F.L. , Mäkinen E.
• Języki publikacji: EN

Abstrakty

EN

A synchronized extension system is a 4-tuple G = (V,L1,L2,S), where V is an alphabet and L1, L2 and S are languages over V. Such systems generate languages extending L1 by L2 to the left or to the right, and synchronizing on words in S. In this note we consider the relationship between synchronized extension systems and regular canonical systems. We are able to give a simplified and generalized proof for the classical result concerning the regularity of the languages defined by regular canonical systems.

Słowa kluczowe

EN

formal languages; synchronized extension systems; regular canonical systems

• Wydawca: IOS Press
• Czasopismo: Fundamenta Informaticae
• Rocznik: 2001
• Tom: Vol. 46, nr 3
• Strony: 253--256
• Opis fizyczny: bibliogr. 2 poz.

Twórcy

autor

Tiplea F.L.

autor

Mäkinen E.

• Faculty of Computer Science, "A1.I.Cuza" University of Iasi, Iasi, Romania,