scientific article

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

decidability Closure properties formal languages rational series rational languages syntactic algebras recognizable series

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items

Convolution as a Unifying Concept, Rational languages and the Burnside problem, Language equations over a one-letter alphabet with union, concatenation and star: A complete solution, Vers une notion de dérivation fonctionnelle causale. (Towards a notion of causal functional derivatives), A simple proof of the Skolem-Mahler-Lech theorem, Synchronization and decomposability for a family of codes. II, A bijective proof of a Touchard-Riordan formula, Uniform random generation of words of rational languages, The Dyck language $D_ 1^{'*}$ is not generated by any matrix grammar of finite index, Traces of algebraic integers and dynamical systems, Noncommutative convexity arises from linear matrix inequalities, Rational and Recognisable Power Series, Counting with rational functions, Rational probability measures, Une remarque sur les systèmes complets d'identités rationnelles, Convolution and concurrency, Formal power series, operator calculus, and duality on Lie algebras, Eigenvalues of non-Hermitian random matrices and Brown measure of non-normal operators: Hermitian reduction and linearization method, A Program Construction and Verification Tool for Separation Logic, Applications of realizations (aka linearizations) to free probability, The formal Laplace--Borel transform of Fliess operators and the composition product, Separators in infinite words generated by morphisms., Unnamed Item, On factors of synchronized sequences, The net automaton of a rational expression, Linear recurrence sequences: general term and indempotents, When is the orbit algebra of a group an integral domain ? Proof of a conjecture of P.J. Cameron, Partial-realization theory for linear switched systems -- a formal power series approach, An algebraic characterization of semirings for which the support of every recognizable series is recognizable, Management and analysis of DNA microarray data by using weighted trees, Bisections reconnaissables, Automatic average-case analysis of algorithms, Complete systems of $\mathcal B$-rational identities, On the partially commutative shuffle product, Generalized cancellation-and-permutation properties, regular languages and supports of rational series, Representations and complete semiring morphisms, The algebraic equivalent of AFL theory, Malcev-Neumann series on the free group and rationality questions, Models of a $K$-rational identity system, On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series, Sequential?, Derivatives of rational expressions with multiplicity, New types of automata to solve fixed point problems, Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series, Analytic analysis of algorithms, Endomorphisms of algebras of sequences, Constructions effectives sur les séries formelles d'arbres. (Effective constructions on formal tree series), Combinatorial resolution of systems of differential equations. III: A special class of differentially algebraic series, The zig-zag power series: A two-way version of the ${}^*$ operator., The closure under division and a characterization of the recognizable $\mathcal {Z}$-subsets, Computation, on Macsyma, of the minimal differential representation of noncommutative polynomials, Unnamed Item, Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring, Outils et résultats pour les transducteurs boustrophédons, Context-free series on trees, A partial result about the factorization conjecture for finite variable- length codes, Lyndon words and shuffle algebras for generating the coloured multiple zeta values relations tables, Some properties of recognizable $\mathcal Z$-subsets