Datenquellen im TIB-Portal   Hilfe zur Suche

Unser Tipp: Melden Sie sich an, um alle Funktionen im TIB-Portal optimal nutzen zu können!

Monadic Datalog Tree Transducers (Englisch)

Wie erhalte ich diesen Titel?

Zugriff prüfen
Download
Kommerziell Vergütung an den Verlag: 24,95 € Grundgebühr: 4,00 € Gesamtpreis: 28,95 €
Akademisch Vergütung an den Verlag: 12,50 € Grundgebühr: 2,00 € Gesamtpreis: 14,50 €

Abstract

We introduce a tree transducer model combining aspects of both attributed tree transducers and monadic datalog, thereby allowing to specify in one rule information transport for non-adjacent nodes. We show that our model is strictly more powerful than attributed tree transducers, and we identify a large syntactic subclass which is as powerful as attributed tree transducers. This is shown by an effective construction.

Inhaltsverzeichnis E-Book

Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.

Picture Languages Generated by Assembling Tiles
Bonizzoni, Paola / Ferretti, Claudio / Roslin Sagaya Mary, Anthonath / Mauri, Giancarlo | 2009
A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions
Masopust, Tomáš | 2009
A Cryptosystem Based on the Composition of Reversible Cellular Automata
Clarridge, Adam / Salomaa, Kai | 2009
Automata on Gauss Words
Lisitsa, Alexei / Potapov, Igor / Saleh, Rafiq | 2009
Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
Akama, Yohji | 2009
Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization
Boigelot, Bernard / Degbomont, Jean-François | 2009
Larger Lower Bounds on the OBDD Complexity of Integer Multiplication
Bollig, Beate | 2009
Grammars Controlled by Special Petri Nets
Dassow, Jürgen / Turaev, Sherzod | 2009
Multi-tilde Operators and Their Glushkov Automata
Caron, Pascal / Champarnaud, Jean-Marc / Mignot, Ludovic | 2009
Minimal Union-Free Decompositions of Regular Languages
Afonin, Sergey / Golomazov, Denis | 2009
Monadic Second-Order Logic for Graphs: Algorithmic and Language Theoretical Applications
Courcelle, Bruno | 2009
Termination of Priority Rewriting
Gnaedig, Isabelle | 2009
Constructing Infinite Words of Intermediate Arithmetical Complexity
Salimov, Paul V. | 2009
One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit
Verwer, Sicco / Weerdt, Mathijs / Witteveen, Cees | 2009
How Many Holes Can an Unbordered Partial Word Contain?
Blanchet-Sadri, Francine / Allen, Emily / Byrum, Cameron / Mercaş, Robert | 2009
A Kleene Theorem for Forest Languages
Straßburger, Lutz | 2009
From Gene Trees to Species Trees through a Supertree Approach
Scornavacca, Celine / Berry, Vincent / Ranwez, Vincent | 2009
Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata
Limaye, Nutan / Mahajan, Meena | 2009
Rigid Tree Automata
Jacquemard, Florent / Klay, Francis / Vacher, Camille | 2009
Efficiency of the Symmetry Bias in Grammar Acquisition
Matoba, Ryuichi / Nakamura, Makoto / Tojo, Satoshi | 2009
Nested Counters in Bit-Parallel String Matching
Fredriksson, Kimmo / Grabowski, Szymon | 2009
Genetic Algorithm for Synchronization
Roman, Adam | 2009
Prediction of Creole Emergence in Spatial Language Dynamics
Nakamura, Makoto / Hashimoto, Takashi / Tojo, Satoshi | 2009
Non-uniform Cellular Automata
Cattaneo, Gianpiero / Dennunzio, Alberto / Formenti, Enrico / Provillard, Julien | 2009
Recent Developments in Algorithmic Teaching
Balbach, Frank J. / Zeugmann, Thomas | 2009
On a Family of Morphic Images of Arnoux-Rauzy Words
Bucci, Michelangelo / Luca, Alessandro | 2009
New Morphic Characterizations of Languages in Chomsky Hierarchy Using Insertion and Locality
Onodera, Kaoru | 2009
On Extended Regular Expressions
Carle, Benjamin / Narendran, Paliath | 2009
State Complexity of Combined Operations for Prefix-Free Regular Languages
Han, Yo-Sub / Salomaa, Kai / Yu, Sheng | 2009
A Language-Based Comparison of Extensions of Petri Nets with and without Whole-Place Operations
Abdulla, Parosh Aziz / Delzanno, Giorgio / Begin, Laurent | 2009
Refinement and Consistency of Timed Modal Specifications
Bertrand, Nathalie / Pinchinat, Sophie / Raclet, Jean-Baptiste | 2009
Bounded Hairpin Completion
Ito, Masami / Leupold, Peter / Mitrana, Victor | 2009
Non-solvable Groups Are Not in FO+MOD+MÂJ2[REG]
Behle, Christoph / Krebs, Andreas / Reifferscheid, Stephanie | 2009
Self-overlapping Occurrences and Knuth-Morris-Pratt Algorithm for Weighted Matching
Liefooghe, Aude / Touzet, Hélène / Varré, Jean-Stéphane | 2009
On Parallel Communicating Grammar Systems and Correctness Preserving Restarting Automata
Pardubská, Dana / Plátek, Martin / Otto, Friedrich | 2009
Learning by Erasing in Dynamic Epistemic Logic
Gierasimczuk, Nina | 2009
Undecidability of Operation Problems for T0L Languages and Subclasses
Bordihn, Henning / Holzer, Markus / Kutrib, Martin | 2009
Finitely Generated Synchronizing Automata
Pribavkina, Elena V. / Rodaro, Emanuele | 2009
Descriptional and Computational Complexity of Finite Automata
Holzer, Markus / Kutrib, Martin | 2009
Absolute Convergence of Rational Series Is Semi-decidable
Bailly, Raphaël / Denis, François | 2009
An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms
Blanchet-Sadri, Francine / Mercaş, Robert / Rashin, Abraham / Willett, Elara | 2009
Towards a Taxonomy for ECFG and RRPG Parsing
Hemerik, Kees | 2009
Matching Trace Patterns with Regular Policies
Baader, Franz / Bauer, Andreas / Tiu, Alwen | 2009
Counting Parameterized Border Arrays for a Binary Alphabet
I, Tomohiro / Inenaga, Shunsuke / Bannai, Hideo / Takeda, Masayuki | 2009
State Complexity of Nested Word Automata
Salomaa, Kai | 2009
Converting Self-verifying Automata into Deterministic Automata
Jirásková, Galina / Pighizzini, Giovanni | 2009
Segmentation Charts for Czech – Relations among Segments in Complex Sentences
Lopatková, Markéta / Holan, Tomáš | 2009
On the Average Size of Glushkov’s Automata
Nicaud, Cyril | 2009
Nondeterministic Instance Complexity and Proof Systems with Advice
Beyersdorff, Olaf / Köbler, Johannes / Müller, Sebastian | 2009
Two Equivalent Regularizations for Tree Adjoining Grammars
Kasprzik, Anna | 2009
Hypothesis Spaces for Learning
Jain, Sanjay | 2009
The Halting Problem and Undecidability of Document Generation under Access Control for Tree Updates
Moore, Neil | 2009
The Fault Tolerance of NP-Hard Problems
Glaßer, Christian / Pavan, A. / Travers, Stephen | 2009
Bounded Delay and Concurrency for Earliest Query Answering
Gauwin, Olivier / Niehren, Joachim / Tison, Sophie | 2009
Analysing Complexity in Classes of Unary Automatic Structures
Liu, Jiamou / Minnes, Mia | 2009
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
Suman, P. Vijay / Pandya, Paritosh K. | 2009
A Series of Run-Rich Strings
Matsubara, Wataru / Kusano, Kazuhiko / Bannai, Hideo / Shinohara, Ayumi | 2009
Reoptimization of Traveling Salesperson Problems: Changing Single Edge-Weights
Berg, Tobias / Hempel, Harald | 2009
Decision Problems for Convex Languages
Brzozowski, Janusz / Shallit, Jeffrey / Xu, Zhi | 2009
An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
Llull-Chavarría, Jordi / Valero, Oscar | 2009
On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes
Mitrana, Victor / Truthe, Bianca | 2009
Tiling the Plane with a Fixed Number of Polyominoes
Ollinger, Nicolas | 2009
Monadic Datalog Tree Transducers
Büchse, Matthias / Stüber, Torsten | 2009

Wie erhalte ich diesen Titel?

Zugriff prüfen
Download
Kommerziell Vergütung an den Verlag: 24,95 € Grundgebühr: 4,00 € Gesamtpreis: 28,95 €
Akademisch Vergütung an den Verlag: 12,50 € Grundgebühr: 2,00 € Gesamtpreis: 14,50 €
Feedback