The following pages link to (Q3994777):
Displaying 50 items.
- Noncommutative minimization algorithms (Q287255) (← links)
- On syntactic nuclei of rational languages (Q293361) (← links)
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- Shuffle product formulas of multiple zeta values (Q331104) (← links)
- On a conjecture by Pierre Cartier about a group of associators (Q384109) (← links)
- Weighted finite automata over hemirings (Q388788) (← links)
- Asymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collated (Q401474) (← links)
- Programming and automating mathematics in the Tarski-Kleene hierarchy (Q406433) (← links)
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
- Probabilistic grammars and languages (Q438593) (← links)
- Left inversion of analytic nonlinear SISO systems via formal power series methods (Q466488) (← links)
- Spectral learning of weighted automata. A forward-backward perspective (Q479459) (← links)
- Multi-weighted automata and MSO logic (Q504993) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- An Hadamard operation on rational relations (Q517036) (← links)
- An improved algorithm for determinization of weighted and fuzzy automata (Q543822) (← links)
- Möbius inversion formula for monoids with zero. (Q617859) (← links)
- Varieties of recognizable tree series over fields (Q627171) (← links)
- A Kleene-Schützenberger theorem for weighted timed automata (Q631775) (← links)
- Representation theory of finite semigroups over semirings. (Q657946) (← links)
- A noncommutative enumeration problem (Q666519) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← 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)
- Frequency of symbol occurrences in bicomponent stochastic models (Q703573) (← links)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- The set of realizations of a max-plus linear sequence is semi-polyhedral (Q716317) (← links)
- The growth function of \(S\)-recognizable sets (Q719280) (← links)
- The calculus of signal flow diagrams. I: Linear relations on streams. (Q729807) (← links)
- On algebraic generalized zeta functions of formal power series (Q753500) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- A characterization of rational D0L power series (Q766157) (← links)
- The equivalence problem of multitape finite automata (Q804302) (← links)
- Noncommutative rational functions and boundary links (Q810942) (← links)
- Generating series for networks of Chen-Fliess series (Q826829) (← links)
- Weighted automata and weighted logics with discounting (Q840767) (← links)
- Supervisory control of \((\max,+)\) automata: a behavioral approach (Q843993) (← 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)
- Skew and infinitary formal power series (Q860889) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- The regular algebra of a quiver. (Q875083) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids (Q930924) (← links)
- Intuitionistic fuzzy left \(k\)-ideals of semirings. (Q931450) (← links)
- Analytic and combinatoric aspects of Hurwitz polyzetas (Q933161) (← links)
- Weighted automata with discounting (Q963467) (← links)
