Found 5 results
Author Title Type [ Year(Asc)]
Filters: Author is Pribavkina, Elena V.  [Clear All Filters]
Pribavkina EV, Rodaro E. Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. In: Computability in Europe, CiE 2011. Vol LNCS, 6735.; 2011. 2. p. 230-238p. Edit
Pribavkina EV, Rodaro E. State complexity for code operators. International Journal of Foundations of Computer Science. 2011;22(7):1669-1681.Edit
Pribavkina EV, Rodaro E. Synchronizing automata with finitely many minimal synchronizing words. Information and Computation. 2011;209(3):568-579.Edit
Pribavkina EV, Rodaro E. Finitely generated synchronizing automata. In: Language and Automata Theory and Applications, LATA 2009. Vol LNCS, 5457.; 2009. 6. p. 672-683p. Edit
Error | CMUP


The website encountered an unexpected error. Please try again later.