Synchronized rational relations of finite and infinite words
From MaRDI portal
Publication:685453
DOI10.1016/0304-3975(93)90230-QzbMATH Open0783.68065MaRDI QIDQ685453FDOQ685453
Authors: Christiane Frougny, Jacques Sakarovitch 
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Combinatorics on words (68R15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Relations Defined by Generalized Finite Automata
- Topology of finite graphs
- Title not available (Why is that?)
- Sur une variante des fonctions séquentielles
- Decision problems forω-automata
- The equivalence problem of multitape finite automata
- Representations of numbers and finite automata
- Computability by finite automata and pisot bases
- Title not available (Why is that?)
- Rational equivalence relations
- Multitape one-way nonwriting automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Relations rationnelles infinitaires
Cited In (65)
- On the automaticity of singular Artin monoids of finite type.
- The Growth Ratio of Synchronous Rational Relations Is Unique
- Multi-grain Relations
- Closure properties of synchronized relations
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- Uniform strategies, rational relations and jumping automata
- Deciding word neighborhood with universal neighborhood automata
- Second-order finite automata: expressive power and simple proofs using automatic structures
- Automatic presentations of structures
- On factors of synchronized sequences
- The growth ratio of synchronous rational relations is unique
- EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS
- The monoid of queue actions
- Highly Undecidable Problems For Infinite Computations
- The monoids of the patience sorting algorithm
- AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION
- Linearly bounded infinite graphs
- Querying best paths in graph databases
- A construction on finite automata that has remained hidden
- A Büchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
- Distances between languages and reflexivity of relations
- On the transition graphs of Turing machines.
- Rewriting systems and biautomatic structures for Chinese, hypoplactic, and Sylvester monoids.
- Semi-synchronous transductions
- Automaticity of ordinals and of homogeneous graphs
- On the continuity set of an Omega rational function
- On Boolean closed full trios and rational Kripke frames
- Families of automata characterizing context-sensitive languages
- ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES
- Automatic quotients of free groups.
- Graph logics with rational relations: the role of word combinatorics
- Asynchronous sliding block maps
- Iterative pairs and multitape automata
- On the representation of finite deterministic 2-tape automata
- Synchronizing relations on words
- Synchronizing relations on words
- Regular languages of nested words: fixed points, automata, and synchronization
- Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines
- Deterministic synchronization of automata with bounded delay
- Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
- The synchronized graphs trace the context-sensitive languages
- On synchronized sequences and their separators
- Left and Right Synchronous Relations
- The homomorphism problem for trace monoids.
- Alphabetic and synchronized tree transducers
- Multi-dimensional sets recognizable in all abstract numeration systems
- Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective
- Bounded synchronization delay in omega-rational expressions
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- Feasible reductions to Kolmogorov-Loveland stochastic sequences
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- Omega-rational expressions with bounded synchronization delay
- Title not available (Why is that?)
- Title not available (Why is that?)
- How to decide continuity of rational functions on infinite words
- On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids
- Morphisms and Minimisation of Weighted Automata
- Resynchronized uniformization and definability problems for rational relations
- Two Effective Properties of ω-Rational Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automata, Borel functions and real numbers in Pisot base
- Transducing reversibly with finite state machines
- Resynchronizing classes of word relations
- Title not available (Why is that?)
This page was built for publication: Synchronized rational relations of finite and infinite words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685453)
