Automata theory Hard decision problems Regular Cost Functions

First Page		Document Content
Date: 2014-10-15 08:27:58 Mathematics Semigroup theory Algebra Category theory Models of computation Regular language Monoid Finite-state machine Free monoid Formal languages Abstract algebra Automata theory		Automata theory Hard decision problems Regular Cost Functions Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Download Document from Source Website File Size: 723,13 KB Share Document on Facebook

	THE CATENARY DEGREE OF KRULL MONOIDS II arXiv:1407.0548v1 [math.AC] 2 Jul 2014 ALFRED GEROLDINGER AND QINGHAI ZHONG Abstract. Let H be a Krull monoid with finite class group G such that every class contains a prime DocID: 1uPXf - View Document
	A CHARACTERIZATION OF CLASS GROUPS VIA SETS OF LENGTHS II arXiv:submitmath.NT] 17 Jun 2015 ALFRED GEROLDINGER AND QINGHAI ZHONG Abstract. Let H be a Krull monoid with finite class group G and suppose that ever DocID: 1u9Yj - View Document
	The kernel of a monoid morphism ´ Pin1 Jean-Eric 1 LIAFA, CNRS and University Paris Diderot DocID: 1u5re - View Document
	EMBEDDING IN FACTORISABLE RESTRICTION MONOIDS ´ HARTMANN, AND MARIA ´ VICTORIA GOULD, MIKLOS B. SZENDREI Abstract. Each restriction semigroup is proved to be embeddable in a factorisable restriction monoid, or, equival DocID: 1rD2C - View Document
	The Most General Conservation Law for a Cellular Automaton Enrico Formenti1? , Jarkko Kari2?? , and Siamak Taati32 1 Universit´e de Nice-Sophia Antipolis, D´epartment d’Informatique, DocID: 1rqpP - View Document