Result 1 to 20 of 24 total
Synchronization of automata with one undefined or ambiguous transition. (English)
Moreira, Nelma (ed.) et al., Implementation and application of automata. 17th international conference, CIAA 2012, Porto, Portugal, July 17‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31605-0/pbk). Lecture Notes in Computer Science 7381, 278-288 (2012).
1
The synchronizing probability function of an automaton. (English)
SIAM J. Discrete Math. 26, No. 1, 177-192 (2012).
2
On a conjecture by Carpi and D’Alessandro. (English)
Int. J. Found. Comput. Sci. 22, No. 7, 1565-1576 (2011).
3
The Černý conjecture for one-cluster automata with prime length cycle. (English)
Theor. Comput. Sci. 412, No. 39, 5487-5491 (2011).
4
Synchronizing automata with finitely many minimal synchronizing words. (English)
Inf. Comput. 209, No. 3, 568-579 (2011).
5
Experiments on synchronizing automata. (English)
Schedae Inform. 19, 35-51 (2010).
6
On the hybrid Černý-road coloring problem and Hamiltonian paths. (English)
Gao, Yuan (ed.) et al., Developments in language theory. 14th international conference, DLT 2010, London, ON, Canada, August 17‒20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14454-7/pbk). Lecture Notes in Computer Science 6224, 124-135 (2010).
7
Černý’s conjecture and group representation theory. (English)
J. Algebr. Comb. 31, No. 1, 83-109 (2010).
8
On the length of shortest 2-collapsing words. (English)
Discrete Math. Theor. Comput. Sci. 11, No. 1, 33-44, electronic only (2009).
9
Synchronizing automata preserving a chain of partial orders. (English)
Theor. Comput. Sci. 410, No. 37, 3513-3519 (2009).
10
Primitive permutation groups and their section-regular partitions. (English)
Mich. Math. J. 58, No. 1, 309-322 (2009).
11
Lower bounds for the length of the shortest carefully synchronizing words for two- and three-letter partial automata. (Russian)
Diskretn. Anal. Issled. Oper. 15, No. 4, 44-56 (2008).
12
2-synchronizing words. (English)
Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. Second international conference, LATA 2008, Tarragona, Spain, March 13‒19, 2008. Revised papers. Berlin: Springer (ISBN 978-3-540-88281-7/pbk). Lecture Notes in Computer Science 5196, 221-231 (2008).
13
The synchronization problem for strongly transitive automata. (English)
Ito, Masami (ed.) et al., Developments in language theory. 12th international conference, DLT 2008, Kyoto, Japan, September 16‒19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85779-2/pbk). Lecture Notes in Computer Science 5257, 240-251 (2008).
14
Automata and square complexes. (English)
Geom. Dedicata 111, 43-64 (2005).
15
Synchronizing generalized monotonic automata. (English)
Theor. Comput. Sci. 330, No. 1, 3-13 (2005).
16
Some results on Černý type problems for transformation semigroups languages. (English)
Araújo, Isabel M. (ed.) et al., Semigroups and languages. Proceedings of the workshop, Lisboa, Portugal, November 27‒29, 2002. River Edge, NJ: World Scientific (ISBN 981-238-917-2/hbk). 23-42 (2004).
17
Synchronizing monotonic automata. (English)
Theor. Comput. Sci. 327, No. 3, 225-239 (2004).
18
Image reducing words and subgroups of free groups. (English)
Theor. Comput. Sci. 307, No. 1, 77-92 (2003).
19
Discrete systems analysis. (Analiz diskretnykh sistem.) (Russian)
Donetsk: Natsional’naya Akademiya Nauk Ukrainy, Institut Prikladnoj Matematiki i Mekhaniki. 172 p. (2002).
20
Result 1 to 20 of 24 total
Start
Contact
Print
General Help
