Szczepan Hummel

According to our database1, Szczepan Hummel authored at least 5 papers between 2009 and 2015.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
On Unambiguous Regular Tree Languages of Index (0, 2).
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2012
The Topological Complexity of MSO+U and Related Automata Models.
Fundam. Informaticae, 2012

Unambiguous Tree Languages Are Topologically Harder Than Deterministic Ones
Proceedings of the Proceedings Third International Symposium on Games, 2012

2010
On the Topological Complexity of MSO+U and Related Automata Models.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

2009
On the Borel Inseparability of Game Tree Languages.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009


  Loading...