Search for persons
X
?
Taming the Infinities of Concurrency; Lecture Notes in Computer Science ,
1
On Regular Expression Proof Complexity of Salomaa's Axiom S..:
, In:
?
Implementation and Application of Automata; Lecture Notes in Computer Science ,
6
The Pumping Lemma for Regular Languages is Hard:
, In:
?
Reversible Computation; Lecture Notes in Computer Science ,
8
Computational Complexity of Reversible Reaction Systems:
, In:
?
Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science ,
10
On Jaffe's Pumping Lemma, Revisited:
, In:
?
Proceedings of the 20th ACM International Conference on Computing Frontiers ,
11
Scalable Flow Simulations with the Lattice Boltzmann Method:
, In:
?
Implementation and Application of Automata; Lecture Notes in Computer Science ,
15