RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Forthcoming papers
Archive
Impact factor
Guidelines for authors
License agreement

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy MIAN:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Tr. Mat. Inst. Steklova, 2011, Volume 274, Pages 130–136 (Mi tm3326)  
This article is cited in 3 scientific papers (total in 3 papers)

On maximal chains of systems of word equations

Juhani Karhumäki, Aleksi Saarela

Department of Mathematics and Turku Centre for Computer Science TUCS, University of Turku, Turku, Finland

Abstract: We consider systems of word equations and their solution sets. We discuss some fascinating properties of those, namely the size of a maximal independent set of word equations, and proper chains of solution sets of those. We recall the basic results, extend some known results and formulate several fundamental problems of the topic.

Full text: PDF file (153 kB)
References: PDF file   HTML file

English version:
Proceedings of the Steklov Institute of Mathematics, 2011, 274, 116–123

Bibliographic databases:

UDC: 512.53
Received in November 2010
Language:

Citation: Juhani Karhumäki, Aleksi Saarela, “On maximal chains of systems of word equations”, Algorithmic aspects of algebra and logic, Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday, Tr. Mat. Inst. Steklova, 274, MAIK Nauka/Interperiodica, Moscow, 2011, 130–136; Proc. Steklov Inst. Math., 274 (2011), 116–123

Citation in format AMSBIB
\Bibitem{KarSaa11}
\by Juhani~Karhum\"aki, Aleksi~Saarela
\paper On maximal chains of systems of word equations
\inbook Algorithmic aspects of algebra and logic
\bookinfo Collected papers. Dedicated to Academician Sergei Ivanovich Adian on the occasion of his 80th birthday
\serial Tr. Mat. Inst. Steklova
\yr 2011
\vol 274
\pages 130--136
\publ MAIK Nauka/Interperiodica
\publaddr Moscow
\mathnet{http://mi.mathnet.ru/tm3326}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2962938}
\elib{https://elibrary.ru/item.asp?id=16766478}
\transl
\jour Proc. Steklov Inst. Math.
\yr 2011
\vol 274
\pages 116--123
\crossref{https://doi.org/10.1134/S0081543811060083}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000295983200007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84911997484}


Linking options:
  • http://mi.mathnet.ru/eng/tm3326
  • http://mi.mathnet.ru/eng/tm/v274/p130

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Saarela A., “Systems of Word Equations, Polynomials and Linear Algebra: a New Approach”, Eur. J. Comb., 47 (2015), 1–14  crossref  mathscinet  isi
    2. Nowotka D., Saarela A., “One-Unknown Word Equations and Three-Unknown Constant-Free Word Equations”, Developments in Language Theory, Dlt 2016, Lecture Notes in Computer Science, 9840, eds. Brlek S., Reutenauer C., Springer Int Publishing Ag, 2016, 332–343  crossref  mathscinet  zmath  isi
    3. Nowotka D., Saarela A., “One-Variable Word Equations and Three-Variable Constant-Free Word Equations”, Int. J. Found. Comput. Sci., 29:5, SI (2018), 935–950  crossref  mathscinet  zmath  isi  scopus
    		• Труды Математического института им. В. А. Стеклова Proceedings of the Steklov Institute of Mathematics
    Number of views:
    This page:130
    Full text:32
    References:23
     
    Contact us:
    		  Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021