Zoltán Fülöp – författare
Visar alla böcker från författaren . Handla med fri frakt och snabb leverans.
3 produkter
3 produkter
Häftad, Engelska, 2003
543 kr
Skickas inom 10-15 vardagar
This book constitutes the refereed proceedings of the 7th International Conference on Developments in Language Theory, DLT 2003, held in Szeged, Hungary, in July 2003.The 27 revised full papers presented together with 7 invited papers were carefully reviewed and selected from 57 submissions. All current aspects in language theory are addressed, in particular grammars, acceptors, and transducers for strings, trees, graphs, arrays, etc; algebraic theories for automata and languages; combinatorial properties of words and languages; formal power series; decision problems; efficient algorithms for automata and languages; and relations to complexity theory and logic, picture description and analysis, DNA computing, quantum computing, cryptography, and concurrency.
Häftad, Engelska, 1995
1 079 kr
Skickas inom 10-15 vardagar
This volume constitutes the proceedings of the 22nd Interna- tional Colloquium on Automata, Languages, and Programming, held under the sponsorship of EATCS in Szeged, Hungary in July 1995.The volume presents four invited papers and 53 full revised research papers selected from a total of 111 submissions. ICALP traditionally covers the whole area of theoretical computer science; among the topics addressed in the volume are concurrency, automata, formal languages, algorithms, communication protocols, computational complexity, computability, foundations of programming, learning and coding, and semantics.
Häftad, Engelska, 2011
1 079 kr
Skickas inom 10-15 vardagar
The subject of this book is the investigation of tree transducers. Tree trans ducers were introduced in theoretical computer science in order to study the general properties of formal models which give semantics to context-free languages in a syntax-directed way. Such formal models include attribute grammars with synthesized attributes only, denotational semantics, and at tribute grammars (with synthesized and inherited attributes). However, these formal models share certain constituents which are irrelevant in the investi gation of the general properties considered in this book. In particular, we can abstract (a) from derivation trees of the context-free grammar and take trees over some ranked alphabet, (b) from the semantic domain of the model and use the initial term algebra instead, and finally (c) from the machine oriented computation paradigm, which maintains the incarnation information of recursive function calls, and take a term rewriting semantics instead. Ap plying these three abstraction steps to attribute grammars with synthesized attributes only, to denotational semantics, and to attribute grammars we obtain the concepts of top-down tree transducer, macro tree transducer, and attributed tree transducer, respectively. The macro attributed tree transducer combines the concepts of the macro tree transducer and the attributed tree transducer. This book explores the general properties of these four types of tree transducers.