Sur une variante des fonctions séquentielles

DOI10.1016/0304-3975(77)90055-XMaRDI QIDQ1241982zbMATH OpenFDO

Authors Marcel Paul Schützenberger

Publication date 1977

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(77)90055-X

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3167394 (Why is no real title available?)
• scientific article; zbMATH DE number 3248552 (Why is no real title available?)
• scientific article; zbMATH DE number 3310089 (Why is no real title available?)
• A Characterization of Machine Mappings
• On Relations Defined by Generalized Finite Automata
• Transductions des langages de Chomsky

Cited in

(31)

• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
• Coalgebraising subsequential transducers
• FINITELY SUBSEQUENTIAL TRANSDUCERS
• Bounded repairability of word languages
• Synchronized rational relations of finite and infinite words
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Algorithms for probabilistic and stochastic subsequential failure transducers
• A unified framework for disambiguating finite transductions
• Counting with rational functions
• On the powers of the Collatz function
• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Variances and covariances in the central limit theorem for the output of a transducer
• scientific article; zbMATH DE number 3714977 (Why is no real title available?)
• A construction on finite automata that has remained hidden
• Output sum of transducers: limiting distribution and periodic fluctuation
• Reducing Acyclic Cover Transducers
• Minimization algorithms for sequential transducers
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Substructural proofs as automata
• Semantic Foundations for Deterministic Dataflow and Stream Processing
• Subsequential transducers: a coalgebraic perspective
• On the representation of finite deterministic 2-tape automata
• Deterministic synchronization of automata with bounded delay
• Edit distance of finite state transducers
• A closure property of deterministic context-free languages
• Determinization of transducers over finite and infinite words.
• Minimizing subsequential transducers: a survey.
• Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• Sequential?
• Addition molle et fonctions p-locales

This page was built for publication: Sur une variante des fonctions séquentielles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1241982)