default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID3. CAI 2009: Thessaloniki, Greece
- Symeon Bozapalidis, George Rahonis:
Algebraic Informatics, Third International Conference, CAI 2009, Thessaloniki, Greece, May 19-22, 2009, Proceedings. Lecture Notes in Computer Science 5725, Springer 2009, ISBN 978-3-642-03563-0
Invited Paper of Werner Kuich
- Stephen L. Bloom, Zoltán Ésik, Werner Kuich:
Cycle-Free Finite Automata in Partial Iterative Semirings. 1-12
Tutorials
- Alessandra Cherubini, Matteo Pradella
:
Picture Languages: From Wang Tiles to 2D Grammars. 13-46 - Wan J. Fokkink:
Process Algebra: An Algebraic Theory of Concurrency. 47-77
Invited Papers
- Bruno Courcelle:
On Several Proofs of the Recognizability Theorem. 78-80 - Dietrich Kuske:
Theories of Automatic Structures and Their Complexity. 81-98 - Detlef Plump:
The Graph Programming Language GP. 99-122 - Franz Winkler:
Canonical Reduction Systems in Symbolic Mathematics. 123-135
Contributed Papers
- Paraskevas Alvanos, Dimitrios Poulakis:
Solving Norm Form Equations over Number Fields. 136-146 - Marcella Anselmo, Maria Madonia:
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages. 147-159 - Michel Bauderon, Rui Chen, Olivier Ly:
Context-Free Categorical Grammars. 160-171 - Symeon Bozapalidis, Archontia Grammatikopoulou:
An Eilenberg Theorem for Pictures. 172-188 - Symeon Bozapalidis, Antonios Kalampakas:
On the Complexity of the Syntax of Tree Languages. 189-203 - Bo Cui, Lila Kari, Shinnosuke Seki:
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. 204-219 - Konstantinos A. Draziotis:
Computation of Pell Numbers of the Form pX2. 220-226 - Zoltán Ésik, Tamás Hajgató:
Iteration Grove Theories with Applications. 227-249 - Gabriele Fici:
Combinatorics of Finite Words and Suffix Automata. 250-259 - Ondrej Klíma, Libor Polák:
Polynomial Operators on Classes of Regular Languages. 260-277 - Christos Koukouvinos, Dimitris E. Simos:
Self-dual Codes over Small Prime Fields from Combinatorial Designs. 278-287 - Andreas Maletti:
A Backward and a Forward Simulation for Weighted Tree Automata. 288-304 - Andreas Maletti, Catalin Ionut Tîrnauca:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. 305-317 - Gerasimos C. Meletiou:
Polynomial Interpolation of the k-th Root of the Discrete Logarithm. 318-323 - Friedrich Otto, Heiko Stamer:
Single-Path Restarting Tree Automata. 324-341 - Dana Pardubská, Martin Plátek, Friedrich Otto:
Parallel Communicating Grammar Systems with Regular Control. 342-360
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-15 20:53 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
