Juha Honkala

From MaRDI portal
Revision as of 01:04, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Juha Honkala to Juha Honkala: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:221693

Available identifiers

zbMath Open honkala.juhaMaRDI QIDQ221693

List of research outcomes

PublicationDate of PublicationType
Rational power series in several noncommuting variables and the Skolem-Mahler-Lech theorem2024-04-17Paper
An iteration property of Lindenmayerian power series2024-01-29Paper
ON SPARSE 0L LANGUAGES OVER THE BINARY ALPHABET2022-12-06Paper
Lindenmayer Systems2022-04-28Paper
Quasi-universal \(k\)-regular sequences2021-10-21Paper
A characterization of free pairs of upper triangular free monoid morphisms2019-05-29Paper
Equality sets of binary D0L sequences2018-06-08Paper
A new bound for the D0L language equivalence problem2018-02-28Paper
D0L Sequences and their Equality Sets2018-01-19Paper
Discrete Watson-Crick dynamical systems2017-12-06Paper
Rational series with high image complexity2017-09-04Paper
https://portal.mardi4nfdi.de/entity/Q28193912016-09-29Paper
Remarks concerning the freeness problem over morphism and matrix semigroups.2016-06-27Paper
Language-theoretic problems in certain matrix monoids2015-09-16Paper
The finiteness problem for monoids of morphisms2015-04-15Paper
A Kraft-McMillan inequality for free semigroups of upper-triangular matrices2014-11-28Paper
Products of matrices and recursively enumerable sets2014-11-24Paper
The freeness problem over matrix semigroups and bounded languages2014-07-18Paper
EQUALITY SETS OF MORPHIC WORD SEQUENCES2013-07-30Paper
The sequence equivalence problem for primitive D0L systems2013-02-21Paper
Marked D0L systems and the \(2n\)-conjecture2012-06-25Paper
https://portal.mardi4nfdi.de/entity/Q28933042012-06-20Paper
A characterization of rational D0L power series2012-03-23Paper
The cyclicity problem for the images of Q-rational series2012-02-28Paper
The Sequence Equivalence Problem for Marked DT0L Systems2011-11-22Paper
The equality problem for purely substitutive words2011-04-18Paper
The class of HDT0L sequences is closed with respect to rational functions2009-12-04Paper
https://portal.mardi4nfdi.de/entity/Q33965972009-09-19Paper
https://portal.mardi4nfdi.de/entity/Q33959532009-09-15Paper
https://portal.mardi4nfdi.de/entity/Q33959692009-09-15Paper
The equality problem for infinite words generated by primitive morphisms2009-07-15Paper
NUMBER SYSTEMS AND THE INJECTIVITY PROBLEM FOR MATRIX REPRESENTATIONS OF FREE MONOIDS2009-06-30Paper
On the simplification of infinite morphic words2009-03-17Paper
Sparse and slender subsets of monoids.2008-04-03Paper
Cancellation and periodicity properties of iterated morphisms2008-03-05Paper
https://portal.mardi4nfdi.de/entity/Q54430792008-02-18Paper
A periodicity property of iterated morphisms2008-02-15Paper
https://portal.mardi4nfdi.de/entity/Q54219342007-10-25Paper
THE D0L ω-EQUIVALENCE PROBLEM2007-03-13Paper
A new bound for the D0L sequence equivalence problem2007-01-05Paper
https://portal.mardi4nfdi.de/entity/Q34099832006-11-21Paper
THE BASE PROBLEM FOR D0L PARIKH SETS2006-05-10Paper
An \(n^2\)-bound for the ultimate equivalence problem of certain D0L systems over an \(n\)-letter alphabet2005-12-07Paper
The equivalence problem for languages defined by transductions on D0L languages2005-07-27Paper
REMARKS CONCERNING THE D0L ω-EQUIVALENCE PROBLEM2005-06-22Paper
It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base2005-04-28Paper
https://portal.mardi4nfdi.de/entity/Q46657462005-04-11Paper
The language equivalence problem for HD0L systems having D0L growths2005-02-22Paper
A bound for theω-equivalence problem of polynomial D0L systems2004-10-28Paper
Decidability questions related to abstract numeration systems2004-08-19Paper
Bounds for the D0L language equivalence problem2004-08-06Paper
On the Images of ℕ-Rational Sequences Counting Multiplicities2004-08-06Paper
On infinite HD0L words having sparse letters2004-05-27Paper
https://portal.mardi4nfdi.de/entity/Q44581382004-03-17Paper
https://portal.mardi4nfdi.de/entity/Q44532162004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44394502003-12-14Paper
The equivalence problem of polynomially bounded D0L systems -- a bound depending only on the size of the alphabet2003-08-26Paper
On images of D0L and DT0L power series.2003-08-17Paper
Decidability results for Watson-Crick D0L systems with nonregular triggers.2003-08-17Paper
The equivalence problem for DF0L languages and power series.2003-05-14Paper
The equality problem for Parikh simple algebraic power series.2003-01-21Paper
RESULTS CONCERNING THINNESS OF D0L LANGUAGES2002-12-15Paper
https://portal.mardi4nfdi.de/entity/Q31524282002-12-10Paper
On number systems with finite degree of ambiguity2002-11-24Paper
On n-algebraic power series having polynomial growths112002-11-14Paper
A polynomial bound for certain cases of the D0L sequence equivalence problem2002-06-30Paper
On infinite words generated by polynomial D0L systems2002-03-06Paper
https://portal.mardi4nfdi.de/entity/Q45057032001-09-04Paper
On D0L and HDT0L sets in monoids2001-08-27Paper
On Parikh slender context-free languages2001-08-20Paper
Watson-Crick D0L systems with regular triggers2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q27292342001-07-18Paper
https://portal.mardi4nfdi.de/entity/Q27144052001-06-13Paper
https://portal.mardi4nfdi.de/entity/Q45202772001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45203022001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45203142001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45205162001-02-26Paper
A Kleene-Schützenberger theorem for Lindenmayerian rational power series2001-02-11Paper
Easy cases of the D0L sequence equivalence problem2001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904212001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47904232001-01-01Paper
https://portal.mardi4nfdi.de/entity/Q49411542000-10-17Paper
https://portal.mardi4nfdi.de/entity/Q45003682000-09-04Paper
On D0L power series2000-08-21Paper
A short solution for the HDT0L sequence equivalence problem2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49422442000-07-20Paper
On slender 0L languages over the binary alphabet2000-06-05Paper
https://portal.mardi4nfdi.de/entity/Q49420382000-03-19Paper
On the equivalence problem of context-free and DT0L languages2000-01-17Paper
https://portal.mardi4nfdi.de/entity/Q42656351999-11-23Paper
https://portal.mardi4nfdi.de/entity/Q42664901999-09-30Paper
On Sequences Defined by D0L Power Series1999-09-22Paper
https://portal.mardi4nfdi.de/entity/Q42354361999-06-20Paper
Decision problems concerning thinness and slenderness of formal languages1999-01-11Paper
On Lindenmayerian algebraic power series1998-07-22Paper
On Lindenmayerian algebraic sequences1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43908681998-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43627361997-12-14Paper
On the Decidability of Some Equivalence Problems for L Algebraic Series1997-10-06Paper
On lindenmayerian rational subsets of monoids1997-08-14Paper
A decision method for Parikh slenderness of context-free languages1997-06-30Paper
https://portal.mardi4nfdi.de/entity/Q48969261997-02-03Paper
https://portal.mardi4nfdi.de/entity/Q48746551996-08-13Paper
On Parikh slender languages and power series1996-07-16Paper
https://portal.mardi4nfdi.de/entity/Q49422581996-01-01Paper
On generalized DT0L systems and their fixed points1995-11-06Paper
On morphically generated formal power series1995-05-01Paper
On D0L systems with immigration1994-11-29Paper
https://portal.mardi4nfdi.de/entity/Q40365941993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40367581993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40361751993-05-16Paper
Caractérisation results about $L$ codes1992-09-27Paper
On generalized zeta functions of formal languages and series1992-06-26Paper
On algebraic generalized zeta functions of formal power series1991-01-01Paper
A necessary condition for the rationality of the zeta function of a regular language1989-01-01Paper
On number systems with negative digits1989-01-01Paper
A defect property of codes with unbounded delays1988-01-01Paper
It is decidable whether or not a permutation-free morphism is an l code1987-01-01Paper
A decision method for the recognizability of sets defined by number systems1986-01-01Paper
Bases and ambiguity of number systems1984-01-01Paper
Unique representation in number systems and L codes1982-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Juha Honkala