Algebraic Informatics - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642035630, 9783642035647

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Polynomial Interpolation of the k-th Root of the Discrete Logarithm

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_21 ◽

2009 ◽

pp. 318-323 ◽

Cited By ~ 1

Author(s):

Gerasimos C. Meletiou

Keyword(s):

Polynomial Interpolation ◽

Discrete Logarithm

Download Full-text

Polynomial Operators on Classes of Regular Languages

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_17 ◽

2009 ◽

pp. 260-277 ◽

Cited By ~ 2

Author(s):

Ondřej Klíma ◽

Libor Polák

Keyword(s):

Regular Languages ◽

Polynomial Operators

Download Full-text

The Graph Programming Language GP

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_6 ◽

2009 ◽

pp. 99-122 ◽

Cited By ~ 17

Author(s):

Detlef Plump

Keyword(s):

Programming Language

Download Full-text

On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_13 ◽

2009 ◽

pp. 204-219

Author(s):

Bo Cui ◽

Lila Kari ◽

Shinnosuke Seki

Download Full-text

Theories of Automatic Structures and Their Complexity

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_5 ◽

2009 ◽

pp. 81-98 ◽

Cited By ~ 1

Author(s):

Dietrich Kuske

Keyword(s):

Automatic Structures

Download Full-text

On the Complexity of the Syntax of Tree Languages

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_12 ◽

2009 ◽

pp. 189-203 ◽

Cited By ~ 2

Author(s):

Symeon Bozapalidis ◽

Antonios Kalampakas

Keyword(s):

Tree Languages

Download Full-text

Cycle-Free Finite Automata in Partial Iterative Semirings

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_1 ◽

2009 ◽

pp. 1-12

Author(s):

Stephen L. Bloom ◽

Zoltan Ésik ◽

Werner Kuich

Keyword(s):

Finite Automata

Download Full-text

Canonical Reduction Systems in Symbolic Mathematics

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_7 ◽

2009 ◽

pp. 123-135 ◽

Cited By ~ 1

Author(s):

Franz Winkler

Download Full-text

A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_9 ◽

2009 ◽

pp. 147-159 ◽

Cited By ~ 1

Author(s):

Marcella Anselmo ◽

Maria Madonia

Keyword(s):

Two Dimensional

Download Full-text

On Several Proofs of the Recognizability Theorem

Algebraic Informatics - Lecture Notes in Computer Science ◽

10.1007/978-3-642-03564-7_4 ◽

2009 ◽

pp. 78-80

Author(s):

Bruno Courcelle

Download Full-text

Algebraic Informatics - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Polynomial Interpolation of the k-th Root of the Discrete Logarithm

Polynomial Operators on Classes of Regular Languages

The Graph Programming Language GP

On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes

Theories of Automatic Structures and Their Complexity

On the Complexity of the Syntax of Tree Languages

Cycle-Free Finite Automata in Partial Iterative Semirings

Canonical Reduction Systems in Symbolic Mathematics

A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages

On Several Proofs of the Recognizability Theorem

Algebraic Informatics - Lecture Notes in Computer Science
Latest Publications