Symeon Bozapalidis

According to our database1, Symeon Bozapalidis
  • authored at least 41 papers between 1983 and 2017.
  • has a "Dijkstra number"2 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Stochastic Semantics.
Fundam. Inform., 2017

Varieties of Graphoids and Birkoff's Theorem for Graphs.
Acta Cybern., 2017

2013
Stochastic Equationality.
Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2012
Equational weighted tree transformations.
Acta Inf., 2012

2011
Equational tree transformations.
Theor. Comput. Sci., 2011

2010
On the syntactic complexity of tree series.
RAIRO - Theor. Inf. and Applic., 2010

Fuzzy tree language recognizability.
Fuzzy Sets and Systems, 2010

2009
On the Complexity of the Syntax of Tree Languages.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

An Eilenberg Theorem for Pictures.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
Graph automata.
Theor. Comput. Sci., 2008

On the recognizability of fuzzy languages II.
Fuzzy Sets and Systems, 2008

Picture deformation.
Acta Inf., 2008

2006
Picture codes.
ITA, 2006

On the recognizability of Fuzzy languages I.
Fuzzy Sets and Systems, 2006

Finitely Presentable Tree Series.
Acta Cybern., 2006

Recognizability of graph and pattern languages.
Acta Inf., 2006

2005
Recognizable Picture Series.
Journal of Automata, Languages and Combinatorics, 2005

On the Closure of Recognizable Tree Series Under Tree Homomorphisms.
Journal of Automata, Languages and Combinatorics, 2005

2004
An axiomatization of graphs.
Acta Inf., 2004

2003
Extending Stochastic and Quantum Functions.
Theory Comput. Syst., 2003

A Finite Complete Set of Equations Generating Graphs.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002
Polypodic codes.
ITA, 2002

2001
Context-Free Series on Trees.
Inf. Comput., 2001

Transduction in polypodes.
Proceedings of the Where Mathematics, 2001

2000
Quantum Recognizable Tree Functions.
Proceedings of the Unconventional Models of Computation, 2000

New Syntactical Invariants for Tree Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
Equational Elements in Additive Algebras.
Theory Comput. Syst., 1999

An Introduction To Polypodic Structures.
J. UCS, 1999

1997
Positive Tree Representations and Applications to Tree Automata.
Inf. Comput., 1997

Mezei-Wright Theory on N-Subsets of an Algebra.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
Convex Algebras, Convex Modules and Formal Power Series on Trees.
Journal of Automata, Languages and Combinatorics, 1996

1994
Representable Tree Series.
Fundam. Inform., 1994

On two Families of Forests.
Acta Inf., 1994

1992
Alphabetic Tree Relations.
Theor. Comput. Sci., 1992

1991
Effective Construction of the Syntactic Algebra of a Recognizable Series on Trees.
Acta Inf., 1991

1990
Constructions Effectives sur les Séries Formelles d'Arbres.
Theor. Comput. Sci., 1990

1989
Représentations Matricielles Des Séries D'Arbre Reconnaissables.
ITA, 1989

1988
Sur Une Classe De Transformations D'Arbres.
ITA, 1988

Varieties of Formal Series on Trees and Eilenberg's Theorem.
Inf. Process. Lett., 1988

1987
Weighted Grammars and Kleene's Theorem.
Inf. Process. Lett., 1987

1983
The Rank of a Formal Tree Power Series.
Theor. Comput. Sci., 1983


  Loading...