Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 30, Number 1, 1996
Page(s) 81 - 86
DOI https://doi.org/10.1051/ita/1996300100811
Published online 01 February 2017
  1. 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. [MR: 864674] [Zbl: 0594.68049] [Google Scholar]
  2. 2. J. H. JOHNSON, Rational Equivalence Relations, 13th International Colloquium on Automata Languages and Programming, Springer (LNCS 226), 1986, pp. 167-176. [MR: 864679] [Zbl: 0607.68061] [Google Scholar]
  3. 3. J. M. ROBSON, Separating Strings with Small Automata, Information Processing Letters, 1989, 30, pp. 209-214. [MR: 986823] [Zbl: 0666.68051] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.