Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Automata, Languages and Combinatorics, Volume 24
Volume 24, Number 1, 2019
- Bas Broere, Hans Zantema:
The k-Dimensional Cube is k-Representable. 3-12 - Pascal Caron
, Marianne Flouret, Ludovic Mignot:
(k,l)-Unambiguity and Quasi-Deterministic Structures. 13-49 - Toufik Mansour, Armend Shaban Shabani, Daniel Yaqubi:
Cell Patterns in Integer Partitions. 51-63 - Hossein Teimoori Faal:
A Multiset Analogue of Cofactors. 65-87 - Markus A. Whiteland:
Asymptotic Abelian Complexities of Certain Morphic Binary Words. 89-114
Volume 24, Numbers 2-4, 2019
- Mikhail V. Volkov:
Preface. 119-121 - Ján Cerný:
A Note on Homogeneous Experiments with Finite Automata. 123-132 - Peter H. Starke:
A Remark About Homogeneous Experiments. 133-137 - Pavel Ageev:
Implementation of the Algorithm for Testing an Automaton for Synchronization in Linear Expected Time. 139-152 - Dmitry S. Ananichev, Vojtech Vorel:
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. 153-164 - Arturo Carpi, Flavio D'Alessandro:
Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems. 165-184 - Costanza Catalano, Raphaël M. Jungers:
On Random Primitive Sets, Directable NFAs and the Generation of Slowly Synchronizing DFAs. 185-217 - Dmitry Chistikov, Pavel Martyugin, Mahsa Shirmohammadi:
Synchronizing Automata over Nested Words. 219-251 - Henk Don, Hans Zantema:
Counting Symbol Switches in Synchronizing Automata. 253-286 - Henning Fernau, Stefan Hoffmann:
Extensions to Minimal Synchronizing Words. 287-307 - Achille Frigeri, Emanuele Rodaro:
Missing Factors of Ideals and Synchronizing Automata. 309-320 - François Gonze, Raphaël M. Jungers:
Hardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words. 321-342 - Cyril Nicaud:
The Černý Conjecture Holds with High Probability. 343-365 - Yaroslav Shitov:
An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata. 367-373 - Mikhail V. Volkov:
Slowly Synchronizing Automata with Idempotent Letters of Low Rank. 375-386
a service of 
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.
last updated on 2024-04-25 05:27 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:
