Search results for "morphisms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
17	Lukas Fleischer, Manfred Kufleitner	Efficient Algorithms for Morphisms over Omega-Regular Languages.	FSTTCS	2015	DBLP DOI BibTeX RDF
17	Alexandr Valyuzhenich	On permutation complexity of fixed points of uniform binary morphisms.	Discret. Math. Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
17	Dali Zangurashvili	Effective Codescent Morphisms in Some Varieties of Universal Algebras.	Appl. Categorical Struct.	2014	DBLP DOI BibTeX RDF
17	Maria Manuel Clementino, Dirk Hofmann, Andrea Montoli	Covering Morphisms in Categories of Relational Algebras.	Appl. Categorical Struct.	2014	DBLP DOI BibTeX RDF
17	Thomas Kahl	Weak morphisms of higher dimensional automata.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
17	Zoran Majkic	Saturation of the morphisms in the database category.	CoRR	2014	DBLP BibTeX RDF
17	Lawrence H. Harper	Morphisms for resistive electrical networks.	Discret. Appl. Math.	2014	DBLP DOI BibTeX RDF
17	Luca Cardelli	Morphisms of reaction networks that couple structure to function.	BMC Syst. Biol.	2014	DBLP DOI BibTeX RDF
17	Luca Bernardinello, Lucia Pomello, Stefano Scaccabarozzi	Morphisms on Marked Graphs.	PNSE @ Petri Nets	2014	DBLP BibTeX RDF
17	Adrian Atanasiu, Kalpana Mahalingam, K. G. Subramanian 0001	Morphisms and Weak-Ratio Property.	Discrete Mathematics and Computer Science	2014	DBLP BibTeX RDF
17	Alexandre Blondin Massé, Sébastien Gaboury, Sylvain Hallé, Michaël Larouche	Solving Equations on Words with Morphisms and Antimorphisms.	LATA	2014	DBLP DOI BibTeX RDF
17	Anton Cerný	Solutions to the Multi-dimensional Equal Powers Problem Constructed by Composition of Rectangular Morphisms.	LATA	2014	DBLP DOI BibTeX RDF
17	Jörg Endrullis, Dimitri Hendriks	On periodically iterated morphisms.	CSL-LICS	2014	DBLP DOI BibTeX RDF
17	Christopher F. Townsend	Representing Geometric Morphisms Using Power Locale Monads.	Appl. Categorical Struct.	2013	DBLP DOI BibTeX RDF
17	João J. Xarez	Concordant and Monotone Morphisms.	Appl. Categorical Struct.	2013	DBLP DOI BibTeX RDF
17	Bachuki Mesablishvili	Pure Morphisms are Effective for Modules.	Appl. Categorical Struct.	2013	DBLP DOI BibTeX RDF
17	Hossein Nevisi, Daniel Reidenbach	Unambiguous 1-uniform morphisms.	Theor. Comput. Sci.	2013	DBLP DOI BibTeX RDF
17	Ahmet A. Husainov	Category of asynchronous systems and polygonal morphisms.	CoRR	2013	DBLP BibTeX RDF
17	Thomas Kahl	Weak morphisms of higher dimensional automata	CoRR	2013	DBLP BibTeX RDF
17	Florence Levé, Gwénaël Richomme	On Quasiperiodic Morphisms	CoRR	2013	DBLP BibTeX RDF
17	Luca Bernardinello, Elisabetta Mangioni, Lucia Pomello	Local State Refinement and Composition of Elementary Net Systems: An Approach Based on Morphisms.	Trans. Petri Nets Other Model. Concurr.	2013	DBLP DOI BibTeX RDF
17	Kazuhiko Kusano, Kazuyuki Narisawa, Ayumi Shinohara	On Morphisms Generating Run-Rich Strings.	Stringology	2013	DBLP BibTeX RDF
17	Michel Dekking	Dynamical Equivalence of Morphisms.	WORDS	2013	DBLP DOI BibTeX RDF
17	Aleksi Saarela	Weakly Unambiguous Morphisms with Respect to Sets of Patterns with Constants.	WORDS	2013	DBLP DOI BibTeX RDF
17	Florence Levé, Gwénaël Richomme	On Quasiperiodic Morphisms.	WORDS	2013	DBLP DOI BibTeX RDF
17	Glad Deschrijver	Triangular norms which are join-morphisms in 3-dimensional fuzzy set theory.	EUSFLAT Conf.	2013	DBLP DOI BibTeX RDF
17	Martin Hofmann 0008	Schema-Guided Inductive Functional Programming - Through Automatic Detection of Type Morphisms.	Künstliche Intell.	2012	DBLP DOI BibTeX RDF
17	Robert Paré	Mealy Morphisms of Enriched Categories.	Appl. Categorical Struct.	2012	DBLP DOI BibTeX RDF
17	Gwénaël Richomme, Patrice Séébold	Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
17	Michel Dekking	Paperfolding morphisms, planefilling curves, and fractal tiles.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
17	Arto Salomaa	Subword occurrences, weighted automata and iterated morphisms, especially the Fibonacci morphism.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
17	Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach	Weakly unambiguous morphisms.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
17	Jörg Endrullis, Dimitri Hendriks	On Periodically Iterated Morphisms	CoRR	2012	DBLP BibTeX RDF
17	Tomás Hejda	Morphisms preserving the set of words coding three interval exchange.	RAIRO Theor. Informatics Appl.	2012	DBLP DOI BibTeX RDF
17	Luca Bernardinello, Elisabetta Mangioni, Lucia Pomello	Local state refinement on Elementary Net Systems: an approach based on morphisms.	PNSE	2012	DBLP BibTeX RDF
17	Tomoyuki Suzuki 0001	Morphisms on Bi-approximation Semantics.	Advances in Modal Logic	2012	DBLP BibTeX RDF
17	Johannes C. Schneider	On the ambiguity of erasing morphisms.		2012	RDF
17	Taishin Yasunobu Nishida	Computing k-block Morphisms by Spiking Neural P Systems.	Fundam. Informaticae	2011	DBLP DOI BibTeX RDF
17	Daniel Reidenbach, Johannes C. Schneider	Restricted ambiguity of erasing morphisms.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
17	Alexander Valyuzhenich	Permutation complexity of the fixed points of some uniform binary morphisms	WORDS	2011	DBLP DOI BibTeX RDF
17	Hossein Nevisi, Daniel Reidenbach	Unambiguous 1-Uniform Morphisms	WORDS	2011	DBLP DOI BibTeX RDF
17	Stepan Holub	Binary Morphisms with Stable Suffix Complexity.	Int. J. Found. Comput. Sci.	2011	DBLP DOI BibTeX RDF
17	Glad Deschrijver	Triangular norms which are meet-morphisms in interval-valued fuzzy set theory.	Fuzzy Sets Syst.	2011	DBLP DOI BibTeX RDF
17	Claudia Chaio, Patrick Le Meur, Sonia Trepode	Degrees of irreducible morphisms and finite-representation type.	J. Lond. Math. Soc.	2011	DBLP DOI BibTeX RDF
17	István Kovács, Roman Nedela	Decomposition of skew-morphisms of cyclic groups.	Ars Math. Contemp.	2011	DBLP DOI BibTeX RDF
17	Jana Hadravová	The Block Structure of Successor Morphisms.	LATA	2011	DBLP DOI BibTeX RDF
17	José Ferreira, Carlos Agostinho, João Sarraipa, Ricardo Jardim-Gonçalves	Monitoring Morphisms to Support Sustainable Interoperability of Enterprise Systems.	OTM Workshops	2011	DBLP DOI BibTeX RDF
17	Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach	Weakly Unambiguous Morphisms.	STACS	2011	DBLP DOI BibTeX RDF
17	Yoshiyuki Kunimochi	Algebraic Properties of Petri Net Morphisms based on Place Connectivity.	AFL	2011	DBLP BibTeX RDF
17	Radim Belohlávek, Jan Konecny 0001	Closure Spaces of Isotone Galois Connections and Their Morphisms.	Australasian Conference on Artificial Intelligence	2011	DBLP DOI BibTeX RDF
17	Nazir Ahmad Zafar, Ajmal Hussain, Amir Ali	Verifying Monoid and Group Morphisms over Strongly Connected Algebraic Automata.	J. Softw. Eng. Appl.	2010	DBLP DOI BibTeX RDF
17	Juhani Karhumäki, Aleksi Saarela	Noneffective Regularity of Equality Languages and Bounded Delay Morphisms.	Discret. Math. Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
17	Christopher F. Townsend	A Representation Theorem for Geometric Morphisms.	Appl. Categorical Struct.	2010	DBLP DOI BibTeX RDF
17	Christopher Robinson Tompkins	The Morphisms With Unstackable Image Words	CoRR	2010	DBLP BibTeX RDF
17	Johannes C. Schneider	Unambiguous erasing morphisms in free monoids.	RAIRO Theor. Informatics Appl.	2010	DBLP DOI BibTeX RDF
17	Petr Ambroz, Zuzana Masáková, Edita Pelantová	Morphisms fixing words associated with exchange of three intervals.	RAIRO Theor. Informatics Appl.	2010	DBLP DOI BibTeX RDF
17	Daniel Reidenbach, Johannes C. Schneider	Restricted Ambiguity of Erasing Morphisms.	Developments in Language Theory	2010	DBLP DOI BibTeX RDF
17	Vincent Duquenne	Lattice Drawings and Morphisms.	ICFCA	2010	DBLP DOI BibTeX RDF
17	Sylvain Lombardy, Jacques Sakarovitch	Radix Cross-Sections for Length Morphisms.	LATIN	2010	DBLP DOI BibTeX RDF
17	Martin Hofmann 0008	Schema-guided inductive functional programming through automatic detection of type morphisms.		2010	RDF
17	Nazir Ahmad Zafar, Ajmal Hussain, Amir Ali	Refinement in Formal Proof of Equivalence in Morphisms over Strongly Connected Algebraic Automata.	J. Softw. Eng. Appl.	2009	DBLP DOI BibTeX RDF
17	Michelangelo Bucci, Aldo de Luca, Alessandro De Luca 0002	Characteristic morphisms of generalized episturmian words.	Theor. Comput. Sci.	2009	DBLP DOI BibTeX RDF
17	Juha Honkala	The equality problem for infinite words generated by primitive morphisms	CoRR	2009	DBLP BibTeX RDF
17	Dominik D. Freydenberger, Daniel Reidenbach	The unambiguity of segmented morphisms.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
17	James D. Currie, Narad Rampersad	There are k-uniform cubefree binary morphisms for all k>=0.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
17	Juhani Karhumäki	On the Power of Cooperating Morphisms via Reachability Problems.	Int. J. Found. Comput. Sci.	2009	DBLP DOI BibTeX RDF
17	Stepan Holub	Polynomial-time algorithm for fixed points of nontrivial morphisms.	Discret. Math.	2009	DBLP DOI BibTeX RDF
17	Dalia Krieger	On Critical exponents in fixed points of k-uniform binary morphisms.	RAIRO Theor. Informatics Appl.	2009	DBLP DOI BibTeX RDF
17	Juha Honkala	The equality problem for infinite words generated by primitive morphisms.	Inf. Comput.	2009	DBLP DOI BibTeX RDF
17	Nadir Matringe, Arnaldo Vieira Moura, Rachid Rebiha	Morphisms for Non-trivial Non-linear Invariant Generation for Algebraic Hybrid Systems.	HSCC	2009	DBLP DOI BibTeX RDF
17	Michael J. Healy, Thomas P. Caudell	Temporal semantics: An extended definition for neural morphisms.	IJCNN	2009	DBLP DOI BibTeX RDF
17	Jiri Mockor	Morphisms in Categories of Sets with Similarity Relations.	IFSA/EUSFLAT Conf.	2009	DBLP BibTeX RDF
17	Ronald Brown, Ifor Morris, J. Shrimpton, Christopher D. Wensley	Graphs of Morphisms of Graphs.	Electron. J. Comb.	2008	DBLP BibTeX RDF
17	Juhani Karhumäki	Reachability via Cooperating Morphisms.	RP	2008	DBLP DOI BibTeX RDF
17	Francesca Cagliari, Sandra Mantovani	Exponentiable morphisms of domains.	Math. Struct. Comput. Sci.	2008	DBLP DOI BibTeX RDF
17	Kristian Brüning, Birgit Huber	Realising Smashing Localisations as Morphisms of DG Algebras.	Appl. Categorical Struct.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 16E45
17	Valérie Berthé, Aldo de Luca, Christophe Reutenauer	On an involution of Christoffel words and Sturmian morphisms.	Eur. J. Comb.	2008	DBLP DOI BibTeX RDF
17	Juha Honkala	Cancellation and periodicity properties of iterated morphisms.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
17	Petr Ambroz, Zuzana Masáková, Edita Pelantová	Matrices of 3-iet preserving morphisms.	Theor. Comput. Sci.	2008	DBLP DOI BibTeX RDF
17	Fabien Durand, Adel Guerziz, Michel Koskas	Words and morphisms with Sturmian erasures	CoRR	2008	DBLP BibTeX RDF
17	Brendan Lucier	Binary Morphisms to Ultimately Periodic Words	CoRR	2008	DBLP BibTeX RDF
17	James D. Currie, Narad Rampersad	There are k-uniform cubefree binary morphisms for all k >= 0.	CoRR	2008	DBLP BibTeX RDF
17	Tobias Heindel	Grammar Morphisms and Weakly Adhesive Categories.	ICGT	2008	DBLP DOI BibTeX RDF
17	Gwénaël Richomme	On Morphisms Preserving Infinite Lyndon Words.	Discret. Math. Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
17	Sorin Constantinescu, Lucian Ilie	The Lempel--Ziv Complexity of Fixed Points of Morphisms.	SIAM J. Discret. Math.	2007	DBLP DOI BibTeX RDF
17	Florence Levé, Gwénaël Richomme	Quasiperiodic Sturmian words and morphisms.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
17	Dalia Krieger	On critical exponents in fixed points of non-erasing morphisms.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
17	Gwénaël Richomme	Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
17	Amy Glen	Conjugates of characteristic Sturmian words generated by morphisms.	CoRR	2007	DBLP BibTeX RDF
17	Gwénaël Richomme, Francis Wlazinski	Existence of finite test-sets for k-power-freeness of uniform morphisms.	Discret. Appl. Math.	2007	DBLP DOI BibTeX RDF
17	Gheorghe Paun, Mario J. Pérez-Jiménez, Grzegorz Rozenberg	Computing Morphisms by Spiking Neural P Systems.	Int. J. Found. Comput. Sci.	2007	DBLP DOI BibTeX RDF
17	Juha Honkala	A periodicity property of iterated morphisms.	RAIRO Theor. Informatics Appl.	2007	DBLP DOI BibTeX RDF
17	Anthony Karel Seda	Morphisms of ANN and the Computation of Least Fixed Points of Semantic Operators.	IWINAC (1)	2007	DBLP DOI BibTeX RDF
17	Carlos Agostinho, João Sarraipa, Fulvio D'Antonio, Ricardo Jardim-Gonçalves	Enhancing STEP-based Interoperabity Using Model Morphisms.	IESA	2007	DBLP DOI BibTeX RDF
17	Daniel Simson	Irreducible morphisms, the Gabriel-valued quiver and colocalizations for coalgebras.	Int. J. Math. Math. Sci.	2006	DBLP DOI BibTeX RDF
17	Florence Levé, Gwénaël Richomme	Quasiperiodic Sturmian words and morphisms	CoRR	2006	DBLP BibTeX RDF
17	Joachim Wehler	Morphisms of Coloured Petri Nets	CoRR	2006	DBLP BibTeX RDF
17	Pascal Ochem	A generator of morphisms for infinite words.	RAIRO Theor. Informatics Appl.	2006	DBLP DOI BibTeX RDF
17	Paulo Tabuada	Local factorization of trajectory lifting morphisms for single-input affine control systems.	Syst. Control. Lett.	2006	DBLP DOI BibTeX RDF
17	Daniel Reidenbach	The ambiguity of morphisms in free monoids and its impact on algorithmic properties of pattern languages.		2006	RDF