Volgen
Mikołaj Bojańczyk
Mikołaj Bojańczyk
Geverifieerd e-mailadres voor mimuw.edu.pl
Titel
Geciteerd door
Geciteerd door
Jaar
Two-variable logic on data words
M Bojańczyk, C David, A Muscholl, T Schwentick, L Segoufin
ACM Transactions on Computational Logic (TOCL) 12 (4), 1-26, 2011
415*2011
Two-variable logic on data trees and XML reasoning
M Bojańczyk, A Muscholl, T Schwentick, L Segoufin
Journal of the ACM (JACM) 56 (3), 1-48, 2009
2622009
Automata theory in nominal sets
M Bojańczyk, B Klin, S Lasota
arXiv preprint arXiv:1402.0897, 2014
239*2014
Bounds in w-regularity
M Bojanczyk, T Colcombet
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 285-296, 2006
1282006
Forest algebras
M laj Bojanczyk, I Walukiewicz
Automata and logic: history and perspectives, 107-132, 2008
1022008
A bounding quantifier
M Bojańczyk
International Workshop on Computer Science Logic, 41-55, 2004
792004
Transducers with origin information
M Bojańczyk
International Colloquium on Automata, Languages, and Programming, 26-37, 2014
782014
Weak MSO with the unbounding quantifier
M Bojańczyk
Theory of Computing Systems 48 (3), 554-576, 2011
762011
Nominal monoids
M Bojańczyk
Theory of Computing Systems 53 (2), 194-222, 2013
67*2013
Towards nominal computation
M Bojanczyk, L Braud, B Klin, S Lasota
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2012
672012
Tree-walking automata do not recognize all regular languages
M Bojańczyk, T Colcombet
SIAM Journal on Computing 38 (2), 658-701, 2008
632008
Recognisable languages over monads
M Bojańczyk
International Conference on Developments in Language Theory, 1-13, 2015
602015
Turing machines with atoms
M Bojanczyk, B Klin, S Lasota, S Torunczyk
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 183-192, 2013
602013
Piecewise testable tree languages
M Bojanczyk, L Segoufin, H Straubing
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 442-451, 2008
592008
XPath evaluation in linear time
M Bojańczyk, P Parys
Journal of the ACM (JACM) 58 (4), 1-33, 2011
542011
An extension of data automata that captures XPath
M Bojańczyk, S Lasota
2010 25th Annual IEEE Symposium on Logic in Computer Science, 243-252, 2010
542010
Weak MSO+ U over infinite trees
M Bojanczyk, S Torunczyk
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012
532012
Definability equals recognizability for graphs of bounded treewidth*
M Bojańczyk, M Pilipczuk
2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016
512016
Characterizing EF and EX tree logics
M Bojańczyk, I Walukiewicz
Theoretical Computer Science 358 (2-3), 255-272, 2006
512006
Tree-walking automata cannot be determinized
M Bojańczyk, T Colcombet
Theoretical Computer Science 350 (2-3), 164-173, 2006
502006
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20