scientific article; zbMATH DE number 3856432

MaRDI QIDQ3325065zbMATH OpenFDO

Authors N. R. Nigmatullin, Yury A. Al'pin

Publication date 1983

Full work available at URL https://eudml.org/doc/69223

zbMATH Keywords

separability of languages by finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 3943060
• Efficient separability of regular languages by subsequences and suffixes
• On separation by locally testable and locally threshold testable languages
• Separating regular languages by locally testable and locally threshold testable languages
• Separating regular languages by piecewise testable and unambiguous languages

Cited in

(6)

• A characterization of s-languages
• scientific article; zbMATH DE number 3943060 (Why is no real title available?)
• scientific article; zbMATH DE number 3978421 (Why is no real title available?)
• Une critique de la notion de test de processus fondée sur la non séparabilité de certaines classes de langages
• Separating the words of a language by counting factors
• On the separability of sparse context-free languages and of bounded rational relations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3325065)