Finite degrees of ambiguity in pattern languages

A. Mateescu; A. Salomaa

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1994)

  • Volume: 28, Issue: 3-4, page 233-253
  • ISSN: 0988-3754

How to cite

top

Mateescu, A., and Salomaa, A.. "Finite degrees of ambiguity in pattern languages." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 28.3-4 (1994): 233-253. <http://eudml.org/doc/92478>.

@article{Mateescu1994,
author = {Mateescu, A., Salomaa, A.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {pattern languages; inductive inference},
language = {eng},
number = {3-4},
pages = {233-253},
publisher = {EDP-Sciences},
title = {Finite degrees of ambiguity in pattern languages},
url = {http://eudml.org/doc/92478},
volume = {28},
year = {1994},
}

TY - JOUR
AU - Mateescu, A.
AU - Salomaa, A.
TI - Finite degrees of ambiguity in pattern languages
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1994
PB - EDP-Sciences
VL - 28
IS - 3-4
SP - 233
EP - 253
LA - eng
KW - pattern languages; inductive inference
UR - http://eudml.org/doc/92478
ER -

References

top
  1. 1. D. ANGLUIN, Finding patterns common to a set of strings, Journal of Computer and System Sciences, 1980, 21, pp. 46-62. Zbl0454.68108MR589803
  2. 2. J. BEAN, A. EHRENFEUCHT, and G. MCNULTY, Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, 1979, 85, pp. 261-294. Zbl0428.05001MR574919
  3. 3. J. CASSAIGNE, Unavoidable binary patterns, Acta Informatica, 1993, 30, pp. 385-395. Zbl0790.68096MR1227889
  4. 4. K. CULIK II and J. KARHUMÄKI, Systems of equations over a free monoid and Ehrenfeucht's conjecture, Discrete Mathematics, 1983, 43, pp. 139-153. Zbl0528.68057MR685623
  5. 5. T. JIANG, E. KINBER, A. SALOMAA, K. SALOMAA and S. Yu, Pattern languages with and without erasing, to appear in International Journal of Computer Mathematics. Zbl0939.68690
  6. 6. T. JIANG, A. SALOMAA, K. SALOMAA and S. Yu, Inclusion is undecidable for pattern languages, ICALP-93 Proceedings, Springer Lecture Notes in Computer Science, 1993, 700, pp. 301-312. 
  7. 7. V. KERÄNEN, Abelian squares can be avoided on four letters, Springer Lecture Notes in Computer Science, 1992, 623, pp. 41-52. MR1250629
  8. 8. G. KUCHEROV, M. RUSINOWITCH, On ground reducibility problem for word rewriting Systems with variables, Centre de Recherche en Informatique de Nancy, Report CRIN 93-R-012. Zbl0998.68529
  9. 9. G. S. MAKANIN, The problem of solvability of equations in a free semigroup (in Russian), Matematiceskij Sbornik, 1977, 103, 145, pp. 148-236. Zbl0371.20047MR470107
  10. 10. A. SALOMAA, Formal Languages, Academic Press, 1973. Zbl0262.68025MR438755
  11. 11. A. THUE, Über unendliche Zeichenreihen, Norske Vid. Selsk. Skr., I Mat. Nat. Kl., Kristiania, 1906, 7, pp. 1-22. JFM39.0283.01

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.