Algebraic Informatics Third International Conference, CAI 2009, Thessaloniki, Greece, May 19-22, 2009, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Bozapalidis, Symeon (Επιμελητής έκδοσης), Rahonis, George (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2009.
Σειρά:Lecture Notes in Computer Science, 5725
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03553nam a22006135i 4500
001 978-3-642-03564-7
003 DE-He213
005 20151204181359.0
007 cr nn 008mamaa
008 100301s2009 gw | s |||| 0|eng d
020 |a 9783642035647  |9 978-3-642-03564-7 
024 7 |a 10.1007/978-3-642-03564-7  |2 doi 
040 |d GrThAP 
050 4 |a QA76.9.L63 
050 4 |a QA76.5913 
050 4 |a QA76.63 
072 7 |a UM  |2 bicssc 
072 7 |a UYF  |2 bicssc 
072 7 |a COM051000  |2 bisacsh 
072 7 |a COM036000  |2 bisacsh 
082 0 4 |a 005.1015113  |2 23 
245 1 0 |a Algebraic Informatics  |h [electronic resource] :  |b Third International Conference, CAI 2009, Thessaloniki, Greece, May 19-22, 2009, Proceedings /  |c edited by Symeon Bozapalidis, George Rahonis. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2009. 
300 |a X, 361 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5725 
505 0 |a Invited Paper of Werner Kuich -- Cycle-Free Finite Automata in Partial Iterative Semirings -- Tutorials -- Picture Languages: From Wang Tiles to 2D Grammars -- Process Algebra: An Algebraic Theory of Concurrency -- Invited Papers -- On Several Proofs of the Recognizability Theorem -- Theories of Automatic Structures and Their Complexity -- The Graph Programming Language GP -- Canonical Reduction Systems in Symbolic Mathematics -- Contributed Papers -- Solving Norm Form Equations over Number Fields -- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages -- Context-Free Categorical Grammars -- An Eilenberg Theorem for Pictures -- On the Complexity of the Syntax of Tree Languages -- On the Reversibility of Parallel Insertion, and Its Relation to Comma Codes -- Computation of Pell Numbers of the Form pX 2 -- Iteration Grove Theories with Applications -- Combinatorics of Finite Words and Suffix Automata -- Polynomial Operators on Classes of Regular Languages -- Self-dual Codes over Small Prime Fields from Combinatorial Designs -- A Backward and a Forward Simulation for Weighted Tree Automata -- Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited -- Polynomial Interpolation of the k-th Root of the Discrete Logarithm -- Single-Path Restarting Tree Automata -- Parallel Communicating Grammar Systems with Regular Control. 
650 0 |a Computer science. 
650 0 |a Computer programming. 
650 0 |a Software engineering. 
650 0 |a Computers. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 0 |a Computer science  |x Mathematics. 
650 1 4 |a Computer Science. 
650 2 4 |a Logics and Meanings of Programs. 
650 2 4 |a Programming Techniques. 
650 2 4 |a Theory of Computation. 
650 2 4 |a Mathematical Logic and Formal Languages. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Software Engineering. 
700 1 |a Bozapalidis, Symeon.  |e editor. 
700 1 |a Rahonis, George.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783642035630 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 5725 
856 4 0 |u http://dx.doi.org/10.1007/978-3-642-03564-7  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)