default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena V. Pribavkina
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c11]Vladimir V. Gusev
, Elena V. Pribavkina:
On Codeword Lengths Guaranteeing Synchronization. WORDS 2019: 207-216- 2017
- [j7]Vladimir V. Gusev, Raphaël M. Jungers, Elena V. Pribavkina:
Generalized primitivity of labeled digraphs. Electron. Notes Discret. Math. 61: 549-555 (2017) - 2016
- [c10]Vladimir V. Gusev, Elena V. Pribavkina:
On Synchronizing Colorings and the Eigenvectors of Digraphs. MFCS 2016: 48:1-48:14 - 2015
- [j6]Vladimir V. Gusev, Elena V. Pribavkina:
Reset Thresholds of Automata with Two Cycle Lengths. Int. J. Found. Comput. Sci. 26(7): 953-966 (2015) - [i9]Vladimir V. Gusev, Elena V. Pribavkina:
Synchronizing automata and principal eigenvectors of the underlying digraphs. CoRR abs/1511.09079 (2015) - 2014
- [j5]Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina:
Principal Ideal Languages and Synchronizing Automata. Fundam. Informaticae 132(1): 95-108 (2014) - [j4]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A coloring problem for infinite words. J. Comb. Theory A 125: 306-332 (2014) - [c9]Vladimir V. Gusev, Elena V. Pribavkina:
Reset Thresholds of Automata with Two Cycle Lengths. CIAA 2014: 200-210 - [i8]Vladimir V. Gusev, Elena V. Pribavkina:
Reset thresholds of automata with two cycle lengths. CoRR abs/1403.3992 (2014) - 2013
- [c8]Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina:
Finitely Generated Ideal Languages and Synchronizing Automata. WORDS 2013: 143-153 - [c7]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Sturmian and Episturmian Words. Developments in Language Theory 2013: 191-202 - [i7]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Sturmian and Episturmian Words. CoRR abs/1301.5263 (2013) - [i6]Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina:
Principal ideal languages and synchronizing automata. CoRR abs/1304.3307 (2013) - [i5]Vladimir V. Gusev, Marina I. Maslennikova, Elena V. Pribavkina:
Finitely generated ideal languages and synchronizing automata. CoRR abs/1305.0336 (2013) - [i4]Aldo de Luca, Elena V. Pribavkina, Luca Q. Zamboni:
A Coloring Problem for Infinite Words. CoRR abs/1307.2828 (2013) - 2011
- [j3]Elena V. Pribavkina, Emanuele Rodaro:
Synchronizing automata with finitely many minimal synchronizing words. Inf. Comput. 209(3): 568-579 (2011) - [j2]Elena V. Pribavkina, Emanuele Rodaro:
State Complexity of Code Operators. Int. J. Found. Comput. Sci. 22(7): 1669-1681 (2011) - [c6]Elena V. Pribavkina, Emanuele Rodaro:
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. CiE 2011: 230-238 - [c5]Vladimir V. Gusev, Elena V. Pribavkina:
On Non-complete Sets and Restivo's Conjecture. Developments in Language Theory 2011: 239-250 - [i3]Vladimir V. Gusev, Elena V. Pribavkina:
On Non-Complete Sets and Restivo's Conjecture. CoRR abs/1104.0388 (2011) - 2010
- [c4]Elena V. Pribavkina, Emanuele Rodaro:
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages. Developments in Language Theory 2010: 376-386 - [i2]Gabriele Fici, Elena V. Pribavkina, Jacques Sakarovitch:
On the Minimal Uncompletable Word Problem. CoRR abs/1002.1928 (2010)
2000 – 2009
- 2009
- [c3]Elena V. Pribavkina, Emanuele Rodaro:
State Complexity For Prefix, Suffix and Bifix operators on regular languages. ICTCS 2009: 183-189 - [c2]Elena V. Pribavkina, Emanuele Rodaro:
Finitely Generated Synchronizing Automata. LATA 2009: 672-683 - [i1]Elena V. Pribavkina:
Slowly synchronizing automata with zero and incomplete sets. CoRR abs/0907.4576 (2009) - 2006
- [j1]Elena V. Pribavkina:
On some Properties of the Language of 2-collapsing Words. Int. J. Found. Comput. Sci. 17(3): 665-676 (2006) - 2005
- [c1]Elena V. Pribavkina:
On Some Properties of the Language of 2-Collapsing Words. Developments in Language Theory 2005: 374-384
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 2025-01-09 13:01 CET 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:
