Search results for "infinite alphabet"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Yujiun P. Wang, Theodosios Pavlidis	Optimal Correspondence of String Subsequences.	IEEE Trans. Pattern Anal. Mach. Intell.	1990	DBLP DOI BibTeX RDF	string-to-string subsequence, string-to-regular-expression subsequence, string subsequences, optimal correspondent subsequence, finite alphabet editing error minimization matching, infinite alphabet penalty minimization matching, syntactic information, stereo epipolar line matching problem, UPC bar-code recognition, pattern recognition, computational complexity, computational complexity, metric, optimisation, template matching, relaxation, elastic matching, string distance, regular grammar
1	Daniel Dombek	Substitutions over infinite alphabet generating (-β)-integers	WORDS	2011	DBLP DOI BibTeX RDF
1	Marcia Gibson, Marc Conrad, Carsten Maple	Infinite Alphabet Passwords - A Unified Model for a Class of Authentication Systems.	SECRYPT	2010	DBLP BibTeX RDF
1	Diego Figueira	Forward-XPath and extended register automata on data-trees.	ICDT	2010	DBLP DOI BibTeX RDF	alternating tree register automata, data-tree, forward XPath, infinite alphabet, unranked ordered tree, XML
1	Yulia Dubov, Michael Kaminski	The Power of Non-deterministic Reassignment in Infinite-Alphabet Pushdown Automata.	Languages: From Formal to Natural	2009	DBLP DOI BibTeX RDF
1	Diego Figueira	Satisfiability of downward XPath with data equality tests.	PODS	2009	DBLP DOI BibTeX RDF	bip automaton, data-tree, infinite alphabet, unranked unordered tree, xpath, xml, data values
1	Tony Tan	Graph Reachability and Pebble Automata over Infinite Alphabets.	LICS	2009	DBLP DOI BibTeX RDF
1	Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat	Coding on Countably Infinite Alphabets.	IEEE Transactions on Information Theory	2009	DBLP DOI BibTeX RDF
1	Alexei Lisitsa, Igor Potapov, Rafiq Saleh	Automata on Gauss Words.	LATA	2009	DBLP DOI BibTeX RDF
1	Alexis Bès	An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet.	Logical Methods in Computer Science	2008	DBLP DOI BibTeX RDF
1	Alexis Bès	An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet	CoRR	2008	DBLP BibTeX RDF
1	Boris Ryabko, Jaakko Astola, Alexander Gammerman	Adaptive Coding and Prediction of Sources With Large and Infinite Alphabets.	IEEE Transactions on Information Theory	2008	DBLP DOI BibTeX RDF
1	Michael Kaminski, Tony Tan	Tree Automata over Infinite Alphabets.	Pillars of Computer Science	2008	DBLP DOI BibTeX RDF
1	Michael B. Baer	Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties	CoRR	2007	DBLP BibTeX RDF
1	Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison	Satisfiability of a Spatial Logic with Tree Variables.	CSL	2007	DBLP DOI BibTeX RDF
1	Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu	Rewriting Systems with Data.	FCT	2007	DBLP DOI BibTeX RDF
1	Vladimir A. Oleshchuk	Privacy Preserving Monitoring and Surveillance in Sensor Networks.	ISPA Workshops	2007	DBLP DOI BibTeX RDF
1	Tomohiko Uyematsu, Fumio Kanaya	Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet.	IEICE Transactions	2006	DBLP DOI BibTeX RDF
1	Luc Segoufin	Automata and Logics for Words and Trees over an Infinite Alphabet.	CSL	2006	DBLP DOI BibTeX RDF
1	Michael B. Baer	Source Coding for Quasiarithmetic Penalties.	IEEE Transactions on Information Theory	2006	DBLP DOI BibTeX RDF
1	Taolue Chen, Wan Fokkink, Sumit Nain	On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.	FoSSaCS	2006	DBLP DOI BibTeX RDF
1	Jürgen Dassow, György Vaszil	P Finite Automata and Regular Languages over Countably Infinite Alphabets.	Workshop on Membrane Computing	2006	DBLP DOI BibTeX RDF
1	Da-ke He, En-Hui Yang	The universality of grammar-based codes for sources with countably infinite alphabets.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Hiroki Koga, Hirosuke Yamamoto	Asymptotic properties on codeword lengths of an optimal FV code for general sources.	IEEE Transactions on Information Theory	2005	DBLP DOI BibTeX RDF
1	Boris Ryabko, Jaakko Astola	Adaptive Coding and Prediction of Sources with Large and Infinite Alphabet. (PDF / PS)	Data Compression Conference	2004	DBLP DOI BibTeX RDF
1	Michael Kaminski, Tony Tan	Regular Expressions for Languages over Infinite Alphabets.	COCOON	2004	DBLP DOI BibTeX RDF
1	Neil Hindman, Randall McCutcheon	Partition Theorems for Left and Right Variable Words.	Combinatorica	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05D10, 22A15
1	Amihood Amir, Kenneth Ward Church, Emanuel Dar	Separable attributes: a technique for solving the sub matrices character count problem.	SODA	2002	DBLP DOI BibTeX RDF
1	Marcus Hutter	Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences.	ECML	2001	DBLP DOI BibTeX RDF
1	Giancarlo Mauri, Giulio Pavesi	Approximation Algorithms for String Folding Problems.	IFIP TCS	2000	DBLP DOI BibTeX RDF
1	Edward Y. C. Cheng, Michael Kaminski	Context-Free Languages over Infinite Alphabets.	Acta Inf.	1998	DBLP DOI BibTeX RDF
1	A. Kato, Te Sun Han, H. Nagaoka	Huffman coding with an infinite alphabet.	IEEE Transactions on Information Theory	1996	DBLP DOI BibTeX RDF
1	David S. Herscovici	Minimal distance lexicographic codes over an infinite alphabet.	IEEE Transactions on Information Theory	1991	DBLP DOI BibTeX RDF
1	Klaus P. Jantke	Polynomial Time Inference of General Pattern Languages.	STACS	1984	DBLP DOI BibTeX RDF
1	Harry H. Tan, K. Yao	Rate Distortion Functions of Countably Infinite Alphabet Memoryless Sources	Information and Control	1975	DBLP DOI BibTeX RDF
1	Udo Augustin	Infinite-Alphabet Channels and the Method of Codes of a Fixed Composition	Information and Control	1970	DBLP DOI BibTeX RDF