Using acceptors as transducers
type: Item
instance of: scholarly article
title: Using acceptors as transducers
zbMATH Open document ID: 0984.68104
DOI: 10.1016/S0304-3975(00)00297-8
author: Matti Nykänen
published in: Theoretical Computer Science
publication date: 2002-03-03T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1715771
zbMATH Keywords: multi-tape automata
zbMATH Keywords: transducers
zbMATH Keywords: finiteness dependencies
MaRDI profile type: MaRDI publication profile
cites work: Q4864249
cites work: Sequences, datalog, and transducers
cites work: Q4198056
cites work: Regular sequence operations and their use in database queries
cites work: Reasoning about strings in databases
cites work: Multi-tape and multi-head pushdown automata
cites work: Q3862379
cites work: A framework for testing safety and effective computability
cites work: Q4397727
cites work: Absolutely parallel grammars and two-way finite-state transducers
cites work: Q4843187
cites work: Deriving constraints among argument sizes in logic programs
cites work: On the valuedness of finite transducers
cites work: On the lengths of values in a finite transducer
cites work: Temporal logic can be more expressive
description: scientific article; zbMATH DE number 1715771