Labeled directed graphs and FSA as classifiers of strings Andrei Kelarev, Byeong Kang, Arthur Sale, Ray Williams School of Computing University of Tasmania Private Bag 100, Hobart Tasmania 7001, Australia

First Page		Document Content
Date: 2014-11-17 22:13:12 Formal languages Automata theory Theoretical computer science Graph Finite state transducer Tree automaton Mathematics Graph theory Combinatorics		Labeled directed graphs and FSA as classifiers of strings Andrei Kelarev, Byeong Kang, Arthur Sale, Ray Williams School of Computing University of Tasmania Private Bag 100, Hobart Tasmania 7001, Australia Add to Reading List Source URL: eprints.utas.edu.au Download Document from Source Website File Size: 204,43 KB Share Document on Facebook

	3 May 1998 ITERATED RANDOM FUNCTIONS Persi Diaconis Department of Mathematics & ORIE Cornell University DocID: 1xVWv - View Document
	SCAN 2018 Post-conference Proceedings Special Issue of Journal of Computational and Applied Mathematics Call for Papers Special Issue on the 18th International Symposium on Scientific Computing, Computer Arithmetic, DocID: 1xVSx - View Document
	MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000–000 SXXBETTER POLYNOMIALS FOR GNFS SHI BAI, CYRIL BOUVIER, ALEXANDER KRUPPA, AND PAUL ZIMMERMANN DocID: 1xVRE - View Document
	A characterization of Riemann integrability Cosmin Burtea Faculty of Mathematics, "Al. I. Cuza" University of Ia³i, Romania Abstract We prove a characterization of Riemann integrability by using some Darboux-like sums w DocID: 1xVOd - View Document
	Mathematics 7-12, BS "DBEFNJD.BQ 5IF"DBEFNJD.BQTFSWFTBTBTVHHFTUFEDPVSTFTFRVFODFPOMZ4UVEFOUTBSFOPUMJNJUFEUPUIJTQMBOJUJTNFBOUUPCFVTFEBT DocID: 1xVH0 - View Document