Search results for "automata"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
28	Patricia Bouyer, Thomas Brihaye, Marcin Jurdzinski, Ranko Lazic 0001, Michal Rutkowski	Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets.	FORMATS	2008	DBLP DOI BibTeX RDF
28	Marcin Jurdzinski, Ashutosh Trivedi 0001	Concavely-Priced Timed Automata.	FORMATS	2008	DBLP DOI BibTeX RDF
28	Rob J. van Glabbeek, Bas Ploeger	Five Determinisation Algorithms.	CIAA	2008	DBLP DOI BibTeX RDF
28	Hosna Jabbari, Jon C. Muzio, Lin Sun	A New Class of Cellular Automata.	DSD	2007	DBLP DOI BibTeX RDF
28	Patrick Chervet, Igor Walukiewicz	Minimizing Variants of Visibly Pushdown Automata.	MFCS	2007	DBLP DOI BibTeX RDF
28	Benedek Nagy	On 5' --> 3' Sensing Watson-Crick Finite Automata.	DNA	2007	DBLP DOI BibTeX RDF
28	Parosh Aziz Abdulla, Joël Ouaknine, Karin Quaas, James Worrell 0001	Zone-Based Universality Analysis for Single-Clock Timed Automata.	FSEN	2007	DBLP DOI BibTeX RDF
28	Hartmut Messerschmidt, Friedrich Otto	Strictly Deterministic CD-Systems of Restarting Automata.	FCT	2007	DBLP DOI BibTeX RDF
28	Laura Bozzelli	Alternating Automata and a Temporal Fixpoint Calculus for Visibly Pushdown Languages.	CONCUR	2007	DBLP DOI BibTeX RDF
28	Sara Adams, Joël Ouaknine, James Worrell 0001	Undecidability of Universality for Timed Automata with Minimal Resources.	FORMATS	2007	DBLP DOI BibTeX RDF
28	Xian Xu 0001	P Systems and Finite Automata.	CISIS	2007	DBLP DOI BibTeX RDF
28	Stéphane Demri, Ranko Lazic 0001	LTL with the Freeze Quantifier and Register Automata.	LICS	2006	DBLP DOI BibTeX RDF
28	Ewa Dudek-Dyduch, Jaroslaw Was	Knowledge Representation of Pedestrian Dynamics in Crowd: Formalism of Cellular Automata.	ICAISC	2006	DBLP DOI BibTeX RDF
28	Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron	Tree Automata with Equality Constraints Modulo Equational Theories.	IJCAR	2006	DBLP DOI BibTeX RDF
28	Peter Vrancx, Katja Verbeeck, Ann Nowé	Analyzing Stigmergetic Algorithms Through Automata Games.	KDECB	2006	DBLP DOI BibTeX RDF
28	Orna Kupferman, Sarai Sheinvald-Faragy	Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite Words.	CONCUR	2006	DBLP DOI BibTeX RDF
28	Olga Grinchtein, Bengt Jonsson 0001, Paul Pettersson	Inference of Event-Recording Automata Using Timed Decision Trees.	CONCUR	2006	DBLP DOI BibTeX RDF
28	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
28	Jirí Wiedermann	Globular Universe and Autopoietic Automata: A Framework for Artificial Life.	ECAL	2005	DBLP DOI BibTeX RDF
28	Christel Baier, Marcus Größer	Recognizing omega-regular Languages with Probabilistic Automata.	LICS	2005	DBLP DOI BibTeX RDF
28	Tomasz Jurdzinski, Friedrich Otto	Shrinking Restarting Automata.	MFCS	2005	DBLP DOI BibTeX RDF
28	Nazim Fatès, Michel Morvan, Nicolas Schabanel, Eric Thierry	Fully Asynchronous Behavior of Double-Quiescent Elementary Cellular Automata.	MFCS	2005	DBLP DOI BibTeX RDF
28	Junna Kuramochi, Yasubumi Sakakibara	Intensive In Vitro Experiments of Implementing and Executing Finite Automata in Test Tube.	DNA	2005	DBLP DOI BibTeX RDF
28	Shuichi Inokuchi, Kazumasa Honda, Hyen Yeal Lee, Tatsuro Sato, Yoshihiro Mizoguchi, Yasuo Kawahara	On Reversible Cellular Automata with Finite Cell Array.	UC	2005	DBLP DOI BibTeX RDF
28	Raffaella Gentilini	Reachability Problems on Extended O-Minimal Hybrid Automata.	FORMATS	2005	DBLP DOI BibTeX RDF
28	Felix Klaedtke	On the Automata Size for Presburger Arithmetic.	LICS	2004	DBLP DOI BibTeX RDF
28	Thomas Schwentick	Trees, Automata and XML. (PDF / PS)	PODS	2004	DBLP DOI BibTeX RDF
28	Rajeev Alur, P. Madhusudan	Decision Problems for Timed Automata: A Survey.	SFM	2004	DBLP DOI BibTeX RDF
28	Kumar Neeraj Verma	Alternation in Equational Tree Automata Modulo XOR.	FSTTCS	2004	DBLP DOI BibTeX RDF
28	Thomas Brihaye, Véronique Bruyère, Jean-François Raskin	Model-Checking for Weighted Timed Automata.	FORMATS/FTRTFT	2004	DBLP DOI BibTeX RDF
28	Marco Mamei, Andrea Roli, Franco Zambonelli	Dissipative Cellular Automata As Minimalist Distributed Systems: A Study On Emergent Behaviors.	PDP	2003	DBLP DOI BibTeX RDF
28	Julien Carme, Rémi Gilleron, Aurélien Lemay, Alain Terlutte, Marc Tommasi	Residual Finite Tree Automata.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
28	Andreas Malcher	Minimizing Finite Automata Is Computationally Hard.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
28	Jan Hladik, Ulrike Sattler	A Translation of Looping Alternating Automata into Description Logics.	CADE	2003	DBLP DOI BibTeX RDF
28	Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segala, Frits W. Vaandrager	Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems.	RTSS	2003	DBLP DOI BibTeX RDF
28	Marta Z. Kwiatkowska, Gethin Norman, David Parker 0001, Jeremy Sproston	Performance Analysis of Probabilistic Timed Automata Using Digital Clocks.	FORMATS	2003	DBLP DOI BibTeX RDF
28	Kyubum Wee, Byungeun Moon	Automatic Generation of Finite State Automata for Detecting Intrusions Using System Call Sequences.	MMM-ACNS	2003	DBLP DOI BibTeX RDF
28	Huimin Lin, Wang Yi 0001	Axiomatising timed automata.	Acta Informatica	2002	DBLP DOI BibTeX RDF
28	Tatjana Petkovic, Miroslav Ciric 0001, Stojan Bogdanovic	Characteristic Semigroups of Directable Automata.	Developments in Language Theory	2002	DBLP DOI BibTeX RDF
28	Daniele Morano, Leonardo Maria Reyneri	An Application of Fuzzy State Automata: Motion Control of an Hexapod Walking Machine.	IWANN (2)	2001	DBLP DOI BibTeX RDF
28	Martin Fränzle	What Will Be Eventually True of Polynomial Hybrid Automata?	TACS	2001	DBLP DOI BibTeX RDF	State recurrence, Progress properties, Verification procedures, Hybrid systems, Decidability
28	Giovanni Pighizzini	Unary Pushdown Automata and Auxiliary Space Lower Bounds.	MFCS	2000	DBLP DOI BibTeX RDF
28	Holger Petersen 0001	Separation Results for Rebound Automata.	MFCS	2000	DBLP DOI BibTeX RDF
28	Hiroaki Yamamoto	An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions.	MFCS	2000	DBLP DOI BibTeX RDF
28	Andrei Paun, Mihaela Paun	State and Transition Complexity of Watson-Crick Finite Automata.	FCT	1999	DBLP DOI BibTeX RDF
28	Alongkrit Chutinan, Bruce H. Krogh	Computing Approximating Automata for a Class of Linear Hybrid Systems.	Hybrid Systems	1997	DBLP DOI BibTeX RDF
28	Gianpiero Cattaneo, Michele Finelli, Luciano Margara	Topological Chaos for Elementary Cellular Automata.	CIAC	1997	DBLP DOI BibTeX RDF
28	Béatrice Bérard, Paul Gastin, Antoine Petit 0001	On the Power of Non-Observable Actions in Timed Automata.	STACS	1996	DBLP DOI BibTeX RDF
28	Nils Klarlund, Madhavan Mukund, Milind A. Sohoni	Determinizing Büchi Asnchronous Automata.	FSTTCS	1995	DBLP DOI BibTeX RDF
28	Rajeev Alur, Limor Fix, Thomas A. Henzinger	A Determinizable Class of Timed Automata.	CAV	1994	DBLP DOI BibTeX RDF
28	Orna Bernholtz, Orna Grumberg	Branching Time Temporal Logic and Amorphous Tree Automata.	CONCUR	1993	DBLP DOI BibTeX RDF
28	Eric Goubault, Thomas P. Jensen	Homology of Higher Dimensional Automata.	CONCUR	1992	DBLP DOI BibTeX RDF
28	Yaniv Bargury, Johann A. Makowsky	The Expressive Power of Transitive Closue and 2-way Multihead Automata.	CSL	1991	DBLP DOI BibTeX RDF
28	Eugene W. Stark	On the Relations Computable by a Class of Concurrent Automata.	POPL	1990	DBLP DOI BibTeX RDF
28	Edmund M. Clarke, Anca Browne, Robert P. Kurshan	A Unified Approach For Showing Language Containment And Equivalence Between Various Types Of Omega-Automata.	CAAP	1990	DBLP DOI BibTeX RDF
28	Helmut Seidl	Deciding Equivalence of Finite Tree Automata.	STACS	1989	DBLP DOI BibTeX RDF
28	Zohar Manna, Amir Pnueli	Specification and Verification of Concurrent Programs By Forall-Automata.	POPL	1987	DBLP DOI BibTeX RDF
28	Arthur C. Fleck	Isomorphism Groups of Automata.	J. ACM	1962	DBLP DOI BibTeX RDF
26	Thoralf Räsch	Introduction to Guarded Logics.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
26	Philipp Rohde	Expressive Power of Monadic Second-Order Logic and Modal µ-Calculus.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
26	Mark Weyer	Decidability of S1S and S2S.	Automata, Logics, and Infinite Games	2001	DBLP DOI BibTeX RDF
26	Christoph Scheben	Simulation of d'-Dimensional Cellular Automata on d-Dimensional Cellular Automata.	ACRI	2006	DBLP DOI BibTeX RDF
26	Jan Procházka	Compiler Generator Based on Restarting Automata.	CIAA	2009	DBLP DOI BibTeX RDF	restarting automata, semantics, compiler-compiler
26	Rupsa Chakraborty, Dipanwita Roy Chowdhury	coreBIST: A Cellular Automata Based Core for Self Testing System-on-Chips.	ACRI	2008	DBLP DOI BibTeX RDF	Response-Analyzer, Built-in self-test, System-on-Chip, Cellular Automata, Test-Pattern-Generator
26	Jaydeb Bhaumik, Dipanwita Roy Chowdhury, Indrajit Chakrabarti	An Improved Double Byte Error Correcting Code Using Cellular Automata.	ACRI	2008	DBLP DOI BibTeX RDF	Byte Error Correcting Code, RS Code and VLSI, Cellular Automata
26	Sukanta Das, Chandrama Shaw, Biplab K. Sikdar	Exploring CAState Space to Synthesize Cellular Automata with Specified Attractor Set.	ACRI	2008	DBLP DOI BibTeX RDF	Nonlinear cellular automata, MACA, PE bit, classifier, attractor
26	Sourav Das, Dipanwita Roy Chowdhury	An Efficient n×nBoolean Mapping Using Additive Cellular Automata.	ACRI	2008	DBLP DOI BibTeX RDF	Additive Cellular Automata, Pseudo-Random Number Generator
26	Miroslaw Szaban, Franciszek Seredynski	Cryptographically Strong S-Boxes Based on Cellular Automata.	ACRI	2008	DBLP DOI BibTeX RDF	Cryptography, Boolean Functions, Cellular Automata, Block Cipher, S-Boxes
26	Anne Bergeron, Riccardo Catalano	Analysis of Reactive Systems with n Timers.	WIA	1999	DBLP DOI BibTeX RDF	real-time systems, verification, synthesis, automata
26	Géraud Sénizergues	The Equivalence Problem for Deterministic Pushdown Automata is Decidable.	ICALP	1997	DBLP DOI BibTeX RDF	deterministic pushdown automata, finite dimensional vector spaces, matrix semigroups, complete formal systems, rational series
26	Sicco Verwer, Mathijs de Weerdt, Cees Witteveen	One-Clock Deterministic Timed Automata Are Efficiently Identifiable in the Limit.	LATA	2009	DBLP DOI BibTeX RDF
26	Hermann Gruber, Markus Holzer 0001, Michael Tautschnig	Short Regular Expressions from Finite Automata: Empirical Results.	CIAA	2009	DBLP DOI BibTeX RDF
26	Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar	Composed Bisimulation for Tree Automata.	CIAA	2008	DBLP DOI BibTeX RDF
26	Pawel Topa	Dynamically Reorganising Vascular Networks Modelled Using Cellular Automata Approach.	ACRI	2008	DBLP DOI BibTeX RDF
26	Bastien Chopard, Jean-Luc Falcone, Ranaivo Mahaleo Razakanirina, Alfons G. Hoekstra, Alfonso Caiazzo	On the Collision-Propagation and Gather-Update Formulations of a Cellular Automata Rule.	ACRI	2008	DBLP DOI BibTeX RDF
26	Norio Konno	Quantum Walks and Quantum Cellular Automata.	ACRI	2008	DBLP DOI BibTeX RDF	quantum cellular automaton, stochastic cellular automaton, quantum walk
26	Karianto Wong, Christof Löding	Unranked Tree Automata with Sibling Equalities and Disequalities.	ICALP	2007	DBLP DOI BibTeX RDF
26	Marcin Jurdzinski, Ashutosh Trivedi 0001	Reachability-Time Games on Timed Automata.	ICALP	2007	DBLP DOI BibTeX RDF
26	Patricia Bouyer, Serge Haddad, Pierre-Alain Reynier	Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences.	ICALP (2)	2006	DBLP DOI BibTeX RDF
26	Martin Simunek, Borivoj Melichar	Borders and Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
26	Pavlos Antoniou, Jan Holub 0001, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo	Finding Common Motifs with Gaps Using Finite Automata.	CIAA	2006	DBLP DOI BibTeX RDF
26	Roderick Bloem, Alessandro Cimatti, Ingo Pill, Marco Roveri, Simone Semprini	Symbolic Implementation of Alternating Automata.	CIAA	2006	DBLP DOI BibTeX RDF
26	Jonathan May, Kevin Knight	Tiburon: A Weighted Tree Automata Toolkit.	CIAA	2006	DBLP DOI BibTeX RDF
26	Marta Pla-Castells, Ignacio García-Fernández, Rafael J. Martínez	Interactive Terrain Simulation and Force Distribution Models in Sand Piles.	ACRI	2006	DBLP DOI BibTeX RDF
26	Teodor Knapik, Damian Niwinski, Pawel Urzyczyn, Igor Walukiewicz	Unsafe Grammars and Panic Automata.	ICALP	2005	DBLP DOI BibTeX RDF
26	Rusins Freivalds	Languages Recognizable by Quantum Finite Automata.	CIAA	2005	DBLP DOI BibTeX RDF
26	Tadahiro Suda, Haruo Hosoya	Non-backtracking Top-Down Algorithm for Checking Tree Automata Containment.	CIAA	2005	DBLP DOI BibTeX RDF
26	Tomasz Jurdzinski, Friedrich Otto	Restricting the Use of Auxiliary Symbols for Restarting Automata.	CIAA	2005	DBLP DOI BibTeX RDF
26	Mikolaj Bojanczyk, Thomas Colcombet	Tree-Walking Automata Cannot Be Determinized.	ICALP	2004	DBLP DOI BibTeX RDF
26	Vladimir A. Zakharov, Ivan Zakharyaschev	On the Equivalence-Checking Problem for a Model of Programs Related with Multi-tape Automata.	CIAA	2004	DBLP DOI BibTeX RDF
26	Jean-Michel Couvreur	A BDD-Like Implementation of an Automata Package.	CIAA	2004	DBLP DOI BibTeX RDF
26	Tomás Polcar, Borivoj Melichar	Two-Dimensional Pattern Matching by Two-Dimensional Online Tessellation Automata.	CIAA	2004	DBLP DOI BibTeX RDF
26	Markus Holzer 0001, Martin Kutrib	Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.	ICALP	2003	DBLP DOI BibTeX RDF
26	Nathan Preston, Mukkai S. Krishnamoorthy	AVA: An Applet for Visualizing FRACTRAN and Other Automata.	CIAA	2003	DBLP DOI BibTeX RDF
26	Michael T. Grinder	Animating automata: a cross-platform program for teaching finite automata.	SIGCSE	2002	DBLP DOI BibTeX RDF
26	Klaus Sutner	Reduced Power Automata.	CIAA	2002	DBLP DOI BibTeX RDF
26	Constantinos Bartzis, Tevfik Bultan	Automata-Based Representations for Arithmetic Constraints in Automated Verification.	CIAA	2002	DBLP DOI BibTeX RDF
26	Hubert Comon, Véronique Cortier, John Mitchell	Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols.	ICALP	2001	DBLP DOI BibTeX RDF
26	Yuri Velinov	On the Software Design of Cellular Automata Simulators for Ecological Modeling.	CIAA	2001	DBLP DOI BibTeX RDF
26	Zhe Dang, Tevfik Bultan, Oscar H. Ibarra, Richard A. Kemmerer	Past Pushdown Timed Automata.	CIAA	2001	DBLP DOI BibTeX RDF