The following pages link to (Q4155837):
Displayed 50 items.
- 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)
- 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)
- 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)
- 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)
- Skew and infinitary formal power series (Q860889) (← links)
- Weighted tree automata and weighted logics (Q860890) (← links)
- Counting problems and algebraic formal power series in noncommuting variables (Q910245) (← links)
- Effective construction of the syntactic algebra of a recognizable series on trees (Q911788) (← links)
- Parallel complexity of the regular code problem (Q913513) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- A model for developmental systems. I: Generating word without any operating system (Q913692) (← links)
- A note on terminal balancing of algebraic systems (Q915488) (← links)
- On aperiodic and star-free formal power series in partially commuting variables (Q927397) (← links)
- Intuitionistic fuzzy left \(k\)-ideals of semirings. (Q931450) (← links)
- The number of convex permutominoes (Q948075) (← links)
- Semi-synchronous transductions (Q1006891) (← links)
- A note on commutative multivariate rational series (Q1014441) (← links)
- Weighted asynchronous cellular automata (Q1022595) (← links)
- Characterizations of recognizable picture series (Q1022605) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- Cyclic derivation of noncommutative algebraic power series (Q1056818) (← links)
- Polynomials associated with the characters of SU(n) (Q1060331) (← links)
- On cancellation properties of languages which are supports of rational power series (Q1066677) (← links)
- An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable (Q1070831) (← links)
- R-fuzzy computation (Q1072368) (← links)
- Computation theory of cellular automata (Q1072705) (← links)
- Perron-Frobenius theory of some algebraic equations associated with context free grammars (Q1076108) (← links)
- Occurrence of zero in a linear recursive sequence (Q1077447) (← links)
- Rational languages and the Burnside problem (Q1079380) (← links)
- Truncations of infinite matrices and algebraic series associated with some CF grammars (Q1079959) (← links)
- Recurrent words and simultaneous growth in T0L systems (Q1081308) (← links)
- A note on the equivalence problem of rational formal power series (Q1087021) (← links)
- On equality of multiplicity sets of regular languages (Q1087336) (← links)