|
|
Conferences in DBLP
(cai)
2009 (conf/cai/2009)
Cycle-Free Finite Automata in Partial Iterative Semirings. [Citation Graph (, )][DBLP]
Picture Languages: From Wang Tiles to 2D Grammars. [Citation Graph (, )][DBLP]
Process Algebra: An Algebraic Theory of Concurrency. [Citation Graph (, )][DBLP]
On Several Proofs of the Recognizability Theorem. [Citation Graph (, )][DBLP]
Theories of Automatic Structures and Their Complexity. [Citation Graph (, )][DBLP]
The Graph Programming Language GP. [Citation Graph (, )][DBLP]
Canonical Reduction Systems in Symbolic Mathematics. [Citation Graph (, )][DBLP]
Solving Norm Form Equations over Number Fields. [Citation Graph (, )][DBLP]
A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages. [Citation Graph (, )][DBLP]
Context-Free Categorical Grammars. [Citation Graph (, )][DBLP]
An Eilenberg Theorem for Pictures. [Citation Graph (, )][DBLP]
On the Complexity of the Syntax of Tree Languages. [Citation Graph (, )][DBLP]
On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes. [Citation Graph (, )][DBLP]
Computation of Pell Numbers of the Form pX2. [Citation Graph (, )][DBLP]
Iteration Grove Theories with Applications. [Citation Graph (, )][DBLP]
Combinatorics of Finite Words and Suffix Automata. [Citation Graph (, )][DBLP]
Polynomial Operators on Classes of Regular Languages. [Citation Graph (, )][DBLP]
Self-dual Codes over Small Prime Fields from Combinatorial Designs. [Citation Graph (, )][DBLP]
A Backward and a Forward Simulation for Weighted Tree Automata. [Citation Graph (, )][DBLP]
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. [Citation Graph (, )][DBLP]
Polynomial Interpolation of the k-th Root of the Discrete Logarithm. [Citation Graph (, )][DBLP]
Single-Path Restarting Tree Automata. [Citation Graph (, )][DBLP]
Parallel Communicating Grammar Systems with Regular Control. [Citation Graph (, )][DBLP]
|
