Uniquely decodable n-gram embeddings

Theoretical Computer Science

Volumn 329, Issue 1-3, 2004, Pages 271-284

  Kontorovich, Leonid ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Embedding; Finite state automaton; Finite transducer; N gram; String

Indexed keywords

AUTOMATA THEORY; EMBEDDED SYSTEMS; FINITE AUTOMATA; LEARNING SYSTEMS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING;

EMBEDDING; FINITE TRANSDUCERS; N-GRAM; STRING;

COMPUTER SCIENCE;

EID: 10044277213     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.010     Document Type: Article

References (8)

1. D. Angluin, On the complexity of minimum inference of regular sets, Inform. Control 39 (1978) 337-350.
2. G.R. Brightwell, P. Winkler, Note on Counting Eulerian Circuits, 〈http://arxiv.org/abs/cs/0405067〉, 2004.
3. H. Fleischner, Eulerian Graphs and Related Topics, Vol. 2, Ann. Discrete Math., 50, Amsterdam, 1991.
4. B. Hao, H. Xie, S. Zhang, Compositional representation of protein sequences and the number of Eulerian loops, 〈http://arxiv.org/abs/physics/ 0103028〉, 2001.
5. H. Lewis, C. Papadimitriou, Elements of the Theory of Computation, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1981.
6. C. Manning, H. Schütze, Foundations of Statistical Natural Language Processing, MIT Press, Cambridge, 1999.
7. P. Pevzner, Computational Molecular Biology: An Algorithmic Approach, MIT Press, Cambridge, 2000.
8. L. Pitt, M. Warmuth, The minimum consistent dfa problem cannot be approximated within any polynomial, JACM 40 (1) (1993).