Sur une variante des fonctions séquentielles

DOI10.1016/0304-3975(77)90055-XzbMATH Open0366.68043MaRDI QIDQ1241982FDOQ1241982

Authors: Marcel Paul Schützenberger 

Publication date: 1977

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On Relations Defined by Generalized Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transductions des langages de Chomsky
• A Characterization of Machine Mappings

Cited In (29)

• 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
• EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
• Bounded repairability of word languages
• Algorithms for probabilistic and stochastic subsequential failure transducers
• Synchronized rational relations of finite and infinite words
• A unified framework for disambiguating finite transductions
• Counting with rational functions
• 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
• Title not available (Why is that?)
• 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.
• 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
• Substructural Proofs as Automata
• 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
• Sequential?
• Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
• 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)