A characterization of harmonic languages
Page 1 Next
Milan Drášil, Miroslav Novotný (1991)
Archivum Mathematicum
Ayala-Rincón, Mauricio (1997)
Revista Colombiana de Matemáticas
Milan Drášil (1989)
Archivum Mathematicum
Yoshihiro Mizoguchi (1993)
Cahiers de Topologie et Géométrie Différentielle Catégoriques
Vince Bárány (2008)
RAIRO - Theoretical Informatics and Applications
We investigate automatic presentations of ω-words. Starting points of our study are the works of Rigo and Maes, Caucal, and Carton and Thomas concerning lexicographic presentation, MSO-interpretability in algebraic trees, and the decidability of the MSO theory of morphic words. Refining their techniques we observe that the lexicographic presentation of a (morphic) word is in a certain sense canonical. We then generalize our techniques to a hierarchy of classes of ω-words enjoying the above...
Predrag S. Stanimirović, Predrag V. Krtolica, Rade Stanojević (2003)
The Yugoslav Journal of Operations Research
Okada, M., Scott, P.J. (1999)
Theory and Applications of Categories [electronic only]
Velasco, Pedro Pablo Pérez, de Lara, Juan (2009)
The Electronic Journal of Combinatorics [electronic only]
Saubion, Frédéric, Stéphan, Igor (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Grzegorz Bancerek (2014)
Formalized Mathematics
Educational content for abstract reduction systems concerning reduction, convertibility, normal forms, divergence and convergence, Church- Rosser property, term rewriting systems, and the idea of the Knuth-Bendix Completion Algorithm. The theory is based on [1].
R. C. Carrasco (1997)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Stephen Lack, Paweł Sobociński (2005)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
Stephen Lack, Paweł Sobociński (2010)
RAIRO - Theoretical Informatics and Applications
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved, as well as quasiadhesive categories which restrict attention to regular monomorphisms. Many examples of graphical structures used in computer science are shown to be examples of adhesive and quasiadhesive categories. Double-pushout graph rewriting generalizes well to rewriting on arbitrary adhesive and quasiadhesive categories.
Radim Bělohlávek (1995)
Acta Mathematica et Informatica Universitatis Ostraviensis
A. Rudnicki (1993)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Morris Salkoff (1971)
Mathématiques et Sciences Humaines
Bořivoj Melichar, Jan Janoušek, Tomas Flouri (2012)
Kybernetika
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown automata...
Martin Kutrib, Matthias Wendlandt (2014)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We introduce and investigate several variants of a bidirectional string assembling system, which is a computational model that generates strings from copies of assembly units. The underlying mechanism is based on two-sided piecewise assembly of a double-stranded sequence of symbols, where the upper and lower strand have to match. The generative capacities and the relative power of the variants are our main interest. In particular, we prove that bidirectional string assembling system generate languages...
C. Pair (1971)
ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique
T. Isakowitz (1991)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Page 1 Next