Graph congruences and pair testing

DOI10.1051/ITA/1986200201291MaRDI QIDQ3729175zbMATH OpenOpenAlexFDO

Authors R. Knast, Janusz Brzozowski

Publication date 1986

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

bi-locally testable languagesfree monoidgraph congruencestesting pairs of words

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• Some variations on the notion of locally testable language
• On the index of Simon's congruence for piecewise testability
• scientific article; zbMATH DE number 3881894
• On generalized locally testable languages
• On two-sided locally testable languages

Cites work

• Characterizations of locally testable events
• scientific article; zbMATH DE number 3881894 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)

Cited in

(2)

• Robert Knast (1940-1994)
• Graph congruences and what they connote

This page was built for publication: Graph congruences and pair testing

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