The following pages link to (Q4155837):
Displaying 50 items.
- Asymptotic properties of free monoid morphisms (Q272351) (← links)
- Clique polynomials have a unique root of smallest modulus (Q294815) (← links)
- A representation theorem for (\(q\)-)holonomic sequences (Q386034) (← links)
- Weighted finite automata over hemirings (Q388788) (← links)
- Coping with selfish on-going behaviors (Q418112) (← links)
- A coalgebraic perspective on linear weighted automata (Q418134) (← links)
- Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism (Q428858) (← links)
- Marked D0L systems and the \(2n\)-conjecture (Q428859) (← links)
- Products of matrices and recursively enumerable sets (Q473201) (← links)
- A Kraft-McMillan inequality for free semigroups of upper-triangular matrices (Q476180) (← links)
- Spectral learning of weighted automata. A forward-backward perspective (Q479459) (← links)
- Eulerian cube complexes and reciprocity (Q488578) (← links)
- Multi-weighted automata and MSO logic (Q504993) (← links)
- Cayley graphs and automatic sequences (Q510068) (← links)
- Weighted automata and logics for infinite nested words (Q515684) (← links)
- Unbounded-error quantum computation with small space bounds (Q550246) (← links)
- Absolute convergence of rational series is semi-decidable (Q553292) (← links)
- A lower bound for probabilistic algorithms for finite state machines (Q579936) (← links)
- A representation theorem of infinite dimensional algebras and applications to language theory (Q579947) (← links)
- On some decision questions concerning pushdown machines (Q593781) (← links)
- Iterative and recursive matrix theories (Q595766) (← links)
- On commutative DTOL systems (Q599514) (← 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)
- Production matrices and riordan arrays (Q659779) (← links)
- A noncommutative enumeration problem (Q666519) (← links)
- Representations and complete semiring morphisms (Q672829) (← links)
- Valuations of languages, with applications to fractal geometry (Q674334) (← links)
- The operation \(\uparrow\) on formal power series (Q688677) (← links)
- An optimal pre-determinization algorithm for weighted transducers (Q703490) (← links)
- Branching automata with costs -- a way of reflecting parallelism in costs (Q703495) (← links)
- Weak minimization of DFA -- an algorithm and applications (Q703502) (← links)
- The growth function of \(S\)-recognizable sets (Q719280) (← links)
- The algebraic theory of Parikh automata (Q722218) (← links)
- Effective entropies and data compression (Q751832) (← links)
- The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
- On algebraic generalized zeta functions of formal power series (Q753500) (← links)
- Quasi-polynomials, linear Diophantine equations and semi-linear sets (Q764313) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
- A characterization of rational D0L power series (Q766157) (← links)
- Separately continuous algebras (Q790140) (← links)
- Completing biprefix codes (Q790624) (← links)
- The rank of a formal tree power series (Q792763) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- On formal power series defined by infinite linear systems (Q799111) (← links)
- On a family of L languages resulting from systolic tree automata (Q800102) (← links)
- The equivalence problem of multitape finite automata (Q804302) (← links)
- Asymptotic approximation by regular languages (Q831785) (← links)
