Seguir
Mikołaj Bojańczyk
Mikołaj Bojańczyk
Dirección de correo verificada de mimuw.edu.pl
Título
Citado por
Citado por
Año
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
439*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
2682009
Automata theory in nominal sets
M Bojańczyk, B Klin, S Lasota
Logical Methods in Computer Science 10, 2014
263*2014
Bounds in w-regularity
M Bojanczyk, T Colcombet
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), 285-296, 2006
1352006
Forest algebras
M laj Bojanczyk, I Walukiewicz
Automata and logic: history and perspectives, 107-132, 2008
1062008
Transducers with origin information
M Bojańczyk
Automata, Languages, and Programming: 41st International Colloquium, ICALP …, 2014
862014
A bounding quantifier
M Bojańczyk
International Workshop on Computer Science Logic, 41-55, 2004
832004
Weak MSO with the unbounding quantifier
M Bojańczyk
Theory of Computing Systems 48 (3), 554-576, 2011
812011
Nominal monoids
M Bojańczyk
Theory of Computing Systems 53 (2), 194-222, 2013
75*2013
Tree-walking automata do not recognize all regular languages
M Bojanczyk, T Colcombet
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
752005
Recognisable languages over monads
M Bojańczyk
International Conference on Developments in Language Theory, 1-13, 2015
692015
Towards nominal computation
M Bojanczyk, L Braud, B Klin, S Lasota
Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of …, 2012
692012
Definability equals recognizability for graphs of bounded treewidth
M Bojańczyk, M Pilipczuk
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
612016
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
612013
Piecewise testable tree languages
M Bojańczyk, L Segoufin, H Straubing
Logical Methods in Computer Science 8, 2012
592012
Weak MSO+ U over infinite trees
M Bojanczyk, S Torunczyk
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 648-660, 2012
592012
Tree-walking automata cannot be determinized
M Bojańczyk, T Colcombet
Theoretical Computer Science 350 (2-3), 164-173, 2006
572006
An extension of data automata that captures XPath
M Bojańczyk, S Lasota
Logical Methods in Computer Science 8, 2012
532012
Expressive power of pebble automata
M Bojańczyk, M Samuelides, T Schwentick, L Segoufin
International Colloquium on Automata, Languages, and Programming, 157-168, 2006
512006
XPath evaluation in linear time
M Bojańczyk, P Parys
Journal of the ACM (JACM) 58 (4), 1-33, 2011
502011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20