Ambiguity of the Multiple Interpretations on Regular Languages
暂无分享,去创建一个
[1] Michael Rodeh. A fast test for unique decipherability based on suffix trees , 1982, IEEE Trans. Inf. Theory.
[2] Grzegorz Rozenberg,et al. Developmental systems and languages , 1972, STOC.
[3] Victor Mitrana,et al. Remarks on arbitrary multiple pattern interpretations , 2007, Inf. Process. Lett..
[4] Wojciech Rytter,et al. Efficient Constructions of Test Sets for Regular and Context-Free Languages , 1991, MFCS.
[5] Gheorghe Paun,et al. Multi-Pattern Languages , 1995, Theor. Comput. Sci..
[6] Dana Angluin,et al. Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..
[7] Tao Jiang,et al. A Note on the Space Complexity of Some Decision Problems for Finite Automata , 1991, Inf. Process. Lett..
[8] Victor Mitrana,et al. Multiple Pattern Interpretations , 2002, Grammars.
[9] Arto Salomaa,et al. Pattern languages with and without erasing , 1994 .
[10] Antonio Restivo,et al. Words and Patterns , 2001, Developments in Language Theory.
[11] Gilberto Filé. The Relation of Two Patterns with Comparable Languages , 1988, STACS.
[12] Hermann A. Maurer,et al. On the inherent ambiguity of simple tuple languages , 2005, Computing.
[13] M. Lothaire. Algebraic Combinatorics on Words , 2002 .