Pages that link to "Item:Q3288101"

The following pages link to On the definition of a family of automata (Q3288101):

Displaying 50 items.

• Noncommutative minimization algorithms (Q287255) (← links)
• Approximate comparison of functions computed by distance automata (Q290904) (← links)
• Function transformations with automata (Q376135) (← links)
• On a conjecture by Pierre Cartier about a group of associators (Q384109) (← links)
• Weighted finite automata over hemirings (Q388788) (← links)
• Free iterative and iteration \(K\)-semialgebras (Q412016) (← links)
• Symmetric determinantal representation of polynomials (Q417498) (← links)
• A coalgebraic perspective on linear weighted automata (Q418134) (← links)
• A spectral algorithm for learning hidden Markov models (Q439990) (← links)
• Spectral learning of weighted automata. A forward-backward perspective (Q479459) (← links)
• Relations on words (Q505060) (← links)
• Weighted automata and logics for infinite nested words (Q515684) (← links)
• Quantitative Kleene coalgebras (Q532394) (← links)
• Weak MSO with the unbounding quantifier (Q537919) (← links)
• A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
• Finite automata theory with membership values in lattices (Q632699) (← links)
• Representation theory of finite semigroups over semirings. (Q657946) (← links)
• Recognizable languages in concurrency monoids (Q672317) (← links)
• \(\mathbb{N}\)-rationality of zeta functions (Q679031) (← links)
• The operation \(\uparrow\) on formal power series (Q688677) (← links)
• Constructions of standard bases of right \(K\langle A\rangle\)- modules (Q688707) (← links)
• Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
• Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
• On the intersection of null spaces for matrix substitutions in a non-commutative rational formal power series (Q704234) (← links)
• Quantitative analysis of weighted transition systems (Q710680) (← links)
• Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
• Noncommutative rational functions and boundary links (Q810942) (← links)
• Weighted automata and weighted logics with discounting (Q840767) (← links)
• Definable transductions and weighted logics for texts (Q844894) (← links)
• Weighted automata and weighted logics on infinite words (Q845080) (← links)
• Weighted finite automata over strong bimonoids (Q845343) (← links)
• Noncommutative convexity arises from linear matrix inequalities (Q860776) (← links)
• Skew and infinitary formal power series (Q860889) (← links)
• Weighted tree automata and weighted logics (Q860890) (← links)
• On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
• Schützenberger's theorem on formal power series follows from Kleene's theorem (Q935170) (← links)
• Weighted automata with discounting (Q963467) (← links)
• Bilinear system interconnections and generating series of weighted Petri nets (Q976183) (← links)
• Singularities of rational functions and minimal factorizations: the noncommutative and the commutative setting (Q999772) (← links)
• Weighted asynchronous cellular automata (Q1022595) (← links)
• Characterizations of recognizable picture series (Q1022605) (← links)
• On cancellation properties of languages which are supports of rational power series (Q1066677) (← links)
• Rational languages and the Burnside problem (Q1079380) (← links)
• A simple proof of the Skolem-Mahler-Lech theorem (Q1084125) (← links)
• Applications of the theory of automata in enumeration (Q1122575) (← links)
• Un théorème de factorisation des produits d'endomorphismes de \(K^N\) (Q1142820) (← links)
• Series formelles et algèbres syntactiques (Q1144951) (← links)
• Sur les séries associees à certains systèmes de Lindenmayer (Q1151050) (← links)
• Recognizable formal power series on trees (Q1164440) (← links)
• The ring of \(k\)-regular sequences (Q1193879) (← links)