Transductions des langages de Chomsky
From MaRDI portal
Publication:1220392
DOI10.5802/AIF.287zbMath0313.68065OpenAlexW2059501879WikidataQ56916593 ScholiaQ56916593MaRDI QIDQ1220392
Publication date: 1968
Published in: Annales de l'Institut Fourier (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=AIF_1968__18_1_339_0
Related Items (only showing first 100 items - show all)
On Boolean closed full trios and rational Kripke frames ⋮ Synchronization of musical words ⋮ Rational equivalence relations ⋮ Representation of rational functions with prefix and suffix codings ⋮ Weight Assignment Logic ⋮ Representation and uniformization of algebraic transductions ⋮ A Logical Characterization of Timed Pushdown Languages ⋮ Unnamed Item ⋮ Closure property of principal cones under substitution ⋮ On the usefulness of bifaithful rational cones ⋮ Counting with rational functions ⋮ Parallel generation of infinite images ⋮ Context-free languages with rational index in $\Theta (n^\gamma )$ for algebraic numbers $\gamma $ ⋮ Familles de langages fermées par crochet ouvert ⋮ Unnamed Item ⋮ Sur les générateurs algébriques et linéaires ⋮ Unnamed Item ⋮ Unnamed Item ⋮ McCarthy-Kleene fuzzy automata and MSO logics ⋮ Cônes rationnels commutatifs ⋮ Recursivite et cônes rationnels fermés par intersection ⋮ Logics for Weighted Timed Pushdown Automata ⋮ Program schemes, recursion schemes, and formal languages ⋮ Rational bijection of rational sets ⋮ Unnamed Item ⋮ Quasi-automatic semigroups ⋮ Decomposition and factorization of chemical reaction transducers ⋮ A Nivat theorem for weighted picture automata and weighted MSO logics ⋮ The simultaneous accessibility of two configurations of two equivalent DPDA's ⋮ Synchronizing relations on words ⋮ Formes de langages et de grammaires ⋮ Unnamed Item ⋮ Substitution of semi-AFL's ⋮ Unnamed Item ⋮ Cyclic rational transductions and polynomials of rational functions ⋮ Morphismes et bimorphismes d'arbres ⋮ Sur divers produits de séries formelles ⋮ Langages satures et cônes decroissants. Langages et cônes bifideles ⋮ On a language without star ⋮ Quotient and bounded context-free languages ⋮ Unnamed Item ⋮ Clocks in dataflow languages ⋮ Evaluating Generating Functions for Periodic Multiple Polylogarithms via Rational Chen–Fliess Series ⋮ Local languages and the Berry-Sethi algorithm ⋮ Theory of reaction automata: a survey ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Topologies on formal languages ⋮ Non-prinicipalité du cylindre des langages à compteur ⋮ Two iteration theorems for some families of languages ⋮ Transductions de séries formelles ⋮ Progress in free associative algebras ⋮ Sequential? ⋮ One counter languages and the IRS condition ⋮ Bilinear system interconnections and generating series of weighted Petri nets ⋮ Familles de langages translatables et fermées par crochet ⋮ Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations ⋮ Semigroup automata with rational initial and terminal sets ⋮ Uniformly erasable AFL ⋮ Context-free grammar forms ⋮ A representation theorem of infinite dimensional algebras and applications to language theory ⋮ Epsilon-reducible context-free languages and characterizations of indexed languages ⋮ Un théorème de Chomsky-Schützenberger pour les forets algébriques ⋮ Sur une variante des fonctions séquentielles ⋮ Produit dans le cône rationnel engendre par D ⋮ Single-valued a-transducers ⋮ Document Spanners ⋮ Langages algébriques, paires iterantes et transductions rationnelles ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations ⋮ Opérations de cylindre et applications séquentielles gauches inverses ⋮ Characterizations of recognizable weighted tree languages by logic and bimorphisms ⋮ Une note sur le cylindre des langages déterministes ⋮ A new proof of two theorems about rational transductions ⋮ Une propriété de Hankel des rélations fonctionnelles entre monoides libres ⋮ Générateurs algébriques et systèmes de paires iterantes ⋮ DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA ⋮ Syntactic operators on full semiAFLs ⋮ Weighted operator precedence languages ⋮ Une généralisation des ensembles de Dyck ⋮ Deux applications de la représentation matricielle d'une série rationnelle non commutative. (Two applications of matrix representations of a rational non -commutative series) ⋮ Lattices of local two-dimensional languages ⋮ Fixed point languages of rational transductions ⋮ Groups whose word problems are not semilinear ⋮ Enumeration des graphes planaires à l'aide des séries formelles en variables non commutatives ⋮ Finite transducers and rational transductions ⋮ Weighted automata ⋮ Sur la rationalite de certaines séries generatrices ⋮ Families of locally testable languages ⋮ Quasi-automatic groups are asynchronously automatic ⋮ Sur une propriété d'itération des langages algébriques déterministes ⋮ Closure properties of selective substitution grammars part I ⋮ Unnamed Item ⋮ Langages à un compteur ⋮ Theory of formal grammars ⋮ Relations rationnelles infinitaires ⋮ Iterating transducers ⋮ Recognizable tree-languages and nonlinear morphisms ⋮ Modelization of deterministic rational relations ⋮ Iterated relabeling tree transducers ⋮ A short scientific biography of Maurice Nivat ⋮ MIX is a 2-MCFL and the word problem in \(\mathbb{Z}^2\) is captured by the IO and the OI hierarchies
Uses Software
Cites Work
- Report on the algorithmic language Algol 60
- On the definition of a family of automata
- On a Theorem of R. Jungen
- On Relations Defined by Generalized Finite Automata
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- Bounded Algol-Like Languages
- Deterministic context free languages
- Sur certains sous-monoïdes libres
- A representation theorem for algebraic and context-free power series in noncommuting variables
- On the translation of languages from left to right
- A remark on finite transducers
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Transductions des langages de Chomsky
