1
TITLE: STATE COMPLEXITY OF CODE OPERATORS  Full Text
AUTHORS: Elena Pribavkina; Emanuele Rodaro ;
PUBLISHED: 2011, SOURCE: INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, VOLUME: 22, ISSUE: 7
INDEXED IN: Scopus WOS
2
TITLE: Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete
AUTHORS: Pribavkina, EV; Rodaro, E ;
PUBLISHED: 2011, SOURCE: 7th Conference on Computability in Europe, CiE 2011 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOLUME: 6735 LNCS
INDEXED IN: Scopus CrossRef
3
TITLE: Synchronizing automata with finitely many minimal synchronizing words  Full Text
AUTHORS: Elena V Pribavkina; Emanuele Rodaro ;
PUBLISHED: 2011, SOURCE: 3rd International Conference on Language and Automata Theory and Applications in INFORMATION AND COMPUTATION, VOLUME: 209, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef
4
TITLE: STATE COMPLEXITY OF CODE OPERATORS  Full Text
AUTHORS: ELENA PRIBAVKINA; EMANUELE RODARO;
PUBLISHED: 2011, SOURCE: Int. J. Found. Comput. Sci. - International Journal of Foundations of Computer Science, VOLUME: 22, ISSUE: 07
INDEXED IN: CrossRef
5
TITLE: State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages  Full Text
AUTHORS: Elena V Pribavkina; Emanuele Rodaro ;
PUBLISHED: 2010, SOURCE: 14th International Conference on Developments in Language Theory in DEVELOPMENTS IN LANGUAGE THEORY, VOLUME: 6224
INDEXED IN: Scopus WOS CrossRef
6
TITLE: Finitely Generated Synchronizing Automata  Full Text
AUTHORS: Elena V Pribavkina; Emanuele Rodaro ;
PUBLISHED: 2009, SOURCE: 3rd International Conference on Language and Automata Theory and Applications in LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS, VOLUME: 5457
INDEXED IN: Scopus WOS CrossRef