Using acceptors as transducers

Authors:
Matti Nykänen
Affiliations:
Univ. of Helsinki, Helsinki, Finland
Venue:
Theoretical Computer Science
Year:
2001

Citing 20
Cited 2

A database language for sets, lists and tables

Information Systems
Safety of recursive Horn clauses with infinite relations

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the valuedness of finite transducers

Acta Informatica
On the lengths of values in a finite transducer

Acta Informatica
Reasoning about strings in databases

PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Artificial intelligence: a modern approach

Artificial intelligence: a modern approach
A framework for testing safety and effective computability

Journal of Computer and System Sciences
Foundation for object/relational databases: the third manifesto

Foundation for object/relational databases: the third manifesto
Regular sequence operations and their use in database queries

Journal of Computer and System Sciences
Sequences, datalog, transducers

Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Reasoning about strings in databases

Journal of Computer and System Sciences
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The AQUA Approach to Querying Lists and Trees in Object-Oriented Databases

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
SEQ: A Model for Sequence Databases

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
VISUAL: A Graphical Icon-Based Query Language

ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Supporting Lists in a Data Model (A Timely Approach)

VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Finding paths with the right cost

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Safety, translation and evaluation of alignment calculus

ADBIS'97 Proceedings of the First East-European conference on Advances in Databases and Information systems

The exact path length problem

Journal of Algorithms
Design and implementation of a string database query language

Information Systems - Special issue: Data management in bioinformatics

Quantified Score

Hi-index	5.23

Visualization

Abstract

We wish to use a given nondeterministic two-way multi-tape acceptor as a transducer by supplying the contents for only some of its input tapes, and asking it to generate the missing contents for the other tapes. We provide here an algorithm for assuring beforehand that this transduction always results in a finite set of answers. We also develop an algorithm for evaluating these answers whenever the previous algorithm indicated their finiteness. Furthermore, our algorithms can be used for speeding up the simulation of these acceptors even when not used as transducers. Copyright 2001 Elsevier Science B.V.