Separating words with machines and groups
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1996)
- Volume: 30, Issue: 1, page 81-86
- ISSN: 0988-3754
Access Full Article
top
How to cite
topRobson, J. M.. "Separating words with machines and groups." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 30.1 (1996): 81-86. <http://eudml.org/doc/92526>.
@article{Robson1996,
author = {Robson, J. M.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {finite state machine},
language = {eng},
number = {1},
pages = {81-86},
publisher = {EDP-Sciences},
title = {Separating words with machines and groups},
url = {http://eudml.org/doc/92526},
volume = {30},
year = {1996},
}
TY - JOUR
AU - Robson, J. M.
TI - Separating words with machines and groups
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1996
PB - EDP-Sciences
VL - 30
IS - 1
SP - 81
EP - 86
LA - eng
KW - finite state machine
UR - http://eudml.org/doc/92526
ER -
References
top- 1. P. GORALCIK and V. KOUBEK, On Discerning words by automata, 13th International Colloquium on Automata Languages and Programming, Springer (LNCS 226), 1986, pp. 116-122. Zbl0594.68049MR864674
- 2. J. H. JOHNSON, Rational Equivalence Relations, 13th International Colloquium on Automata Languages and Programming, Springer (LNCS 226), 1986, pp. 167-176. Zbl0607.68061MR864679
- 3. J. M. ROBSON, Separating Strings with Small Automata, Information Processing Letters, 1989, 30, pp. 209-214. Zbl0666.68051MR986823
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.