Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
TAMM, HELLIS
2008.
ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA.
International Journal of Foundations of Computer Science,
Vol. 19,
Issue. 03,
p.
677.
BÉAL, MARIE-PIERRE
BURDERI, FABIO
and
RESTIVO, ANTONIO
2009.
CODING PARTITIONS OF REGULAR SETS.
International Journal of Algebra and Computation,
Vol. 19,
Issue. 08,
p.
1011.
Ouchenne, Boulares
and
Kone, Ousmane
2010.
A Security Control Architecture for SOAP-Based Services.
p.
261.
Broda, Sabine
Machiavelo, António
Moreira, Nelma
and
Reis, Rogério
2010.
Developments in Language Theory.
Vol. 6224,
Issue. ,
p.
112.
Aubrun, Nathalie
and
Béal, Marie-Pierre
2010.
Computer Science – Theory and Applications.
Vol. 6072,
Issue. ,
p.
12.
Minamide, Y
Sakuma, Y
and
Voronkov, A
2010.
Translating Regular Expression Matching into Transducers.
p.
107.
Carton, Olivier
2010.
Computer Science – Theory and Applications.
Vol. 6072,
Issue. ,
p.
96.
Pin, Jean-Éric
2011.
Algebraic Informatics.
Vol. 6742,
Issue. ,
p.
44.
Fichtner, Ina
and
Mathissen, Christian
2011.
Algebraic Foundations in Computer Science.
Vol. 7020,
Issue. ,
p.
94.
Broda, Sabine
Machiavelo, António
Moreira, Nelma
and
Reis, Rogério
2011.
Developments in Language Theory.
Vol. 6795,
Issue. ,
p.
93.
Ochsenschlager, Peter
and
Rieke, Roland
2011.
Security Properties of Self-Similar Uniformly Parameterised Systems of Cooperations.
p.
640.
Howard Johnson, J.
2011.
Implementation and Application of Automata.
Vol. 6482,
Issue. ,
p.
173.
Charlier, Émilie
Rampersad, Narad
and
Shallit, Jeffrey
2011.
Developments in Language Theory.
Vol. 6795,
Issue. ,
p.
165.
Thomas, Wolfgang
2011.
Logic and Its Applications.
Vol. 6521,
Issue. ,
p.
19.
Konstantinidis, Stavros
and
Santean, Nicolae
2011.
DNA Computing and Molecular Programming.
Vol. 6937,
Issue. ,
p.
115.
Middeldorp, Aart
Moser, Georg
Neurauter, Friedrich
Waldmann, Johannes
and
Zankl, Harald
2011.
Algebraic Informatics.
Vol. 6742,
Issue. ,
p.
1.
BÉAL, MARIE-PIERRE
BERLINKOV, MIKHAIL V.
and
PERRIN, DOMINIQUE
2011.
A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA.
International Journal of Foundations of Computer Science,
Vol. 22,
Issue. 02,
p.
277.
Aubrun, Nathalie
and
Béal, Marie-Pierre
2012.
Tree-shifts of finite type.
Theoretical Computer Science,
Vol. 459,
Issue. ,
p.
16.
Sutner, Klaus
and
Lewi, Kevin
2012.
Descriptional Complexity of Formal Systems.
Vol. 7386,
Issue. ,
p.
294.
BRODA, SABINE
MACHIAVELO, ANTÓNIO
MOREIRA, NELMA
and
REIS, ROGÉRIO
2012.
ON THE AVERAGE SIZE OF GLUSHKOV AND PARTIAL DERIVATIVE AUTOMATA.
International Journal of Foundations of Computer Science,
Vol. 23,
Issue. 05,
p.
969.