Graph congruences and pair testing
J. A. Brzozowski; Robert Knast
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1986)
- Volume: 20, Issue: 2, page 129-147
- ISSN: 0988-3754
Access Full Article
topHow to cite
topBrzozowski, J. A., and Knast, Robert. "Graph congruences and pair testing." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.2 (1986): 129-147. <http://eudml.org/doc/92252>.
@article{Brzozowski1986,
author = {Brzozowski, J. A., Knast, Robert},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {free monoid; bi-locally testable languages; testing pairs of words; graph congruences},
language = {eng},
number = {2},
pages = {129-147},
publisher = {EDP-Sciences},
title = {Graph congruences and pair testing},
url = {http://eudml.org/doc/92252},
volume = {20},
year = {1986},
}
TY - JOUR
AU - Brzozowski, J. A.
AU - Knast, Robert
TI - Graph congruences and pair testing
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 2
SP - 129
EP - 147
LA - eng
KW - free monoid; bi-locally testable languages; testing pairs of words; graph congruences
UR - http://eudml.org/doc/92252
ER -
References
top- 1. J. A. BRZOZOWSKI, Hierarchies of Aperiodic Languages, R.A.I.R.O., Vol. 10, No. 8, August 1976, pp. 33-49. MR428813
- 2. J. A. BRZOZOWSKI and I. SIMON, Characterizations of Locally Testable Events, Discrete Math., Vol. 4, No. 3, March 1973, pp. 243-271. Zbl0255.94032MR319404
- 3. S. EILENBERG, Automata, Languages and Machines, Vol. B, Academic Press, New York 1976. Zbl0359.94067MR530383
- 4. R. KNAST, Bilocally Testable Languages, Bulletin of the Polish, Academy of Sciences (Mathematics), Vol. 31, No. 5-8, 1983. pp. 313-320. Zbl0553.68045MR750738
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.