On Relations Defined by Generalized Finite Automata

Cited in

(only showing first 100 items - show all)

Semi-synchronous transductions
Small overlap monoids. II: Automatic structures and normal forms.
Rational equivalence relations
Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
Easy multiplications. I: The realm of Kleene's theorem
A unified framework for disambiguating finite transductions
Deterministic synchronization of automata with bounded delay
Independance forte de certaines opérations
In memoriam Calvin C. Elgot
Formes de langages et de grammaires
An automaton generating series of graphs
Langages satures et cônes decroissants. Langages et cônes bifideles
Clocks in dataflow languages
Confluent linear numeration systems
Two iteration theorems for some families of languages
Transductions de séries formelles
One counter languages and the IRS condition
Familles de langages translatables et fermées par crochet
Transductions des langages de Chomsky
The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper
Sur les rélations rationnelles entre monoides libres
Analyse und Synthese von asynchronen ND-Automaten
Sur une variante des fonctions séquentielles
One way finite visit automata
Opérations de cylindre et applications séquentielles gauches inverses
A new proof of two theorems about rational transductions
Une propriété de Hankel des rélations fonctionnelles entre monoides libres
Overlap-free words and finite automata
A construction on finite automata that has remained hidden
Representation of rational functions with prefix and suffix codings
Some decisional problems on rational relations
On the transition graphs of Turing machines.
Minimization algorithms for sequential transducers
Modelization of deterministic rational relations
Distances between languages and reflexivity of relations
Visibly pushdown transducers
On the descriptional complexity of stateless deterministic ordered restarting automata
Families of automata characterizing context-sensitive languages
Equidivisible Kleene monoids and the Elgot-Mezei theorem
Iterating transducers
Lexicographic decomposition of \(k\)-valued transducers
On the representation of finite deterministic 2-tape automata
Automata and rational expressions
Finite transducers and rational transductions
Variable-length codes independent or closed with respect to edit relations
Theoretical and implementational aspects of the formal language server (LaSer)
Lamplighter groups and automata
The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
Uniform strategies, rational relations and jumping automata
Robustness of synchronous communication protocols with delay for decentralized discrete-event control
Quasi-automatic semigroups
Maximin sequential chains
Sets recognized by n-tape automata
Multitape finite automata with rewind instructions
Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives
On the decidability of the valuedness problem for two-way finite transducers
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
Document spanners: a formal approach to information extraction
Rational selecting relations and selectors
Both ways rational functions
The synchronized graphs trace the context-sensitive languages
Visibly pushdown transducers with look-ahead
Two-dimensional rational automata: a bridge unifying one- and two-dimensional language theory
On synchronized sequences and their separators
Decision problems among the main subfamilies of rational relations
Multi-sequential word relations
Deterministic ordered restarting automata that compute functions
Multi-grain Relations
ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES
Left and Right Synchronous Relations
Complete symmetry in d2l systems and cellular automata
scientific article; zbMATH DE number 3658049 (Why is no real title available?)
scientific article; zbMATH DE number 3677223 (Why is no real title available?)
scientific article; zbMATH DE number 3688749 (Why is no real title available?)
Pure grammars and pure languages†
scientific article; zbMATH DE number 3714977 (Why is no real title available?)
On factors of synchronized sequences
Comparing language operations
scientific article; zbMATH DE number 3602690 (Why is no real title available?)
Iteration of rational transductions
Asynchronous sliding block maps
AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
Closure under union and composition of iterated rational transductions
Multi-sequential word relations
scientific article; zbMATH DE number 3797185 (Why is no real title available?)
Learning two-tape automata from queries and counterexamples
Channel synthesis for finite transducers
A canonical automaton for one-rule length-preserving string rewrite systems
Resynchronizing classes of word relations
Semantic Foundations for Deterministic Dataflow and Stream Processing
Rational and Recognisable Power Series
scientific article; zbMATH DE number 7559409 (Why is no real title available?)
The many facets of string transducers (invited talk)
Closure properties of synchronized relations
On canonical models for rational functions over infinite words
Monadic decomposability of regular relations
On Synthesis of Resynchronizers for Transducers
Abelian Invertible Automata
Querying best paths in graph databases
Modular path queries with arithmetic

This page was built for publication: On Relations Defined by Generalized Finite Automata

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