Filters








6 Hits in 1.3 sec

The Equivalence Problem for DF0L Languages and Power Series

Juha Honkala
2002 Journal of computer and system sciences (Print)  
We discuss also DF0L power series and solve their equivalence problem over computable fields. # 2002 Elsevier Science (USA)  ...  We show that equivalence is decidable for D0L systems with finite axiom sets.  ...  Various special cases of the DF0L language equivalence problem are discussed in [16] .  ... 
doi:10.1006/jcss.2002.1850 fatcat:ibzv5qao6zd5nhlyhzv4bo6hum

L morphisms: Bounded delay and regularity of ambiguity [chapter]

Juha Honkala, Arto Salomaa
1991 Lecture Notes in Computer Science  
Juha Honkala: The equivalence problem for DF0L languages and power series, Journal of Computer and System Sciences 65 (2002) 377-392. 51.  ...  Juha Honkala: The equivalence problem of D0L and DF0L power series, Fundamenta Informaticae 38 (1999) 201-208. 31.  ... 
doi:10.1007/3-540-54233-7_164 fatcat:7mgxxwzh2vbw3kmkaxb4bldi64

Volume TOC

2002 Journal of computer and system sciences (Print)  
Wanke 377 The Equivalence Problem for DF0L Languages and Power Series Juha Honkala 393 Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds  ...  Ramesh545The consensus string problem and the complexity of comparing hidden Markov models Rune B. Lyngs and Christian N.S.  ... 
doi:10.1016/s0022-0000(02)00053-3 fatcat:47pyacdjpbhx7pzsx2iasdeyom

On D0L power series

Juha Honkala
2000 Theoretical Computer Science  
We show how elementary morphisms introduced by Ehrenfeucht and Rozenberg can be used in connection with power series, characterize the sequences of rational numbers and integers which can appear as coe  ...  The decidability of the last condition follows by the decidability of the equivalence problem for Z-rational sequences.  ...  A brilliant example is the solution of the equivalence problem for ÿnite deterministic multitape automata given by Harju and Karhum aki [5] .  ... 
doi:10.1016/s0304-3975(98)00338-7 fatcat:wn7uaiegdfgb5fmyuasg4eqxgm

L Systems [chapter]

Lila Kari, Grzegorz Rozenberg, Arto Salomaa
1997 Handbook of Formal Languages  
The equivalence problem between TUL and UL languages, as well as the equivalence problem between TUL languages and regular languages are decidable. the regularity and UL-ness problems are decidable for  ...  It was known quite early, [N] , that a solution to the D0L sequence equivalence problem yields a solution to the D0L language equivalence problem, and vice versa.  ... 
doi:10.1007/978-3-642-59136-5_5 fatcat:5evlmahr75dadkiqepxf7rqkf4

A periodicity property of iterated morphisms

Juha Honkala
2007 RAIRO - Theoretical Informatics and Applications  
This result plays a key role in the solution of the DF0L language equivalence problem in [4] . In this paper we study this periodicity result in more detail.  ...  Hence, the words u n and v n give the words f n (u) and f n (v) from the first position where the latter words differ.  ... 
doi:10.1051/ita:2007016 fatcat:xtjgisbtm5bqjbtjp73hfnhcn4