Synchronized rational relations of finite and infinite words
From MaRDI portal
Publication:685453
DOI10.1016/0304-3975(93)90230-QzbMath0783.68065MaRDI QIDQ685453
Christiane Frougny, Jacques Sakarovitch
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Combinatorics on words (68R15) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)
Related Items
Automaticity of ordinals and of homogeneous graphs, Morphisms and Minimisation of Weighted Automata, On Boolean closed full trios and rational Kripke frames, Second-order finite automata: expressive power and simple proofs using automatic structures, 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}\), Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines, Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective, Multi-dimensional sets recognizable in all abstract numeration systems, Linearly bounded infinite graphs, Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations, The growth ratio of synchronous rational relations is unique, Deterministic synchronization of automata with bounded delay, Automatic presentations of structures, Multi-grain Relations, On factors of synchronized sequences, On the transition graphs of Turing machines., Unnamed Item, Two Effective Properties of ω-Rational Functions, On the continuity set of an Omega rational function, Synchronizing relations on words, The monoid of queue actions, A Hierarchy of Automaticω-Words having a Decidable MSO Theory, ALGORITHMS FOR THE JOIN AND AUTO-INTERSECTION OF MULTI-TAPE WEIGHTED FINITE-STATE MACHINES, Unnamed Item, On the representation of finite deterministic 2-tape automata, Feasible reductions to Kolmogorov-Loveland stochastic sequences, Regular languages of nested words: fixed points, automata, and synchronization, The homomorphism problem for trace monoids., The monoids of the patience sorting algorithm, EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS, Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids., Unnamed Item, Deciding word neighborhood with universal neighborhood automata, On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids, Alphabetic and synchronized tree transducers, Unnamed Item, Families of automata characterizing context-sensitive languages, Unnamed Item, Automata, Borel functions and real numbers in Pisot base, Semi-synchronous transductions, Graph Logics with Rational Relations, Highly Undecidable Problems For Infinite Computations, Transducing reversibly with finite state machines, Left and Right Synchronous Relations, Closure properties of synchronized relations, A construction on finite automata that has remained hidden, Unnamed Item, Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids, Automatic quotients of free groups., Unnamed Item, On the automaticity of singular Artin monoids of finite type, How to decide continuity of rational functions on infinite words, Uniform strategies, rational relations and jumping automata, Asynchronous sliding block maps, AUTOMATIC CONVERSION FROM FIBONACCI REPRESENTATION TO REPRESENTATION IN BASE φ, AND A GENERALIZATION, On synchronized sequences and their separators, Distances between languages and reflexivity of relations, Iterative pairs and multitape automata
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relations rationnelles infinitaires
- The equivalence problem of multitape finite automata
- Topology of finite graphs
- Rational equivalence relations
- Sur une variante des fonctions séquentielles
- Multitape one-way nonwriting automata
- Representations of numbers and finite automata
- Computability by finite automata and pisot bases
- On Relations Defined by Generalized Finite Automata
- Decision problems forω-automata
