Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

DOI10.1016/0304-3975(77)90049-4MaRDI QIDQ1246508zbMATH OpenOpenAlexFDO

Authors Christian Choffrut

Publication date 1978

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

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

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 3137403 (Why is no real title available?)
• scientific article; zbMATH DE number 3487375 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• Sur une variante des fonctions séquentielles
• The equation \(a_ M=b^ Nc^ P\) in a free group

Cited in

(43)

• Addition molle et fonctions p-locales
• Rational equivalence relations
• Linear numeration systems of order two
• Confluent linear numeration systems
• On the sequentiality of the successor function
• Deciding sequentiability of finite-state transducers by finite-state pattern-matching.
• Minimization algorithms for sequential transducers
• Visibly pushdown transducers
• Determinization of transducers over finite and infinite words.
• Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
• Max-plus automata
• Disambiguation of weighted tree automata
• Sequentiality of group-weighted tree automata
• Trimming visibly pushdown automata
• Sequential?
• Determinations of weighted finite automata over commutative idempotent MF-semirings
• Degree of sequentiality of weighted automata
• Multi-sequential word relations
• On the continuity set of an Omega rational function
• A Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-Automata
• On-line finite automata for addition in some numeration systems
• scientific article; zbMATH DE number 7003194 (Why is no real title available?)
• Multi-sequential word relations
• On the Topological Complexity of Infinitary Rational Relations
• Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
• scientific article; zbMATH DE number 7488335 (Why is no real title available?)
• Determinization of fuzzy automata via factorization of fuzzy states
• The many facets of string transducers (invited talk)
• Sequentiality of string-to-context transducers
• Radix enumeration of rational languages
• Streamability of nested word transductions
• FINITELY SUBSEQUENTIAL TRANSDUCERS
• Over Which Monoids is the Transducer Determinization Procedure Applicable?
• A pattern logic for automata with outputs
• Transducing reversibly with finite state machines
• Definability Results for Top-Down Tree Transducers
• When is a bottom-up deterministic tree translation top-down deterministic?
• Deciding conjugacy of a rational relation (extended abstract)
• An optimal pre-determinization algorithm for weighted transducers
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton
• Minimizing cost register automata over a field
• Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
• Look-ahead removal for total deterministic top-down tree transducers

This page was built for publication: Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

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