Search for persons
X
?
Reversible Computation; Lecture Notes in Computer Science ,
3
Computational Complexity of Reversible Reaction Systems:
, In:
?
Implementation and Application of Automata; Lecture Notes in Computer Science ,
5
The Pumping Lemma for Regular Languages is Hard:
, In:
?
Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science ,
6
On Jaffe's Pumping Lemma, Revisited:
, In:
?
Implementation and Application of Automata; Lecture Notes in Computer Science ,
9
On 25 Years of CIAA Through the Lens of Data Science:
, In:
?
Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science ,
11
On the Descriptional Complexity of the Direct Product of Fi..:
, In:
?
Developments in Language Theory; Lecture Notes in Computer Science ,
12
The Range of State Complexities of Languages Resulting from..:
, In:
?
Implementation and Application of Automata; Lecture Notes in Computer Science ,
13
The Range of State Complexities of Languages Resulting from..:
, In:
?
Computer Science – Theory and Applications; Lecture Notes in Computer Science ,
14
On the Computational Complexity of Reaction Systems, Revisi..:
, In:
?
Descriptional Complexity of Formal Systems; Lecture Notes in Computer Science ,
15