Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
DLT
2010
11 years 10 months ago
Minimization of Deterministic Bottom-Up Tree Transducers
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
Sylvia Friese, Helmut Seidl, Sebastian Maneth
DLT
2010
11 years 11 months ago
Computing Blocker Sets for the Regular Post Embedding Problem
Abstract. Blocker and coblocker sets are regular languages involved in the algorithmic solution of the Regular Post Embedding Problem. We investigate the computability of these lan...
Pierre Chambart, Philippe Schnoebelen
DLT
2010
11 years 11 months ago
Algorithmic Properties of Millstream Systems
Abstract. Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules r...
Suna Bensch, Henrik Björklund, Frank Drewes
DLT
2010
11 years 11 months ago
Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
Abstract. It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in...
Niko Haubold, Markus Lohrey, Christian Mathissen
DLT
2010
11 years 11 months ago
Input Products for Weighted Extended Top-Down Tree Transducers
A weighted tree transformation is a function (:
Andreas Maletti
DLT
2010
11 years 11 months ago
On a Powerful Class of Non-universal P Systems with Active Membranes
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
Antonio E. Porreca, Alberto Leporati, Claudio Zand...
DLT
2010
11 years 11 months ago
Fast Parsing for Boolean Grammars: A Generalization of Valiant's Algorithm
Abstract. The well-known parsing algorithm for the context-free grammars due to Valiant ("General context-free recognition in less than cubic time", Journal of Computer a...
Alexander Okhotin
DLT
2010
11 years 11 months ago
Inclusion Problems for Patterns with a Bounded Number of Variables
We study the inclusion problems for pattern languages that are generated by patterns with a bounded number of variables. This continues the work by Freydenberger and Reidenbach (In...
Joachim Bremer, Dominik D. Freydenberger
books