|
|
|
|
BIBLIOGRAPHY
International journals
Special Issues in International Journals
Abstracts in the Mathematical reviews
International journals
|
|
|
[N23.1]
|
Néraud J., Topologies for Error-Detecting Variable-Length Codes, Info. and Comput. (295) ,
(2023), 114175, DOI: 10.1016/j.ic.2023.105092,
temporary share link here.
|
|
[N23]
|
Néraud J., Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution, Theoret. Comp. Sci. (977) ,
(2023), 114175. DOI: 10.1016/j.tcs.2023.114175, temporary share link here.
|
|
[N22.1]
|
Néraud J., When Variable-Length Codes Meet the Field of Error Detection,
in Poulakis D. and Rahonis G.(eds) Algebraic Informatics, 9th International Conference, CAI 2022,
Virtual Event, October 27–29, 2022, Lect. N. in Comput. Sci. (lncs), vol. 13706 , 203-221. DOI:10.1007/978-3-031-19685-0.
|
|
[N22]
|
Néraud J., Variable-length codes independent or closed with respect to edit relations, Info. and Comput.,
288 (2022), 104747. DOI: 10.1016/j.ic.2021.104747 .
|
|
[N21]
|
Néraud J., Gray Cycles of Maximum Length Related to k-Character Substitutions (February
2020), in Han YS., Ko SK.(eds) Descriptional Complexity of Formal Systems. DCFS 2021 2020, Lect. N. in Comput. Sci. (lncs), vol. 13037, 137-149. DOI:10.1007/978-3-030-93489-7_12 .
|
|
[N20]
|
Néraud J., Complete Variable-Length Codes: An excursion into Word Edit Operations (February
2020), in Leporati A., Martin-Vide C., Shapira D., Zandron C. (eds) Language and Automata Theory and Applications. LATA 2020, Lect. N. in Comput. Sci. (lncs), vol. 12038 , 437-448. DOI:10.1007/978-3-030-40608-0_31 .
|
|
[NS20]
|
Néraud J. and Selmi C., Embedding a θ-invariant code into a complete one
Theoret. Comp. Sci., 806 (2020) 28-41.
DOI:10.1016/j.tcs.2018.08.022.
|
|
[N18]
|
Néraud J., Conferences WORDS, years 1997-2017: Open Problems and Conjectures (June
2018), in: The Formal Language Theory Column by Giovanni Pighizzini, EATCS Bulletin 125 . Full text .
|
|
[NS17]
|
Néraud J and C. Selmi, Invariance: a
theoretical approach for coding sets of words modulo literal (anti)morphisms, in Combinatorics
on Words (2017), in S. Brlek,
F. Dolce, C. Reutenauer and E. Vandomme (Eds.),
Lect. N. in Comput. Sci. (lncs)
10432 (2017) 214-227.
DOI:10.1007/978-3-319-66396-8_20.
Full text:
arXiv:1705.05564.
|
|
[N16]
|
Néraud J., Ten Conferences WORDS and their Contribution to the Field of Combinatorics on Words, (February
2016), EATCS Bulletin 118 , 145-155. Full text .
|
|
|
|
[N15]
|
Néraud J., On the Contribution of WORDS to the Field of Combinatorics on Words, in Combinatorics on Words (2015), F. Manea
, D. Nowotka (Eds.), Lect. N. in Comp. Sci. (lncs)
, 9304
27-34.
doi:/10.1007/978-3-319-23660-5_3.
|
|
|
|
[GMNS15]
|
Giambruno L, Mantacci S., Néraud
J. and C. Selmi, A generalization of Girod's bidirectional decoding method to codes with a
finite deciphering delay, Int. J. of Found. of Comput.
Sci. (IJFCS) 26, 6 (2015) 733-749, DOI:/10.1142/S0129054115500410 .
|
|
|
|
[GMNS12]
|
Giambruno L, Mantacci
S., Néraud J. and C. Selmi,
A generalization of Girod's bidirectional
decoding method to codes with a finite deciphering delay, in Developments in Language Theory (2012), Hsu-Chun Ye,
O. Ibarra (Eds.), Lect. N. in Comput. Sci. (lncs) 7410,
471-476.
DOI: 10.1007/978-3-642-31653-1_43
|
|
|
|
[N08]
|
Néraud J., Completing circular codes in regular submonoids,
Theoret.. Comp. Sci. 391 (2008) 90-98.
DOI:10.1016/j.tcs.2007.10.033.
|
|
|
|
[N06.1]
|
Néraud J., Completing prefix codes in submonoids,
Theoret.. Comp. Sci. 356 (2006) 245-254.
DOI: 10.1016/j.tcs.2006.01.027 .
|
|
[N06]
|
Néraud J., On the completion of codes in submonoids
with finite rank, Fundam. Informaticae 74
(2006), 549-562.
EID: 2-s2.0-33845528831 .
|
|
[N04]
|
Néraud J., Completing a code in a regular submonoid
of the free monoid, in Acts of MCU'2004, 4th International Conference Machines, Computations and Universalityn Saint Petersburg, Russia, September 2004, M. Margenstern ed., Lect. N. in Comput. Sci. (lncs)
3354 (2004) 281-291.
EID: 2-s2.0-24144490397.
|
|
[NS04]
|
Néraud J. and Selmi C., A characterization of
complete finite prefix codes in a submonoid of A*, J. Automata, Languages and Combinatorics, 9 (2004) 103-110.
Full text.
|
|
[NS03]
|
Néraud J. and Selmi C., Free Monoid Theory: Maximality
and Completeness in Arbitrary Submonoids, Internat. J. of Alg. and Comput., 13
(2003) 507-516.
DOI: 10.1142/S0218196703001584.
Full text:
Here.
|
|
[NS02]
|
Néraud J. and Selmi C., Locally complete sets
and finite decomposable codes, Theoret.. Comput. Sci..
273 (2002) 185-196.
DOI: 10.1016/S0304-3975(00)00440-0.
|
|
[NS01]
|
Néraud J. and Selmi C., On codes with a finite
deciphering delay: Constructing uncompletable
words, Theoret. Comput. Sci.
255 (2001) 151-162.
DOI: 10.1016/S0304-3975(99)00160-7.
|
|
[N97]
|
Néraud J., Detecting morphic images of a word:
improving the general algorithm, Theoret. Informatics Appl.(RAIRO) 31 (1997)
1-14.
DOI: 10.1051/ita/1997310100011.
Full text:
Here.
|
|
[N95.1]
|
Néraud J., Detecting morphic images of a word:
on the rank of a pattern, Acta Info., 32 (1995) 477-489.
DOI: 10.1007/BF01213080.
Full text:
Here.
|
|
[N95]
|
Néraud J., Algorithms for detecting morphic
images of a word, Info. and Comput. 120 (1995) 126-148.
DOI: 10.1006/inco.1995.1105.
Full text:
Here.
|
|
[N94]
|
Néraud J., Equations in words: an algorithmic contribution, Bull. of Belg. Math. Soc. 1 (1994) 253-283.
DOI: 10.36045/bbms/1103408549.
Full text:
EID: 2-s2.0-84972535705.
|
|
[N93.1]
|
Néraud J., Deciding whether a finite set of words has rank at most 2, Theoret. Comput. Sci. 112 (1993)
311-337.
DOI: 10.1016/0304-3975(93)90023-M.
|
|
[N93]
|
Néraud J., New algorithms for detecting morphic
images of a word, in acts of MFCS'93,18th International Symposium of Mathematical Foundations of Computer Science 1993, Gda\'nsk, Poland, August/September 1993, Proceedings
A. M. Borzyszkowsli, S. Solokowski (Eds.) Lect. N. in Comput. Sci. (lncs), 711 (1993) 588-597
EID: 2-s2.0-85027512900.
|
|
[NC92]
|
Néraud J. and Crochemore M., A string-matching
interpretation of the equation x m yn = zp , Theoret. Comput. Sci. 92 (1992) 145-164.
DOI: 10.1016/0304-3975(92)90140-B.
|
|
[N92]
|
Néraud J., On the rank of the subsets of a free monoid,
Theoret. Comput. Sci.
99 (1992) 231-241.
DOI: 10.1016/0304-3975(92)90350-O.
|
|
|
|
[N91]
|
Néraud J., On the subsets of rank two in a free Monoid:
A Fast Decision Algorithm (Extended Abstract) in acts of FCT'91, Fundamental of computation theory, L. Budach (Ed.),
lncs 529 (1991)
360-369.
DOI:10.1007/3-540-54458-5_80.
|
|
[N90.1]
|
Néraud J., On the deficit of a finite set of words, Semigroup Forum 41
(1990) 117-131.
DOI: 10.1007/BF02573374. |
|
[N90]
|
Néraud J., Elementariness of a finite set of words is co-NP-complete, Theoret. Informatics Appl. (RAIRO) 24 (1990)
459-470.
DOI: 10.1051/ita/1990240504591.
Full text:
Here.
|
|
[CN90]
|
Crochemore M. and J. Néraud J., Unitary Monoid with Two Generators: An Algorithmic Point of
View, in acts of CAAP'90, 15th Colloquium on Trees in Algebra and Programming Copenhagen, Denmark, May 15–18, 1990 Proceedings, A. Arnold (Ed.) Lect. N. in Comput. Sci. (lncs)
431 (1990) 459-470.
DOI: 10.1007/3-540-52590-4_44.
|
In open access on the web
|
[N94.1]
|
Néraud J., Ten Conferences WORDS: Open Problems and Conjectures, aval. for download at my own
page in Researchgate.
|
Top of the Page
Dissertations
|
[N94.1]
|
Néraud J., "Pour une
description structurelle des sous-ensembles du monoïde libre: propriétés
combinatoires et résultats de complexité",
Habilitation à diriger les recherches (HDR) (acreditation to direct research), 1995.
|
|
[N89]
|
Néraud J., "Quelques
problèmes de factorisation dans les sous-ensembles du monoïde
libre",
Doctorat de l'Université de Rouen, France (PhD)(Phd), 1989.
|
Top of the Page
Special issues in international journals
|
[N03]
|
Néraud J., Guest Editor, "WORDS", Theoret. Comput. Sci. 307
(2003),
Special Issue.
|
|
[N02]
|
Néraud J., Guest Editor, "WORDS", Theoret. Comput. Sci., 273
(2002),
Special Issue.
|
|
[N99]
|
Néraud J., Guest Editor, "WORDS", Theoret. Comput. Sci. 218
(1999),
Special Issue.
|
Top of the Page
Mathematical reviews
(The reviews are available at http://www.ams.org/mathscinet/ )
|
|
|
[24.2]
|
Néraud
J., Review MR4649945: Fan Feng, Andreas Maletti
Weigthed two-way transducer Info. Comput. 295, (2023) 105094.
|
|
[24.1]
|
Néraud
J., Review MR4618946: Orna Kupferman, Asaf Petruschka
Lazy regular sensing Theoret. Comput. Sci. 971, (2023) 114057.
|
|
[23.3]
|
Néraud
J., Review MR4575124: Romeo Rizzi, Stéphane Vialette,
On recognising words that are squares for the shuffle product Theoret. Comput. Sci. 956, (2023) 111156.
|
|
[23.2]
|
Néraud
J., Review MR4545194: Giovanna D'Agostino, Davide Martincigh and Alberto Policriti,
Ordering regular languages and automata: Complexity, Theoret. Comput. Sci. 59, (2023) 113709.
|
|
[23.1]
|
Néraud
J., Review MR4473878: Hanan Shabana and M. V. Volkov,
Careful synchronization of partial deterministic finite automata, Acta Informatica 59, (2022) 479-504.
|
|
[22.2]
|
Néraud
J., Review MR4436520: Gabriele Fici and Jeffrey Shallit,
Properties of a class of Toeplitz words, Theoret. Comput. Sci. 922, (2022) 1-12.
|
|
[22.1]
|
Néraud
J., Review MR4357409: Giusepina Castiglione and Štěpán Holub,
The intersection of 3-maximal submonoids, Theoret. Comput. Sci. 901, (2022) 35-44.
|
|
[20.3]
|
Néraud
J., Review MR4030335: Klíma Ondrěj and Libor Polák
Syntactic structures of regular languages, Theoret. Comput. Sci. 800, (2019) 125-141.
|
|
[20.2]
|
Néraud
J., Review MR4000711: Motoya Machida, Alexander Y. Shibarov,
Stack and register complexity of radix conversions, Theoret. Comput. Sci. 790, (2019) 138-151.
|
|
[20.1]
|
Néraud
J., Review MR3943778: Samuel J. van Gool, Benjamin Steinberg,
Merge decomposition, two-sided Krohn-Rhodes, and aperiodic pointlikes Canad. Math. Bull. 62 (1) (2019) 199-208.
|
|
[19.4]
|
Néraud
J., Review MR3942558: Karin Quaas, Mahsa Shirmohammadi,
Syncronizing data words for register automata, ACM Transac. on Comput. Logic, 20, No. 2 (2019) Article 11.
|
|
[19.3]
|
Néraud
J., Review MR3897403: Markus Steindl,
On semigroups with PSPACE-complete subpower membership problem, J. Aust. Math. Soc. 106, No. 1 (2019) 127-142.
|
|
[19.2]]
|
Néraud
J., Review MR3844703: Jean Camille Birget J.C.,
Polynomial-time right-ideal morphisms and congruences, International Journal of Algebra and Computation 28, No. 05 (2018) 791-835.
|
|
[19.1]
|
Néraud
J., Review MR3818424: Liyan Bai, Lianyan Jin, Yun Liu,
Maximal bifix codes of degree 3, Bull. Malays. Math. Sci. Soc. 41 (2018)1393--1407.
|
|
[18.3]
|
Néraud
J., Review MR3778826: Farzam Ebrahimnejad,
On the gap betwenn separating words and separating their reversals, Theoret. Comp. Sci. 711 (2018) 79--91.
|
|
[18.2]
|
Néraud
J., Review MR3719446: Tadashi Ishibe,
The skew growth functions for the monoid of type Bij and others, Hiroshima Math. J. 47 (2017) 289-317.
|
|
[18.1]
|
Néraud
J., Review MR3699799: Stavros Konstantinidis, Mitja Mastnak
Embedding rationally independent languages into maximal ones, J. of Automa Lang. and Comb. 21 (2016) 311-338.
|
|
[17.4]
|
Néraud
J., Review MR3649884: Nathanaël Fijalkow,
Profinite techniques for probalistic automata and the Markov monoid algorithm, Theoret. Comp. Sci. 680 (2017) 1-14.
|
|
[17.3]
|
Néraud
J., Review MR3624768: Lü Xiaotao,
Chen Jin, Wen Zhixiong,
Wu Wen, On the abelian
complexity of the Rudin-Shapiro sequence, J. Math. Anal. Appl. 451 (2017) 822-838.
|
|
|
|
[17.2]
|
Néraud
J., Review MR3580532: Giovanna Guaiana, Local
testability from words to traces, a suitable definition, Theoret. Comput. Sci. 658 (2017) 175-189.
|
|
|
|
[17.1]
|
Néraud
J., Review MR3561704: Rogério Reis and Emanuelle Rodaro, Ideal
regular languages and strongly connected synchronizing automata, Theoret. Comput. Sci. 653 (2016) 97-107.
|
|
[16.5]
|
Néraud
J., Review MR338925: Gábor Horváth,
Chrystopher L. Nehaviv,
Length of polynomials over finite group, J. of Comput. and Syst. Sci. 81 (2015) 1634-1622.
|
|
[16.4]
|
Néraud
J., Review MR3002050: Mari Huova, Juhani Karhumäki, Equations
in the partial semigroup of words with
overlapping products, In: Languages alive, Lecture Notes
in Comput. Sci., Springer, Heildelberg
7300 (2012) 99-110.
|
|
[16.3]
|
Néraud
J., Review MR3473473: Graeme Gange, Jorge A. Navas, Peter Schachte, Harald Sondergaard and Peter
J. Stuckey, A complete refinement procedure for regular separability
of context-free languages, Theoret. Comp. Sci. 625 (2016) 1-24.
|
|
[16.2]
|
Néraud
J., Review MR3436920: Oscar H. Ibarra, Bala Ravikumar, On bounded languages and reversal-bounded
automata, Information and Computation 246 (2016) 30-42.
|
|
[16.1]
|
Néraud
J., Review MR3419095: Ville Salo, Groups and Monoids of Celular Automata,
In: Cellular Automata and discrete complex systems Lecture
Notes in Comput. Sci., Springer, Heidelberg, 9099
(2015) 17-45.
|
|
[15.4]
|
Néraud
J., Review MR337506: Gabriela Ash Rino Nesin and Richard M. Thomas, Groups Whose Word Problem
is a Petri Net Language, In: Descriptional
complexity of formal language Lecture Notes in Comput. Sci., Springer, 9118
(2015) 243-255.
|
|
[15.3]
|
Néraud
J., Review MR3371647: Francine Blanchet-Sadri and Andrew Lohr, Computing minimum length representations of sets
of words of uniform length, Theoret. Comp. Sci. 596 (2015) 41-54.
|
|
[15.1]
|
Néraud J., Review
MR3313508: Valérie Berthé, Clelia
De Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer and Giuseppina Rindone, Bifix codes and interval exchanges, J. Pure and Appl. Algebra 219 (2015)
2781-2798.
|
|
[14.3]
|
Néraud
J., Review MR3288456: A. B. Gorbatkov, Interassociates of a free semigroup
with two generators, Mat. Stud. 41
(2014) 139-145.
|
|
[14.2]
|
Néraud
J., Review MR3254716: Alan J. Cain and Victor Matcev,
Markov semigroups, monoids
and groups, Int. J. of Alg. and Comp. 24 (2014), no 4, 609-653.
|
|
[14.1]
|
Néraud
J., Review MR3136809: Idrissa Kaboré et Théodore Tapsoba, Mots binaires récurrents de complexité ultimement n+2, Annales Mathématiques Africaines Série 1 2 (2011), 47-57.
|
|
[13.2]
|
Néraud
J., Review MR3078062: Dominique Perrin, Completely reducible sets, Int. J. of Alg. and Comp. 23 (2013), no 4, 915-941.
|
|
[13.1]
|
Néraud
J., Review MR3053778: Singh Shubh Narayan, Krishna K.V. (Kanduru
Vendakata), A sufficient condition for the Hanna
Neumann property of submonoids of a free monoid, Semigroup Forum 86
(2013), no 3, 537-554.
|
|
[12.5]
|
Néraud
J., Review MR3001593: Liu Yun, Completely simples
codes, Semigroup Forum 85 (2012),
no 3, 417-438.
|
|
[12.4]
|
Néraud
J., Review MR2970068: Igor Dolinka, A note on
maximal subgroups of free idempotent generated semigroups
over bands (English summary), Period. Math. Hungar. 65 (2012)97-105.
|
|
[12.3]
|
Néraud
J., Review MR2931391: R. Gray and N. Ruskuc, On
maximal subgroups of free idempotent generated semigroups
(English summary), Israeel J. Math. 189
(2012) 147-176.
|
|
[12.2]
|
Néraud
J., Review MR2923456: Jean Berstel, Clelia De Felice Clelia, Dominique Perrin , Christophe Reutenauer and Giuseppina Rindonne, Recents results on
syntactic groups of prefx codes (English
summary), European Journal of combinatorics
33 (2012), no 7, 1386-1401.
|
|
[12.1]
|
Néraud
J., Review MR2914183: Arto Salomaa,
Subword occurrences, weighted automata and
iterated morphisms, especially the Fibonacci morphism, Theoret. Comp. Sci. 432 (2012) 85-93.
|
|
[11.5]
|
Néraud
J., Review MR2883054: Adam Woryna, The concept of
duality for automata over a changing alphabet and generation of a free
group by such automata Theoret. Comp. Sci 412
(2011), no 45, 6420-6431.
|
|
[11.4]
|
Néraud
J., Review MR2858906: Mikolaj Bojanczy,
Bartek Klin and Slawomir Lasota, Automata
with group actions, In acts of LICS 2011, IEEE Computer
Soc., Los Alamitos, CA. (2011) 355-364.
|
|
[11.3]
|
Néraud
J., Review MR2857695: Gwenaël Richome
and Patrice Séebold, On factorially
balanced sets of words, Theoret. Comput. Sci. 412, no 39, (2011) 5492-5497.
|
|
[11.2]
|
Néraud
J., Review MR2795437: Robert Dabrowski and Wojcieh Plandowski, On Word
Equations in One Variable, Algorithmica 60
(2011) 819-828.
|
|
[11.1]
|
Néraud
J., Review MR2799274: Emilie Charlier, Marion Legonidec, Michel Rigo,
Representing real numbers in a generalized numeration system, J. of Comp. and Syst. Sci. 77 (2011) 743-759.
|
|
[10.1]
|
Néraud
J., Review MR2667472: Oscar Ibarra, On the universe, disjointness,
and containment problems for simple machines, Info. Comp.
208 (2009) 1273-1282.
|
|
[09.5]
|
Néraud
J., Review MR2584162: Pavel Martyugin,
Complexity problems concerning reset words for some partial cases of
automata, Acta Cybernet. 19 (2009),
no 2, 517-536.
|
|
[09.4]
|
Néraud
J., Review MR2566945: Terry Anderson, John Loftus, Narad
Rampersad, Nicolas Santean
and Jeffery Shallit, Detecting patterns and
borders in regular languages, Info. and Comput. 207 (2009) 2401-2409.
|
|
[09.3]
|
Néraud
J., Review MR2536190: Fountain John, Gomes Gracinda,
and Victoria Gould, the ample monoid, Theoret. Comp. Sci. 410
(2009) 1096-1118.
|
|
[09.2]
|
Néraud
J., Review MR2522444: Krieger Dalia, Miller Averey,
Rampersad Narad, Ravikumar Bala, and Je rey Shallit, Decimation of
languages and state complexity, Theoret.
Comp. Sci. 410 (2009) 2401-2409.
|
|
[09.1]
|
Néraud
J., Review MR2508116: Gruber Hermann, Holzer
Markus and Martin Kutrib, More on the size of Higman-Haines sets: effective constructions, Funda. Informaticae
91 (2009) 105-121.
|
|
[08.3]
|
Néraud
J., Review MR2463011: Salomaa Arto,
Subword histories and associated matrices, Theoret.
Comp. Sci. 407 (2008), no 1-3, 250-257.
|
|
[08.2]
|
Néraud
J., Review MR2434033: Stepan Holub:
Parikh test sets for commutative languages, RAIRO, Theoret. Inf. Appl. 42 (2008)
525-537.
|
|
[08.1]
|
Néraud
J., Review MR2384872: Chen Kuo-Hsiang, Li Zheng-Zhu and Yen-Shung Tsai,
Overlapping words, codes, disjunctivity and
density of languages, International J. of Comp. Math. 85
(2008) 169-189.
|
|
[07.5]
|
Néraud
J., Review MR2364778: Attila Egry-Nagy and Crystopher Nehaniv: Finite
residue Class rings of integers modulo N from the viewpoint of global semigroup theory, Semigroups
and Formal Languages, Proceedings of the International Conference in Honour
of the 65th birthday of Donald B. McAlister, J. M. André, V. H. Fernandes, M. J. J. Branco,
J. Fountain, G. M. S. Gomes, J. C. Meakin,
editors, published in World Scientic
Press, (2007)
66-83.
|
|
[07.4]
|
Néraud
J., Review MR2356251: Francine Blanchet-Sadri and Nathan D. Wetzler, Partial words and the critical factorization
theorem revisited, Theoret.
Comp. Sci 385 (2007)
179-192.
|
|
[07.3]
|
Néraud
J., Review MR2330996: Pierre Arnoux, Valérie Berthé, Thomas fernique and Damien Jamet,
Functional stepped surfaces, flips, and generalzed
substitutions, Theoret. Comp. Sci 380 (2007) 251-265.
|
|
[07.2]
|
Néraud
J., Review MR2282862: Valérie Berthé
and Michel Rigo, Odometers in regular languages, Theoret. Comp. Sci
40 (2007) 1-31.
|
|
[07.1]
|
Néraud
J., Review MR2306518: S. Brelk, G. Melançon and G. paquin,,
Properties of the extremal infinite smooth words, Disc. Math. and Theoret. Comp. Sci 9:2 (2007) 33-50.
|
|
[06.4]
|
Néraud
J., Review MR2259637: Aldo De Luca and Alessandro De Luca, Pseudopalindrome closure operators in free monoids, Theoret. Comp. Sci. 362 (2006) 282-300.
|
|
[06.3]
|
Néraud
J., Review MR2259631: Arto Salomaa,
Independence of certain quantities indicating subword
occurrences, substitutions, Theoret. Comp. Sci. 362 (2006) 222-231.
|
|
[06.2]
|
Néraud
J., Review MR 2251099: Teturo Kamae,
Hui Rao, Bo Tan and
Yu-Mei Xue, Language structure of pattern Sturmian words, Discrete. Math. 306
(2006) 1651-1668.
|
|
[06.1]
|
Néraud
J., Review MR2265170: Edward Ochmanski and Krystyna Stawikowska,
Star-free and trace languages, Funda.
Info. 72 (2006) 323-331.
|
Top of the Page
|