The following pages link to Juha Honkala (Q221693):
Displaying 50 items.
- (Q197778) (redirect page) (← links)
- Remarks concerning the freeness problem over morphism and matrix semigroups. (Q300262) (← 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)
- Language-theoretic problems in certain matrix monoids (Q496056) (← links)
- Bounds for the D0L language equivalence problem (Q598185) (← links)
- A decision method for Parikh slenderness of context-free languages (Q674912) (← links)
- On algebraic generalized zeta functions of formal power series (Q753500) (← links)
- A characterization of rational D0L power series (Q766157) (← links)
- Unique representation in number systems and L codes (Q792953) (← links)
- Bases and ambiguity of number systems (Q798009) (← links)
- A new bound for the D0L sequence equivalence problem (Q855272) (← links)
- On the simplification of infinite morphic words (Q1006088) (← links)
- The class of HDT0L sequences is closed with respect to rational functions (Q1041741) (← links)
- A defect property of codes with unbounded delays (Q1113876) (← links)
- A necessary condition for the rationality of the zeta function of a regular language (Q1122359) (← links)
- On generalized zeta functions of formal languages and series (Q1179183) (← links)
- Decision problems concerning thinness and slenderness of formal languages (Q1271339) (← links)
- On number systems with finite degree of ambiguity (Q1271465) (← links)
- On D0L systems with immigration (Q1314370) (← links)
- On generalized DT0L systems and their fixed points (Q1342236) (← links)
- On Lindenmayerian algebraic power series (Q1391140) (← links)
- On Lindenmayerian algebraic sequences (Q1391141) (← links)
- On images of D0L and DT0L power series. (Q1401199) (← links)
- Decidability results for Watson-Crick D0L systems with nonregular triggers. (Q1401343) (← links)
- The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet (Q1405801) (← links)
- On slender 0L languages over the binary alphabet (Q1567203) (← links)
- On D0L power series (Q1575708) (← links)
- A short solution for the HDT0L sequence equivalence problem (Q1575723) (← links)
- Equality sets of binary D0L sequences (Q1637341) (← links)
- Discrete Watson-Crick dynamical systems (Q1682862) (← links)
- A new bound for the D0L language equivalence problem (Q1702303) (← links)
- The language equivalence problem for HD0L systems having D0L growths (Q1763705) (← links)
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
- The equality problem for Parikh simple algebraic power series. (Q1853111) (← links)
- The equivalence problem for DF0L languages and power series. (Q1872710) (← links)
- Decidability questions related to abstract numeration systems (Q1877679) (← links)
- On Parikh slender languages and power series (Q1915514) (← links)
- The sequence equivalence problem for primitive D0L systems (Q1936250) (← links)
- On the equivalence problem of context-free and DT0L languages (Q1961239) (← links)
- On D0L and HDT0L sets in monoids (Q1976433) (← links)
- Quasi-universal \(k\)-regular sequences (Q2235748) (← links)
- The freeness problem over matrix semigroups and bounded languages (Q2252531) (← links)
- The equality problem for infinite words generated by primitive morphisms (Q2389351) (← links)
- A characterization of free pairs of upper triangular free monoid morphisms (Q2417854) (← links)
- Cancellation and periodicity properties of iterated morphisms (Q2474225) (← links)
- Sparse and slender subsets of monoids. (Q2480765) (← links)
- An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet (Q2575836) (← links)
- (Q2714405) (← links)
