Search results for "recognizable"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
102	S. Gnanasekaran, V. Rajkumar Dare	On Recognizable Infinite Array Languages.	IWCIA	2004	DBLP DOI BibTeX RDF	prefix, local language, recognizable array language, on-line tesselation automaton, learning, array
92	Olga Sokratova	Linear Automata and Recognizable Subsets in Free Semirings.	FCT	2001	DBLP DOI BibTeX RDF	dynamical (linear) system, recognizable set, semiring
88	Dongjae Lee, Kyoungtaek Choi, Heeseung Choi, Jaihie Kim	Recognizable-Image Selection for Fingerprint Recognition With a Mobile-Device Camera.	IEEE Trans. Syst. Man Cybern. Part B	2008	DBLP DOI BibTeX RDF
80	Jarkko Kari, Cristopher Moore	New Results on Alternating and Non-deterministic Two-Dimensional Finite-State Automata.	STACS	2001	DBLP DOI BibTeX RDF
69	Alberto Bertoni, Massimiliano Goldwurm, Violetta Lonati	On the Complexity of Unary Tiling-Recognizable Picture Languages.	STACS	2007	DBLP DOI BibTeX RDF	unary picture languages, tiling systems, Turing machine head reversal
69	Paul Gastin	Recognizable and Rational Languages of Finite and Infinite Traces.	STACS	1991	DBLP DOI BibTeX RDF
63	Flemming Nielson, Hanne Riis Nielson, Helmut Seidl	Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi.	SAS	2002	DBLP DOI BibTeX RDF	uniform Horn clauses, strongly recognizable relations, Program analysis, Spi calculus
60	Bernard Boigelot, Julien Brusten, Véronique Bruyère	On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases.	ICALP (2)	2008	DBLP DOI BibTeX RDF
59	Giusi Castiglione, Roberto Vaglica	Recognizable Picture Languages and Polyominoes.	CAI	2007	DBLP DOI BibTeX RDF
59	Klaus Reinhardt	On Some Recognizable Picture-Languages.	MFCS	1998	DBLP DOI BibTeX RDF
58	Daniel Kirsten	An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable.	MFCS	2009	DBLP DOI BibTeX RDF
58	Daniel Kirsten	The Support of a Recognizable Series over a Zero-Sum Free, Commutative Semiring Is Recognizable.	Developments in Language Theory	2009	DBLP DOI BibTeX RDF
54	T. Kalyani, V. Rajkumar Dare, D. Gnanaraj Thomas, T. Robinson 0001	Iso-array Acceptors and Learning.	ICGI	2006	DBLP DOI BibTeX RDF	iso-picture languages, recognizable iso-picture languages, two-dimensional on-line tessellation automaton, Learning
54	D. Gnanaraj Thomas, M. Humrosia Begam, K. G. Subramanian 0001, S. Gnanasekaran	Learning of Regular Bi-omega Languages.	ICGI	2002	DBLP DOI BibTeX RDF	local bi-$omega$ languages, recognizable bi-$omega$ languages, rational bi-adherence languages, B$ddot{u}$chi local bi-$omega$ languages, regular bi-$omega$ languages, Learning algorithm
53	Christophe Cérin, Antoine Petit 0001	Speedup of Recognizable Trace Languages.	MFCS	1993	DBLP DOI BibTeX RDF	recognizable language, trace, speedup
50	Paul Gastin, Antoine Petit 0001, Wieslaw Zielonka	A Kleene Theorem for Infinite Trace Languages.	ICALP	1991	DBLP DOI BibTeX RDF
49	Marcella Anselmo, Maria Madonia	A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages.	CAI	2009	DBLP DOI BibTeX RDF	Unambiguity, Complement, Automata and Formal Languages, Two-dimensional languages
49	Dora Giammarresi	Tiling Recognizable Two-Dimensional Languages.	CAI	2007	DBLP DOI BibTeX RDF	Tiling systems, Unambiguity, Determinism, Automata and Formal Languages, Two-dimensional languages
49	Manfred Droste, Dietrich Kuske	On Recognizable Languages in Divisibility Monoids.	FCT	1999	DBLP DOI BibTeX RDF
49	Rémi Gilleron	Decision Problems for Term Rewriting Systems and Recognizable Tree Languages.	STACS	1991	DBLP DOI BibTeX RDF
44	F. Sweety, D. Gnanaraj Thomas, T. Kalyani	Collage of Hexagonal Arrays.	ISVC (2)	2008	DBLP DOI BibTeX RDF	Hexagonal arrays, recognizable languages, collage
44	Manfred Droste, Guo-Qiang Zhang 0001	Rational Transformations of Formal Power Series.	ICALP	2001	DBLP DOI BibTeX RDF	rational languages, recognizable languages, weighted finite automata, Formal power series
43	Michel Rigo	Characterizing Simpler Recognizable Sets of Integers.	Stud Logica	2004	DBLP DOI BibTeX RDF	Star-free languages, recognizable sets of integers, numeration systems, logical characterizations
40	Symeon Bozapalidis	Equational Elements in Additive Algebras.	Theory Comput. Syst.	1999	DBLP DOI BibTeX RDF
40	Bernard Boigelot, Stéphane Rassart, Pierre Wolper	On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract).	ICALP	1998	DBLP DOI BibTeX RDF
40	Yves Métivier, Gwénaël Richomme	On the Star Operation and the Finite Power Property in Free Partially Commutative Monoids (Extended Abstract).	STACS	1994	DBLP DOI BibTeX RDF	trace monoids, finite power property, recognizability
39	Andreas Maletti	Myhill-Nerode Theorem for Recognizable Tree Series Revisited.	LATIN	2008	DBLP DOI BibTeX RDF
39	Rusins Freivalds	Languages Recognizable by Quantum Finite Automata.	CIAA	2005	DBLP DOI BibTeX RDF
39	Jean Berstel, Luc Boasson, Olivier Carton, Bruno Petazzoni, Jean-Eric Pin	Operations Preserving Recognizable Languages.	FCT	2003	DBLP DOI BibTeX RDF
39	Orna Kupferman, Nir Piterman, Moshe Y. Vardi	Model Checking Linear Properties of Prefix-Recognizable Systems.	CAV	2002	DBLP DOI BibTeX RDF
39	Andris Ambainis, Arnolds Kikusts, Maris Valdats	On the Class of Languages Recognizable by 1-Way Quantum Finite Automata.	STACS	2001	DBLP DOI BibTeX RDF
39	Manfred Droste, Paul Gastin	On Recognizable and Rational Formal Power Series in Partially Commuting Variables.	ICALP	1997	DBLP DOI BibTeX RDF
39	James Rogers	Strict LT2 : Regular : : Local : Recognizable.	LACL	1996	DBLP DOI BibTeX RDF
39	Henning Reineke	Subclasses of Recognizable Trace Languages.	Application and Theory of Petri Nets	1995	DBLP DOI BibTeX RDF
39	Damian Niwinski	On the Cardinality of Sets of Infinite Trees Recognizable by Finite Automata.	MFCS	1991	DBLP DOI BibTeX RDF
39	Volker Diekert, Paul Gastin, Antoine Petit 0001	Recognizable Complex Trace Languages.	MFCS	1991	DBLP DOI BibTeX RDF
39	Abdellatif Saoudi	Recognizable Infinite Tree Sets and their Complexity.	FSTTCS	1990	DBLP DOI BibTeX RDF	Büchi automata, Muller automata and Rabin automata, Tree automata
39	Antoine Petit 0001	Characterization of Recognizable Trace Languages by Distributed Automata (Extended Abstract).	MFCS	1989	DBLP DOI BibTeX RDF
38	Daniel Kirsten	An algebraic characterization of semirings for which the support of every recognizable series is recognizable.	Theor. Comput. Sci.	2014	DBLP DOI BibTeX RDF
38	Daniel Kirsten	The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable.	Acta Cybern.	2011	DBLP DOI BibTeX RDF
34	H. Geetha, D. Gnanaraj Thomas, T. Kalyani, T. Robinson 0001	Recognizability of Polyhexes by Tiling and Wang Systems.	ISVC (2)	2009	DBLP DOI BibTeX RDF	hexagonal picture languages, recognizable hexagonal picture languages, Polyominoes, Wang tiles
34	Amaury Habrard, José Oncina	Learning Multiplicity Tree Automata.	ICGI	2006	DBLP DOI BibTeX RDF	multiplicity tree automata, recognizable tree series, learning from equivalence and membership queries
34	Yves Métivier	An Algorithm for Computing Asynchronous Automata in the Case of Acyclic Non-Commutation Graphs.	ICALP	1987	DBLP DOI BibTeX RDF	partially commutative, asynchronous automaton, tree, Monoid, recognizable
30	Symeon Bozapalidis, Antonios Kalampakas	On the Complexity of the Syntax of Tree Languages.	CAI	2009	DBLP DOI BibTeX RDF
30	Andreas Maletti	Does o-Substitution Preserve Recognizability?	CIAA	2006	DBLP DOI BibTeX RDF
30	Hitoshi Ohsaki, Hiroyuki Seki, Toshinori Takai	Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism.	RTA	2003	DBLP DOI BibTeX RDF
30	Hitoshi Ohsaki	Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories.	CSL	2001	DBLP DOI BibTeX RDF	decidability, Tree automata, equational theory
30	Richard F. Bonner, Rusins Freivalds, Maksim Kravtsev	Quantum versus Probabilistic One-Way Finite Automata with Counter.	SOFSEM	2001	DBLP DOI BibTeX RDF
30	Daniel Kirsten	Some Undecidability Results Related to the Star Problem in Trace Monoids.	STACS	1999	DBLP DOI BibTeX RDF
30	Denis Lapoire	Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width.	STACS	1998	DBLP DOI BibTeX RDF
30	Yves Métivier, Gwénaël Richomme, Pierre-André Wacrenier	Computing the Closure of Sets of Words Under Partial Commutations.	ICALP	1995	DBLP DOI BibTeX RDF	Star Problem, trace monoids, rank, commutation, recognizability
30	Gwénaël Richomme	Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are Decidable.	MFCS	1994	DBLP DOI BibTeX RDF	trace monoids, Star Problem, Finite Power Property Problem, recognizability
30	Maryse Pelletier	Boolean Closure and Unambiguity of Rational Sets.	ICALP	1990	DBLP DOI BibTeX RDF
29	Karin Quaas	On the Supports of Recognizable Timed Series.	FORMATS	2009	DBLP DOI BibTeX RDF
29	Andreas Maletti	Learning Deterministically Recognizable Tree Series - Revisited.	CAI	2007	DBLP DOI BibTeX RDF
29	Jacques Duparc, Filip Murlak	On the Topological Complexity of Weakly Recognizable Tree Languages.	FCT	2007	DBLP DOI BibTeX RDF
29	Igor Fischer, Thorsten Herfet	Visual Document Authentication Using Human-Recognizable Watermarks.	ETRICS	2006	DBLP DOI BibTeX RDF
29	Emmanuel Godard, Yves Métivier, Anca Muscholl	Characterizations of Classes of Graphs Recognizable by Local Computations.	Theory Comput. Syst.	2004	DBLP DOI BibTeX RDF
29	Oded Maler, Amir Pnueli	On Recognizable Timed Languages.	FoSSaCS	2004	DBLP DOI BibTeX RDF
29	Bruno Courcelle	Recognizable Sets of Graphs, Hypergraphs and Relational Structures: A Survey.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
29	T. Kalyani, V. Rajkumar Dare, D. Gnanaraj Thomas	Local and Recognizable Iso Picture Languages.	ICONIP	2004	DBLP DOI BibTeX RDF
29	Björn Borchardt	The Myhill-Nerode Theorem for Recognizable Tree Series.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
29	Dietrich Kuske	Recognizable Sets of N-Free Pomsets Are Monadically Axiomatizable.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
29	Klaus Reinhardt	The #a = #b Pictures Are Recognizable.	STACS	2001	DBLP DOI BibTeX RDF
29	Oliver Matz	On Piecewise Testable, Starfree, and Recognizable Picture Languages.	FoSSaCS	1998	DBLP DOI BibTeX RDF
29	Gérard Cécé, Alain Finkel	Programs with Quasi-Stable Channels are Effectively Recognizable (Extended Abstract).	CAV	1997	DBLP DOI BibTeX RDF
29	Manfred Droste	A KLeene Theorem for Recognizable Languages over Concurrency Monoids.	ICALP	1994	DBLP DOI BibTeX RDF
29	Philippe Narbel	The Limit Set of Recognizable Substitution Systems.	STACS	1993	DBLP DOI BibTeX RDF
29	Roger Villemaire	Joining k- and l-Recognizable Sets of Natural Numbers.	STACS	1992	DBLP DOI BibTeX RDF
29	Jean Berstel, Christophe Reutenauer	Zeta Functions of Recognizable Languages.	ICALP	1988	DBLP DOI BibTeX RDF
29	Imre Simon	Recognizable Sets with Multiplicities in the Tropical Semiring.	MFCS	1988	DBLP DOI BibTeX RDF
24	Zoltán Fülöp 0001, Andreas Maletti, Heiko Vogler	A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Recognizable tree series, Rational tree series, Multioperator monoids, Semirings
24	Jean-Luc Coquidé, Max Dauchet, Rémi Gilleron, Sándor Vágvölgyi	Bottom-Up Tree Pushdown Automata and Rewrite Systems.	RTA	1991	DBLP DOI BibTeX RDF	Rewrite systems (=term rewrite systems), Church-Rosser (=confluent) systems, Noetherian systems, Convergent (=noetherian+confluent) systems, (Deterministic) tree automaton with pushdown store, (Recognizable, Context-free) tree languages
20	Sylvain Salvati	Recognizability in the Simply Typed Lambda-Calculus.	WoLLIC	2009	DBLP DOI BibTeX RDF
20	Bernard Boigelot, Julien Brusten, Jérôme Leroux	A Generalization of Semenov's Theorem to Automata over Real Numbers.	CADE	2009	DBLP DOI BibTeX RDF
20	Marcella Anselmo, Natasha Jonoska, Maria Madonia	Framed Versus Unframed Two-Dimensional Languages.	SOFSEM	2009	DBLP DOI BibTeX RDF
20	Barbara Klunder	Characterization of Star-Connected Languages Using Finite Automata.	LATA	2008	DBLP DOI BibTeX RDF
20	Dietrich Kuske, Ingmar Meinecke	Construction of Tree Automata from Regular Expressions.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
20	Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Touili	On the Reachability Analysis of Acyclic Networks of Pushdown Systems.	CONCUR	2008	DBLP DOI BibTeX RDF
20	H. J. Sander Bruggink, Barbara König 0001	On the Recognizability of Arrow and Graph Languages.	ICGT	2008	DBLP DOI BibTeX RDF
20	Antonios Kalampakas	The Syntactic Complexity of Eulerian Graphs.	CAI	2007	DBLP DOI BibTeX RDF
20	Marcella Anselmo, Maria Madonia	Deterministic Two-Dimensional Languages over One-Letter Alphabet.	CAI	2007	DBLP DOI BibTeX RDF	Determinism, Automata and Formal Languages, Two-dimensional languages
20	Aleksandrs Belovs, Ansis Rosmanis, Juris Smotrovs	Multi-letter Reversible and Quantum Finite Automata.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
20	Siamak Nazari, John G. Thistle	Structural Conditions for Model-checking of Parameterized Networks.	ACSD	2007	DBLP DOI BibTeX RDF
20	Maki Terai, Jun Fujiki, Reiji Tsuruno, Kiyoshi Tomimatsu	Magical Tile.	Smart Graphics	2007	DBLP DOI BibTeX RDF
20	Liliana Cojocaru	Branching Programs, Grammar Systems and the NC1 Class.	SYNASC	2007	DBLP DOI BibTeX RDF
20	Symeon Bozapalidis, Antonios Kalampakas	Recognizability of graph and pattern languages.	Acta Informatica	2006	DBLP DOI BibTeX RDF
20	Benjamin Aminof, Orna Kupferman	On the Succinctness of Nondeterminism.	ATVA	2006	DBLP DOI BibTeX RDF
20	Sven Schewe	Synthesis for Probabilistic Environments.	ATVA	2006	DBLP DOI BibTeX RDF
20	Marcella Anselmo, Maria Madonia	Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata .	CIAA	2005	DBLP DOI BibTeX RDF
20	Karianto Wong	Adding Monotonic Counters to Automata and Transition Graphs.	Developments in Language Theory	2005	DBLP DOI BibTeX RDF
20	Daniel A. Keim, Stephen C. North, Christian Panse	CartoDraw: A Fast Algorithm for Generating Contiguous Cartograms.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF	visualization of geo-related information, continuous cartograms, value-by-area cartograms, visualization and cartography, Information visualization
20	Andrew Vande Moere	Information Flocking: Time-Varying Data Visualization using Boid Behaviors.	IV	2004	DBLP DOI BibTeX RDF
20	Janne V. Kujala, Tuomas J. Lukka	Rendering recognizably unique textures.	IV	2003	DBLP DOI BibTeX RDF
20	Bongwon Suh, Haibin Ling, Benjamin B. Bederson, David W. Jacobs	Automatic thumbnail cropping and its effectiveness.	UIST	2003	DBLP DOI BibTeX RDF	image cropping, face detection, visual search, zoomable user interfaces, usability study, saliency map, thumbnail
20	Rodica Ceterchi, Radu Gramatovici, Natasa Jonoska	Tiling Rectangular Pictures with P Systems.	Workshop on Membrane Computing	2003	DBLP DOI BibTeX RDF
20	Tanguy Urvoy	Abstract Families of Graphs.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
20	Pierre B. A. Lecomte, Michel Rigo	Numeration Systems on a Regular Language.	Theory Comput. Syst.	2001	DBLP DOI BibTeX RDF
20	Daniel Kirsten	The Star Problem in Trace Monoids: Reductions Beyond C4.	ICALP	2001	DBLP DOI BibTeX RDF
20	Juraj Hromkovic, Georg Schnitger	On the Power of Randomized Pushdown Automata.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF