default search action
Mikhail V. Berlinkov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j7]Mikhail V. Berlinkov, Robert Ferens
, Marek Szykula
Preimage problems for deterministic finite automata. J. Comput. Syst. Sci. 115: 214-234 (2021) - [c9]Mikhail V. Berlinkov, Robert Ferens
Synchronizing Strongly Connected Partial DFAs. STACS 2021: 12:1-12:16 - [i12]Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula:
Synchronizing Strongly Connected Partial DFAs. CoRR abs/2101.05057 (2021) - 2020
- [j6]Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Almost-Group Automata. Int. J. Found. Comput. Sci. 31(8): 1091-1112 (2020)
2010 – 2019
- 2018
- [c8]Mikhail V. Berlinkov
Complexity of Preimage Problems for Deterministic Finite Automata. MFCS 2018: 32:1-32:14 - [c7]Mikhail V. Berlinkov
Synchronizing Random Almost-Group Automata. CIAA 2018: 84-96 - [i11]Mikhail V. Berlinkov, Cyril Nicaud:
Synchronizing Random Almost-Group Automata. CoRR abs/1805.02154 (2018) - 2017
- [i10]Mikhail V. Berlinkov, Robert Ferens, Marek Szykula:
Extending word problems in deterministic finite automata. CoRR abs/1704.08233 (2017) - 2016
- [j5]Mikhail V. Berlinkov
Algebraic synchronization criterion and computing reset words. Inf. Sci. 369: 718-730 (2016) - [c6]Mikhail V. Berlinkov
On the Probability of Being Synchronizable. CALDAM 2016: 73-84 - 2015
- [c5]Mikhail V. Berlinkov
Algebraic Synchronization Criterion and Computing Reset Words. MFCS (1) 2015: 103-115 - [i9]Mikhail V. Berlinkov:
Highest Trees of Random Mappings. CoRR abs/1504.04532 (2015) - 2014
- [j4]Mikhail V. Berlinkov
Approximating the Minimum Length of Synchronizing Words Is Hard. Theory Comput. Syst. 54(2): 211-223 (2014) - [c4]Mikhail V. Berlinkov
On Two Algorithmic Problems about Synchronizing Automata - (Short Paper). Developments in Language Theory 2014: 61-67 - [i8]Mikhail V. Berlinkov:
Testing for Synchronization. CoRR abs/1401.2553 (2014) - [i7]Mikhail V. Berlinkov:
On the Synchronization Rate for e-machines. CoRR abs/1406.7363 (2014) - [i6]Mikhail V. Berlinkov, Marek Szykula:
Computing Reset Words for Prefix Codes and Various Classes of Synchronizing Automata. CoRR abs/1412.8363 (2014) - 2013
- [j3]Mikhail V. Berlinkov
Synchronizing quasi-Eulerian and quasi-One-Cluster Automata. Int. J. Found. Comput. Sci. 24(6): 729-746 (2013) - [i5]Mikhail V. Berlinkov:
On the probability to be synchronizable. CoRR abs/1304.5774 (2013) - [i4]Mikhail V. Berlinkov:
On two Algorithmic Problems about Synchronizing Automata. CoRR abs/1312.2226 (2013) - 2012
- [c3]Mikhail V. Berlinkov
Synchronizing Automata on Quasi-Eulerian Digraph. CIAA 2012: 90-100 - [i3]Mikhail V. Berlinkov:
Synchronizing Automata on Quasi Eulerian Digraph. CoRR abs/1203.3402 (2012) - 2011
- [j2]Marie-Pierre Béal, Mikhail V. Berlinkov
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata. Int. J. Found. Comput. Sci. 22(2): 277-288 (2011) - [j1]Mikhail V. Berlinkov
On a Conjecture by carpi and d'alessandro. Int. J. Found. Comput. Sci. 22(7): 1565-1576 (2011) - 2010
- [c2]Mikhail V. Berlinkov
Approximating the Minimum Length of Synchronizing Words Is Hard. CSR 2010: 37-47 - [c1]Mikhail V. Berlinkov
On a Conjecture by Carpi and D'Alessandro. Developments in Language Theory 2010: 66-75
2000 – 2009
- 2009
- [i2]Mikhail V. Berlinkov:
On calculating length of minimal synchronizing words. CoRR abs/0909.3787 (2009) - [i1]Mikhail V. Berlinkov:
Extension Method and The Cerny Conjecture. CoRR abs/0909.3790 (2009)
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-20 23:05 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: