BibTeX records: Mikhail V. Berlinkov

download as .bib file

@inproceedings{DBLP:conf/mfcs/BerlinkovFS18,
  author    = {Mikhail V. Berlinkov and
               Robert Ferens and
               Marek Szykula},
  editor    = {Igor Potapov and
               Paul G. Spirakis and
               James Worrell},
  title     = {Complexity of Preimage Problems for Deterministic Finite Automata},
  booktitle = {43rd International Symposium on Mathematical Foundations of Computer
               Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
  series    = {LIPIcs},
  volume    = {117},
  pages     = {32:1--32:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.MFCS.2018.32},
  doi       = {10.4230/LIPIcs.MFCS.2018.32},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BerlinkovFS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/BerlinkovN18,
  author    = {Mikhail V. Berlinkov and
               Cyril Nicaud},
  editor    = {Cezar C{\^{a}}mpeanu},
  title     = {Synchronizing Random Almost-Group Automata},
  booktitle = {Implementation and Application of Automata - 23rd International Conference,
               {CIAA} 2018, Charlottetown, PE, Canada, July 30 - August 2, 2018,
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {10977},
  pages     = {84--96},
  publisher = {Springer},
  year      = {2018},
  url       = {https://doi.org/10.1007/978-3-319-94812-6\_8},
  doi       = {10.1007/978-3-319-94812-6\_8},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/wia/BerlinkovN18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-02154,
  author    = {Mikhail V. Berlinkov and
               Cyril Nicaud},
  title     = {Synchronizing Random Almost-Group Automata},
  journal   = {CoRR},
  volume    = {abs/1805.02154},
  year      = {2018},
  url       = {http://arxiv.org/abs/1805.02154},
  archivePrefix = {arXiv},
  eprint    = {1805.02154},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1805-02154.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerlinkovFS17,
  author    = {Mikhail V. Berlinkov and
               Robert Ferens and
               Marek Szykula},
  title     = {Extending word problems in deterministic finite automata},
  journal   = {CoRR},
  volume    = {abs/1704.08233},
  year      = {2017},
  url       = {http://arxiv.org/abs/1704.08233},
  archivePrefix = {arXiv},
  eprint    = {1704.08233},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BerlinkovFS17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/isci/BerlinkovS16,
  author    = {Mikhail V. Berlinkov and
               Marek Szykula},
  title     = {Algebraic synchronization criterion and computing reset words},
  journal   = {Inf. Sci.},
  volume    = {369},
  pages     = {718--730},
  year      = {2016},
  url       = {https://doi.org/10.1016/j.ins.2016.07.049},
  doi       = {10.1016/j.ins.2016.07.049},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/isci/BerlinkovS16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caldam/Berlinkov16,
  author    = {Mikhail V. Berlinkov},
  editor    = {Sathish Govindarajan and
               Anil Maheshwari},
  title     = {On the Probability of Being Synchronizable},
  booktitle = {Algorithms and Discrete Applied Mathematics - Second International
               Conference, {CALDAM} 2016, Thiruvananthapuram, India, February 18-20,
               2016, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9602},
  pages     = {73--84},
  publisher = {Springer},
  year      = {2016},
  url       = {https://doi.org/10.1007/978-3-319-29221-2\_7},
  doi       = {10.1007/978-3-319-29221-2\_7},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/caldam/Berlinkov16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BerlinkovS15,
  author    = {Mikhail V. Berlinkov and
               Marek Szykula},
  editor    = {Giuseppe F. Italiano and
               Giovanni Pighizzini and
               Donald Sannella},
  title     = {Algebraic Synchronization Criterion and Computing Reset Words},
  booktitle = {Mathematical Foundations of Computer Science 2015 - 40th International
               Symposium, {MFCS} 2015, Milan, Italy, August 24-28, 2015, Proceedings,
               Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9234},
  pages     = {103--115},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-48057-1\_8},
  doi       = {10.1007/978-3-662-48057-1\_8},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/mfcs/BerlinkovS15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Berlinkov15,
  author    = {Mikhail V. Berlinkov},
  title     = {Highest Trees of Random Mappings},
  journal   = {CoRR},
  volume    = {abs/1504.04532},
  year      = {2015},
  url       = {http://arxiv.org/abs/1504.04532},
  archivePrefix = {arXiv},
  eprint    = {1504.04532},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Berlinkov15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Berlinkov14,
  author    = {Mikhail V. Berlinkov},
  title     = {Approximating the Minimum Length of Synchronizing Words Is Hard},
  journal   = {Theory Comput. Syst.},
  volume    = {54},
  number    = {2},
  pages     = {211--223},
  year      = {2014},
  url       = {https://doi.org/10.1007/s00224-013-9511-y},
  doi       = {10.1007/s00224-013-9511-y},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/mst/Berlinkov14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/Berlinkov14,
  author    = {Mikhail V. Berlinkov},
  editor    = {Arseny M. Shur and
               Mikhail V. Volkov},
  title     = {On Two Algorithmic Problems about Synchronizing Automata - (Short
               Paper)},
  booktitle = {Developments in Language Theory - 18th International Conference, {DLT}
               2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {8633},
  pages     = {61--67},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-09698-8\_6},
  doi       = {10.1007/978-3-319-09698-8\_6},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/dlt/Berlinkov14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Berlinkov14,
  author    = {Mikhail V. Berlinkov},
  title     = {Testing for Synchronization},
  journal   = {CoRR},
  volume    = {abs/1401.2553},
  year      = {2014},
  url       = {http://arxiv.org/abs/1401.2553},
  archivePrefix = {arXiv},
  eprint    = {1401.2553},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Berlinkov14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Berlinkov14a,
  author    = {Mikhail V. Berlinkov},
  title     = {On the Synchronization Rate for e-machines},
  journal   = {CoRR},
  volume    = {abs/1406.7363},
  year      = {2014},
  url       = {http://arxiv.org/abs/1406.7363},
  archivePrefix = {arXiv},
  eprint    = {1406.7363},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Berlinkov14a.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BerlinkovS14,
  author    = {Mikhail V. Berlinkov and
               Marek Szykula},
  title     = {Computing Reset Words for Prefix Codes and Various Classes of Synchronizing
               Automata},
  journal   = {CoRR},
  volume    = {abs/1412.8363},
  year      = {2014},
  url       = {http://arxiv.org/abs/1412.8363},
  archivePrefix = {arXiv},
  eprint    = {1412.8363},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BerlinkovS14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Berlinkov13,
  author    = {Mikhail V. Berlinkov},
  title     = {Synchronizing quasi-Eulerian and quasi-One-Cluster Automata},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {24},
  number    = {6},
  pages     = {729--746},
  year      = {2013},
  url       = {https://doi.org/10.1142/S0129054113400157},
  doi       = {10.1142/S0129054113400157},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ijfcs/Berlinkov13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5774,
  author    = {Mikhail V. Berlinkov},
  title     = {On the probability to be synchronizable},
  journal   = {CoRR},
  volume    = {abs/1304.5774},
  year      = {2013},
  url       = {http://arxiv.org/abs/1304.5774},
  archivePrefix = {arXiv},
  eprint    = {1304.5774},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1304-5774.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Berlinkov13,
  author    = {Mikhail V. Berlinkov},
  title     = {On two Algorithmic Problems about Synchronizing Automata},
  journal   = {CoRR},
  volume    = {abs/1312.2226},
  year      = {2013},
  url       = {http://arxiv.org/abs/1312.2226},
  archivePrefix = {arXiv},
  eprint    = {1312.2226},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Berlinkov13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wia/Berlinkov12,
  author    = {Mikhail V. Berlinkov},
  editor    = {Nelma Moreira and
               Rog{\'{e}}rio Reis},
  title     = {Synchronizing Automata on Quasi-Eulerian Digraph},
  booktitle = {Implementation and Application of Automata - 17th International Conference,
               {CIAA} 2012, Porto, Portugal, July 17-20, 2012. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7381},
  pages     = {90--100},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-31606-7\_8},
  doi       = {10.1007/978-3-642-31606-7\_8},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/wia/Berlinkov12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-3402,
  author    = {Mikhail V. Berlinkov},
  title     = {Synchronizing Automata on Quasi Eulerian Digraph},
  journal   = {CoRR},
  volume    = {abs/1203.3402},
  year      = {2012},
  url       = {http://arxiv.org/abs/1203.3402},
  archivePrefix = {arXiv},
  eprint    = {1203.3402},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1203-3402.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/BealBP11,
  author    = {Marie{-}Pierre B{\'{e}}al and
               Mikhail V. Berlinkov and
               Dominique Perrin},
  title     = {A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster
               Automata},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {22},
  number    = {2},
  pages     = {277--288},
  year      = {2011},
  url       = {https://doi.org/10.1142/S0129054111008039},
  doi       = {10.1142/S0129054111008039},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ijfcs/BealBP11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Berlinkov11,
  author    = {Mikhail V. Berlinkov},
  title     = {On a Conjecture by carpi and d'alessandro},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {22},
  number    = {7},
  pages     = {1565--1576},
  year      = {2011},
  url       = {https://doi.org/10.1142/S012905411100888X},
  doi       = {10.1142/S012905411100888X},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/ijfcs/Berlinkov11.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Berlinkov10,
  author    = {Mikhail V. Berlinkov},
  editor    = {Farid M. Ablayev and
               Ernst W. Mayr},
  title     = {Approximating the Minimum Length of Synchronizing Words Is Hard},
  booktitle = {Computer Science - Theory and Applications, 5th International Computer
               Science Symposium in Russia, {CSR} 2010, Kazan, Russia, June 16-20,
               2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6072},
  pages     = {37--47},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-13182-0\_4},
  doi       = {10.1007/978-3-642-13182-0\_4},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/csr/Berlinkov10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/Berlinkov10,
  author    = {Mikhail V. Berlinkov},
  editor    = {Yuan Gao and
               Hanlin Lu and
               Shinnosuke Seki and
               Sheng Yu},
  title     = {On a Conjecture by Carpi and D'Alessandro},
  booktitle = {Developments in Language Theory, 14th International Conference, {DLT}
               2010, London, ON, Canada, August 17-20, 2010. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6224},
  pages     = {66--75},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-14455-4\_8},
  doi       = {10.1007/978-3-642-14455-4\_8},
  timestamp = {Fri, 27 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/dlt/Berlinkov10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3787,
  author    = {Mikhail V. Berlinkov},
  title     = {On calculating length of minimal synchronizing words},
  journal   = {CoRR},
  volume    = {abs/0909.3787},
  year      = {2009},
  url       = {http://arxiv.org/abs/0909.3787},
  archivePrefix = {arXiv},
  eprint    = {0909.3787},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-0909-3787.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-3790,
  author    = {Mikhail V. Berlinkov},
  title     = {Extension Method and The Cerny Conjecture},
  journal   = {CoRR},
  volume    = {abs/0909.3790},
  year      = {2009},
  url       = {http://arxiv.org/abs/0909.3790},
  archivePrefix = {arXiv},
  eprint    = {0909.3790},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-0909-3790.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics