Stephanie Reifferscheid

According to our database1, Stephanie Reifferscheid authored at least 5 papers between 2007 and 2011.

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

2011
Typed Monoids - An Eilenberg-like Theorem for non regular Languages.
Electron. Colloquium Comput. Complex., 2011

2009
An Approach to characterize the Regular Languages in TC0 with Linear Wires.
Electron. Colloquium Comput. Complex., 2009

Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG].
Proceedings of the Language and Automata Theory and Applications, 2009

Regular Languages Definable by Majority Quantifiers with Two Variables.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2007
Characterizing TC<sup>0</sup> in Terms of Infinite Groups.
Theory Comput. Syst., 2007


  Loading...