Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Kisielewicz, Andrzej - Mathematical Institute, University of Wroclaw
Supergraphs and graphical complexity of permutation groups
freeness automorphism groups synchronization Some EH-problems
Supergraphs. Ideas, results and problems. Andrzej Kisielewicz
Konkurs programw vs Wumpus zasady: 1. Pola ponumerowane s [0..4,0..4]
ARTIFICIAL INTELLIGENCE (A Modern Approach) by S. Russell and P. Norvig, Prentice-Hall, Inc., New Jersey 2002
The Road Coloring Problem A.N. Trahtman
An efficient algorithm finds noticeable trends and examples concerning the Cerny conjecture
Modifying the upper Bound on the Length of Minimal Synchronizing Word
arXiv:1005.0129v1[cs.FL]2May2010 Slowly synchronizing automata and digraphs
The Cerny Conjecture for Aperiodic A. N. Trahtman
SYNCHRONISING AUTOMATA AND A CONJECTURE OF CERNY
Theoretical Computer Science 295 (2003) 223232 www.elsevier.com/locate/tcs
