A construction on finite automata that has remained hidden
type: Item
instance of: scholarly article
title: A construction on finite automata that has remained hidden
zbMATH Open document ID: 0913.68137
DOI: 10.1016/S0304-3975(98)00040-1
author: Jacques Sakarovitch
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1238872
zbMATH Keywords: finite automata
zbMATH Keywords: finite transducers
zbMATH Keywords: rational relations
zbMATH Keywords: unambiguous functions
zbMATH Keywords: cross-section theorem
MaRDI profile type: Publication
cites work: A new proof of two theorems about rational transductions
cites work: Q3859267
cites work: Q4079524
cites work: On Relations Defined by Generalized Finite Automata
cites work: Fibonacci representations and finite automata
cites work: Synchronized rational relations of finite and infinite words
cites work: Q5576254
cites work: Q5592246
cites work: Classification of formal languages by functional binary transductions
cites work: Q4385527
cites work: A remark on finite transducers
cites work: Q5626549
cites work: On a Theorem of R. Jungen
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
Recommended article: Q3776624
Recommended article: Q4408998
Recommended article: Q2942967
Recommended article: Constructions for alternating finite automata∗
Recommended article: Q5014938
Recommended article: Q4518891
Recommended article: Q4708609
Recommended article: Q4221358
Recommended article: On finite automata with limited nondeterminism (extended abstract)
Recommended article: Q5422560
description: scientific article; zbMATH DE number 1238872