scientific article

From MaRDI portal
Publication:3994777

zbMath0668.68005MaRDI QIDQ3994777

Jean Berstel, Christophe Reutenauer

Publication date: 17 September 1992


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



Related Items (only showing first 100 items - show all)

Crisp-determinization of weighted tree automata over strong bimonoidsHolonomic functions and their relation to linearly constrained languagesOn Sequences Defined by D0L Power SeriesZeta Functions of Formal LanguagesGlushkov Construction For Series: The Non Commutative CaseUnnamed ItemMatrix versions of aperiodic $K$-rational identitiesNewton series, coinductively: a comparative study of compositionWeighted Automata and Weighted LogicsEnumerative sequences of leaves in rational treesOn recognizable and rational formal power series in partially commuting variablesOn the factorization conjectureOn computational power of weighted finite automataCharacterizing regular languages with polynomial densitiesThe Realization Problem for some wild monoids and the Atiyah ProblemSISO Output Affine Feedback Transformation Group and Its Faà di Bruno Hopf AlgebraRational transductions and complexity of counting problemsAmbiguity Hierarchies for Weighted Tree AutomataDecidability Boundaries for the Finite-Image Property of Weighted Finite AutomataAbelian combinatorics on words: a surveyFormal power series approach to nonlinear systems with additive static feedbackThe net automaton of a rational expressionA new algorithm for compression of partially commutative alphabetsWeights of formal languages based on geometric series with an application to automatic gradingEquivalence, Unambiguity, and Sequentiality of Finitely Ambiguous Max-Plus Tree AutomataA Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded LatticesWeighted Linear Dynamic LogicTowards a theory of domains for harmonic functions and its symbolic counterpartLocal limit laws for symbol statistics in bicomponent rational modelsEnhanced coalgebraic bisimulationAn iteration property of Lindenmayerian power seriesRecognizability in residuated latticesD0L sequence equivalence is inPfor fixed alphabetsComputing the Expected Edit Distance from a String to a Probabilistic Finite-State AutomatonOn Generalizations of Weighted Finite Automata and Graphics ApplicationsNonassociativity à la KleeneMathematical Renormalization in Quantum Electrodynamics via Noncommutative Generating SeriesUnnamed ItemA Burnside Approach to the Termination of Mohri's Algorithm for Polynomially Ambiguous Min-Plus-AutomataIteration SemiringsThe Synchronization Problem for Strongly Transitive AutomataAlgebraic aspects of B-regular seriesValuations and unambiguity of languages, with applications to fractal geometryOn continuous functions computed by finite automataBijective sequential mappings of a free monoid onto anotherElements of Stream CalculusA technology for reverse-engineering a combinatorial problem from a rational generating functionOn positive matricesDefinability of Combinatorial Functions and Their Linear Recurrence RelationsCobham’s theorem and its extensionsUnnamed ItemUnnamed ItemOn infinite words generated by polynomial D0L systemsAnalogies and differences between quantum and stochastic automataAsymptotic behavior in a heap model with two piecesDirect and dual laws for automata with multiplicitiesTrace monoids with idempotent generators and measure-only quantum automataThe equality problem for rational series with multiplicities in the tropical semiring is undecidableA Kleene-Schützenberger Theorem for Weighted Timed AutomataMyhill-Nerode Theorem for Recognizable Tree Series RevisitedUnnamed ItemMatrix Mortality and the Černý-Pin ConjectureThe Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is RecognizableCompact Normal Form for Regular Languages as Xor AutomataUnnamed ItemOn the Supports of Recognizable Timed SeriesWeighted Operator Precedence LanguagesPuissance extérieure d'un automate déterministe, application au calcul de la fonction zêta d'un système sofiqueOn morphically generated formal power seriesGenerating series for networks of Chen-Fliess seriesNoncommutative minimization algorithmsOn syntactic nuclei of rational languagesClique polynomials have a unique root of smallest modulusThe sum of nil one-sided ideals of bounded index of a ringWeighted automata and weighted logics with discountingSupervisory control of \((\max,+)\) automata: a behavioral approachDefinable transductions and weighted logics for textsWeighted automata and weighted logics on infinite wordsWeighted finite automata over strong bimonoidsRepresentation of normal bands as semigroups of \(k\)-bi-ideals of a semiringA rationality criterion coming from noncommutative geometryShuffle product formulas of multiple zeta valuesFinite biprefix sets of paths in a graphSkew and infinitary formal power seriesWeighted tree automata and weighted logicsThe regular algebra of a quiver.Dirichlet functions of order \(n\) and parameter \(t\)On a conjecture by Pierre Cartier about a group of associatorsWeighted finite automata over hemiringsNonnegative companion matrices and star-height of \(\mathbb{N}\)-rational seriesOn Lindenmayerian algebraic power seriesOn Lindenmayerian algebraic sequencesA generalized Goulden-Jackson cluster method and lattice path enumerationMöbius inversion formula for monoids with zero.Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collatedProgramming and automating mathematics in the Tarski-Kleene hierarchyOn images of D0L and DT0L power series.On the number of occurrences of a symbol in words of regular languages.Decidability results for Watson-Crick D0L systems with nonregular triggers.On transformations of formal power series.




This page was built for publication: