Julien Cassaigne, Juhani Karhumäki, Ján Maňuch (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We say that two languages and are conjugates if they satisfy the for some language . We study several problems associated with this equation. For example, we characterize all sets which are conjugated a two-element biprefix set , as well as all two-element sets which are conjugates.
M. A. Obregon, Y. A. Stepanyants (2012)
Mathematical Modelling of Natural Phenomena
Similarity:
A simple explicit numerical scheme is proposed for the solution of the Gardner–Ostrovsky equation ( + + + + ) = which is also known as the extended rotation-modified Korteweg–de Vries (KdV) equation. This equation is used for the description of internal oceanic waves affected by Earth’ rotation. Particular...
Vesa Halava, Tero Harju, Hendrik Jan Hoogeboom, Michel Latteux (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
We consider shifted equality sets of the form , where and are nonerasing morphisms and is a letter. We are interested in the family consisting of the languages , where is a coding and is a shifted equality set. We prove several closure properties for this family. Moreover, we show that every recursively enumerable language is a projection of a shifted equality set, that is, for some (nonerasing) morphisms and and...
Alberto Bertoni, Maria Paola Bianchi, Flavi D’Alessandro (2012)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Let = { ∈ | () } be the language recognized by a formal series : → ℝ with isolated cut point . We provide new conditions that guarantee the regularity of the language in the case that is rational or is a Hadamard quotient of rational series. Moreover the decidability property of such conditions is investigated.
Andrzej Szepietowski (2011)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Two deterministic finite automata are almost equivalent if they disagree in acceptance only for finitely many inputs. An automaton is hyper-minimized if no automaton with fewer states is almost equivalent to . A regular language is canonical if the minimal automaton accepting is hyper-minimized. The asymptotic state complexity () of a regular language is the number of states of a hyper-minimized automaton for a language finitely different from . In this paper we show...
Andrzej Szepietowski (2012)
RAIRO - Theoretical Informatics and Applications
Similarity:
Two deterministic finite automata are almost equivalent if they disagree in acceptance only for finitely many inputs. An automaton is hyper-minimized if no automaton with fewer states is almost equivalent to . A regular language is canonical if the minimal automaton accepting is hyper-minimized. The asymptotic state complexity () of a regular language is the number of states of a hyper-minimized automaton...