default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna E. Frid
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[e2]Anna E. Frid, Robert Mercas
:
Combinatorics on Words - 14th International Conference, WORDS 2023, Umeå, Sweden, June 12-16, 2023, Proceedings. Lecture Notes in Computer Science 13899, Springer 2023, ISBN 978-3-031-33179-4 [contents]- 2022
- [c12]Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic:
Prefix Palindromic Length of the Sierpinski Word. DLT 2022: 78-89 - [i15]Dora V. Bulgakova, Anna E. Frid, Jérémy Scanvic:
Prefix palindromic length of the Sierpinski word. CoRR abs/2201.09556 (2022) - 2021
- [j25]Anna E. Frid, Enzo Laborde, Jarkko Peltomäki:
On prefix palindromic length of automatic words. Theor. Comput. Sci. 891: 13-23 (2021) - 2020
- [j24]Mélodie Andrieu, Anna E. Frid:
Morphic words and equidistributed sequences. Theor. Comput. Sci. 804: 171-185 (2020) - [i14]Anna E. Frid, Enzo Laborde, Jarkko Peltomäki:
On prefix palindromic length of automatic words. CoRR abs/2009.02934 (2020)
2010 – 2019
- 2019
- [j23]Anna E. Frid:
Prefix Palindromic Length of the Thue-Morse Word. J. Integer Seq. 22(7): 19.7.8 (2019) - [j22]Pierre Bonardo, Anna E. Frid, Jeffrey O. Shallit:
The number of valid factorizations of Fibonacci prefixes. Theor. Comput. Sci. 775: 68-75 (2019) - [c11]Anna E. Frid:
First Lower Bounds for Palindromic Length. DLT 2019: 234-243 - [i13]Anna E. Frid:
Prefix palindromic length of the Thue-Morse word. CoRR abs/1906.09392 (2019) - 2018
- [j21]Anna E. Frid:
Sturmian numeration systems and decompositions to palindromes. Eur. J. Comb. 71: 202-212 (2018) - [i12]Pierre Bonardo, Anna E. Frid:
Number of valid decompositions of Fibonacci prefixes. CoRR abs/1806.09534 (2018) - [i11]Mélodie Andrieu, Anna E. Frid:
Equidistributed sequences and pure morphic subshifts. CoRR abs/1807.08321 (2018) - 2017
- [j20]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Minimal complexity of equidistributed infinite permutations. Eur. J. Comb. 65: 24-36 (2017) - [i10]Anna E. Frid:
Sturmian numeration systems and decompositions to palindromes. CoRR abs/1710.11553 (2017) - 2016
- [i9]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Cost and dimension of words of zero topological entropy. CoRR abs/1607.04728 (2016) - 2015
- [c10]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Canonical Representatives of Morphic Permutations. WORDS 2015: 59-72 - [c9]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic Infinite Permutations of Minimal Complexity. DLT 2015: 71-84 - [i8]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Ergodic infinite permutations of minimal complexity. CoRR abs/1503.06188 (2015) - [i7]Anna E. Frid:
Words containing all permutations of a family of factors. CoRR abs/1510.08114 (2015) - [i6]Sergey V. Avgustinovich, Anna E. Frid, Svetlana Puzynina:
Canonical Representatives of Morphic Permutations. CoRR abs/1510.08371 (2015) - 2014
- [j19]Anna E. Frid, Damien Jamet:
The number of binary rotation words. RAIRO Theor. Informatics Appl. 48(4): 453-465 (2014) - [c8]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword Complexity and Decomposition of the Set of Factors. MFCS (1) 2014: 147-158 - [i5]Julien Cassaigne, Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
Subword complexity and decomposition of the set of factors. CoRR abs/1406.3974 (2014) - 2013
- [j18]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
On palindromic factorization of words. Adv. Appl. Math. 50(5): 737-748 (2013) - [i4]Anna E. Frid, Damien Jamet:
The number of binary rotation words. CoRR abs/1302.3722 (2013) - 2012
- [j17]Anna E. Frid, Luca Q. Zamboni:
On automatic infinite permutations. RAIRO Theor. Informatics Appl. 46(1): 77-85 (2012) - [i3]Anna E. Frid, Svetlana Puzynina, Luca Q. Zamboni:
On minimal factorizations of words as products of palindromes. CoRR abs/1210.6179 (2012) - 2011
- [j16]Petr Ambroz, Anna E. Frid, Zuzana Masáková, Edita Pelantová:
On the number of factors in codings of three interval exchange. Discret. Math. Theor. Comput. Sci. 13(3): 51-66 (2011) - [j15]Sergey V. Avgustinovich, Anna E. Frid, Teturo Kamae, Pavel Salimov:
Infinite permutations of lowest maximal pattern complexity. Theor. Comput. Sci. 412(27): 2911-2921 (2011) - [c7]Anna E. Frid:
Infinite permutations vs. infinite words. WORDS 2011: 13-19 - [i2]Anna E. Frid, Luca Q. Zamboni:
On automatic infinite permutations. CoRR abs/1109.6131 (2011)
2000 – 2009
- 2009
- [j14]Anna E. Frid:
Simple equations on binary factorial languages. Theor. Comput. Sci. 410(30-32): 2947-2956 (2009) - [e1]Anna E. Frid, Andrey Morozov, Andrey Rybalchenko, Klaus W. Wagner:
Computer Science - Theory and Applications, Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009. Proceedings. Lecture Notes in Computer Science 5675, Springer 2009, ISBN 978-3-642-03350-6 [contents] - 2007
- [j13]Dmitry Fon-Der-Flaass, Anna E. Frid:
On periodicity and low complexity of infinite permutations. Eur. J. Comb. 28(8): 2106-2114 (2007) - [j12]Julien Cassaigne, Anna E. Frid:
On the arithmetical complexity of Sturmian words. Theor. Comput. Sci. 380(3): 304-316 (2007) - [c6]Anna E. Frid:
Commutation of Binary Factorial Languages. Developments in Language Theory 2007: 193-204 - 2006
- [j11]Anna E. Frid:
On possible growths of arithmetical complexity. RAIRO Theor. Informatics Appl. 40(3): 443-458 (2006) - [j10]Sergey V. Avgustinovich, Julien Cassaigne, Anna E. Frid:
Sequences of low arithmetical complexity. RAIRO Theor. Informatics Appl. 40(4): 569-582 (2006) - [c5]Sergey V. Avgustinovich, Anna E. Frid:
Canonical Decomposition of a Regular Factorial Language. CSR 2006: 18-22 - [i1]Anna E. Frid:
Canonical decomposition of catenation of factorial languages. CoRR abs/cs/0610149 (2006) - 2005
- [j9]Sergey V. Avgustinovich, Anna E. Frid:
A Unique Decomposition Theorem for Factorial Languages. Int. J. Algebra Comput. 15(1): 149-160 (2005) - [j8]Anna E. Frid:
Sequences of linear arithmetical complexity. Theor. Comput. Sci. 339(1): 68-87 (2005) - 2003
- [j7]Anna E. Frid:
Arithmetical complexity of symmetric D0L words. Theor. Comput. Sci. 306(1-3): 535-542 (2003) - 2002
- [j6]Sergey V. Avgustinovich, Anna E. Frid:
Words Avoiding Abelian Inclusions. J. Autom. Lang. Comb. 7(1): 3-9 (2002) - 2001
- [j5]Anna E. Frid:
On the subword complexity of iteratively generated infinite words. Discret. Appl. Math. 114(1-3): 115-120 (2001) - [j4]Anna E. Frid:
On factor graphs of DOL words. Discret. Appl. Math. 114(1-3): 121-130 (2001) - [j3]Anna E. Frid:
Overlap-free symmetric D0L words. Discret. Math. Theor. Comput. Sci. 4(2): 357-362 (2001) - 2000
- [c4]Sergey V. Avgustinovich, Dmitry Fon-Der-Flaass, Anna E. Frid:
Arithmetical Complexity of Infinite Words. Words, Languages & Combinatorics 2000: 51-62
1990 – 1999
- 1999
- [j2]Anna E. Frid:
Applying a uniform marked morphism to a word. Discret. Math. Theor. Comput. Sci. 3(3): 125-140 (1999) - 1998
- [j1]Anna E. Frid:
On the Frequency of Factors in a D0L Word. J. Autom. Lang. Comb. 3(1): 29-41 (1998) - [c3]Anna E. Frid, Sergey V. Avgustinovich:
On Bispecial Words and Subword Complexity of DOL Sequences. SETA 1998: 191-204 - [c2]Anna E. Frid:
On Uniform DOL Words. STACS 1998: 544-554 - 1997
- [c1]Anna E. Frid:
The Subword Complexity of Fixed Points of Binary Uniform Morphisms. FCT 1997: 179-187
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
