On the representation of finite deterministic 2-tape automata
type: Item
instance of: scholarly article
title: On the representation of finite deterministic 2-tape automata
zbMATH Open document ID: 0930.68075
DOI: 10.1016/S0304-3975(98)00179-0
author: Maryse Pelletier
author: Jacques Sakarovitch
published in: Theoretical Computer Science
publication date: 2000-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1387542
zbMATH Keywords: deterministic \(k\)-tape automata
zbMATH Keywords: deterministic rational relations
zbMATH Keywords: uniformization theorem
MaRDI profile type: Publication
cites work: Q3859267
cites work: Q5525343
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: Q4003861
cites work: Multitape one-way nonwriting automata
cites work: Synchronized rational relations of finite and infinite words
cites work: The equivalence problem of multitape finite automata
cites work: Q3687745
cites work: Rational equivalence relations
cites work: Q4385527
cites work: Q5541339
cites work: Q3657457
cites work: Q3777490
cites work: A construction on finite automata that has remained hidden
cites work: Q5626549
cites work: Q4101446
cites work: Sur les rélations rationnelles entre monoides libres
cites work: Sur une variante des fonctions séquentielles
cites work: Topology of finite graphs
full work available at URL: s0304-3975(98)00179-0
OpenAlex ID: W2070213299
description: scientific article; zbMATH DE number 1387542