Search results for "Pushdown automata"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
3	Matthew Hague, Andrzej S. Murawski, C.-H. Luke Ong, Olivier Serre	Collapsible Pushdown Automata and Recursion Schemes.	LICS	2008	DBLP DOI BibTeX RDF	Higher-order pushdown automata, game semantics, higher-order recursion schemes
3	Viraj Kumar, P. Madhusudan, Mahesh Viswanathan	Visibly pushdown automata for streaming XML.	WWW	2007	DBLP DOI BibTeX RDF	XML, query, typing, schema, streaming algorithms, pushdown automata
3	Martin Kutrib, Andreas Malcher, Larissa Werlein	Regulated Nondeterminism in Pushdown Automata.	CIAA	2007	DBLP DOI BibTeX RDF	regulated nondeterminism, limited nondeterminism, pushdown automata, closure properties
3	Jianliang Xu, Yun-Xia Liu, Tsunehiro Yoshinaga	A Note on Non-Closure Property of Sublogarithmic Space-Bounded 1-Inkdot Alternating Pushdown Automata with Only Existential (Universal) States.	J. Comput. Sci. Technol.	2006	DBLP DOI BibTeX RDF	alternating pushdown automata, 1-inkdot, sublogarithmic space, closure property
3	Juraj Hromkovic, Georg Schnitger	Pushdown Automata and Multicounter Machines, a Comparison of Computation Modes.	ICALP	2003	DBLP DOI BibTeX RDF	multicounter machines, randomization, nondeterminism, complexity theory, pushdown automata
3	Richard Mayr	On the Complexity of Bisimulation Problems for Pushdown Automata.	IFIP TCS	2000	DBLP DOI BibTeX RDF	verification, complexity, bisimulation, Pushdown automata
3	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
3	Tirza Hirst, David Harel	On the Power of Bounded Concurrency II: Pushdown Automata.	J. ACM	1994	DBLP DOI BibTeX RDF	cooperative concurrency, pushdown automata, succinctness
2	Tomás Flouri, Borivoj Melichar, Jan Janousek	Aho-Corasick like multiple subtree matching by pushdown automata.	SAC	2010	DBLP DOI BibTeX RDF	subtree matching, pattern matching, tree, pushdown automata, subtree
2	Eric Allender, Klaus-Jörn Lange	Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata.	IEEE Conference on Computational Complexity	2010	DBLP DOI BibTeX RDF	Symmetric Computation, Auxiliary Pushdown Automata, LogCFL, Reversible Computation
2	Tomasz Jurdzinski	Probabilistic Length-Reducing Two-Pushdown Automata.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF
2	Jianliang Xu, Jian-liang Wang	Sublogarithmic Space-bounded Multi-inkdot Alternating Pushdown Automata with Only Existential (Universal) States.	JCAI	2009	DBLP DOI BibTeX RDF	alternating pushdown automata, multi-inkdot, sublogarithmic space, closure property, incomparability
2	Nutan Limaye, Meena Mahajan	Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata.	LATA	2009	DBLP DOI BibTeX RDF
2	Mohamed Hamada	Pushdown Automata Simulator.	Edutainment	2009	DBLP DOI BibTeX RDF
2	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
2	Nguyen Van Tang, Mizuhito Ogawa	Event-Clock Visibly Pushdown Automata.	SOFSEM	2009	DBLP DOI BibTeX RDF
2	Nutan Limaye, Meena Mahajan, Antoine Meyer	On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.	CSR	2008	DBLP DOI BibTeX RDF
2	Tamar Aizikowitz, Michael Kaminski	Conjunctive Grammars and Alternating Pushdown Automata.	WoLLIC	2008	DBLP DOI BibTeX RDF
2	Tomás Brázdil, Václav Brozek, Jan Holecek, Antonín Kucera	Discounted Properties of Probabilistic Pushdown Automata.	LPAR	2008	DBLP DOI BibTeX RDF
2	Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl	Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF
2	Giovanni Pighizzini	Deterministic Pushdown Automata and Unary Languages.	CIAA	2008	DBLP DOI BibTeX RDF
2	Petr Jancar, Jirí Srba	Undecidability of bisimilarity by defender's forcing.	J. ACM	2008	DBLP DOI BibTeX RDF	process algebra, undecidability, pushdown automata, Bisimilarity
2	Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H. Luke Ong, Olivier Serre	Winning Regions of Higher-Order Pushdown Games.	LICS	2008	DBLP DOI BibTeX RDF	higher-order pushdown automata, mu-calculus model-checking, parity games, higher-order recursion schemes
2	Viliam Geffert, Carlo Mereghetti, Beatrice Palano	More Concise Representation of Regular Languages by Automata and Regular Expressions.	Developments in Language Theory	2008	DBLP DOI BibTeX RDF	regular expressions, descriptional complexity, Pushdown automata, straight line programs
2	Amashini Naidoo, Nelishia Pillay	Evolving pushdown automata.	SAICSIT Conf.	2007	DBLP DOI BibTeX RDF	genetic programming, grammatical inference
2	C.-H. Luke Ong	Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes.	MFCS	2007	DBLP DOI BibTeX RDF
2	Dirk Nowotka, Jirí Srba	Height-Deterministic Pushdown Automata.	MFCS	2007	DBLP DOI BibTeX RDF
2	Patrick Chervet, Igor Walukiewicz	Minimizing Variants of Visibly Pushdown Automata.	MFCS	2007	DBLP DOI BibTeX RDF
2	Dario Carotenuto, Aniello Murano, Adriano Peron	2-Visibly Pushdown Automata.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF
2	Géraud Sénizergues	Sequences of Level 1, 2, 3, ..., k , ...	CSR	2007	DBLP DOI BibTeX RDF	Iterated pushdown automata, recurrent sequences equivalence problems
2	Andreas Malcher, Giovanni Pighizzini	Descriptional Complexity of Bounded Context-Free Languages.	Developments in Language Theory	2007	DBLP DOI BibTeX RDF	finite-turn pushdown automata, recursive trade-offs, bounded languages, descriptional complexity, automata and formal languages
2	Alexander Meduna	Deep pushdown automata.	Acta Inf.	2006	DBLP DOI BibTeX RDF
2	Martin Kutrib, Andreas Malcher	Context-Dependent Nondeterminism for Pushdown Automata.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
2	Didier Caucal	Synchronization of Pushdown Automata.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
2	Jirí Srba	Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation.	CSL	2006	DBLP DOI BibTeX RDF
2	H. Venkateswaran	Derandomization of Probabilistic Auxiliary Pushdown Automata Classes.	IEEE Conference on Computational Complexity	2006	DBLP DOI BibTeX RDF
2	Hyungwoo Kang, Kibom Kim, Soon Jwa Hong, Dong Hoon Lee	A Model for Security Vulnerability Pattern.	ICCSA	2006	DBLP DOI BibTeX RDF	Abstract Syntax Tree (AST), Static analysis, Buffer overflow, Software security, Pushdown Automata (PDA)
2	Tomás Brázdil, Antonín Kucera, Oldrich Strazovský	On the Decidability of Temporal Properties of Probabilistic Pushdown Automata.	STACS	2005	DBLP DOI BibTeX RDF
2	Markus Holzer, Friedrich Otto	Shrinking Multi-pushdown Automata.	FCT	2005	DBLP DOI BibTeX RDF
2	Javier Esparza, Antonín Kucera, Richard Mayr	Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances.	LICS	2005	DBLP DOI BibTeX RDF
2	Henning Bordihn, Markus Holzer, Martin Kutrib	Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.	Developments in Language Theory	2004	DBLP DOI BibTeX RDF
2	Masaki Nakanishi	On the Power of One-Sided Error Quantum Pushdown Automata with Classical Stack Operations.	COCOON	2004	DBLP DOI BibTeX RDF
2	Javier Esparza, Antonín Kucera, Richard Mayr	Model Checking Probabilistic Pushdown Automata.	LICS	2004	DBLP DOI BibTeX RDF
2	Michal Armoni, Judith Gal-Ezer	On the achievements of high school students studying computational models.	ITiCSE	2004	DBLP DOI BibTeX RDF	computer-related background, mathematics level, computational model, finite automata, turing machines, pushdown automata
2	Rajeev Alur, P. Madhusudan	Visibly pushdown languages.	STOC	2004	DBLP DOI BibTeX RDF	?-languages, verification, logic, context-free languages, pushdown automata, regular tree languages
2	Olivier Serre	Games with Winning Conditions of High Borel Complexity.	ICALP	2004	DBLP DOI BibTeX RDF	Borel Complexity, Pushdown Automata, Two-player Games
2	Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Victor Mitrana	Teams of Pushdown Automata.	Ershov Memorial Conference	2003	DBLP DOI BibTeX RDF
2	Markus Holzer, Martin Kutrib	Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.	ICALP	2003	DBLP DOI BibTeX RDF
2	Thierry Cachat	Higher Order Pushdown Automata, the Caucal Hierarchy of Graphs and Parity Games.	ICALP	2003	DBLP DOI BibTeX RDF
2	Erzsébet Csuhaj-Varjú, Victor Mitrana, György Vaszil	Distributed Pushdown Automata Systems: Computational Power.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
2	Markus Holzer, Martin Kutrib	Flip-Pushdown Automata: Nondeterminism Is Better than Determinism.	Developments in Language Theory	2003	DBLP DOI BibTeX RDF
2	Arnaud Carayol, Stefan Wöhrle	The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata.	FSTTCS	2003	DBLP DOI BibTeX RDF
2	Géraud Sénizergues	The Equivalence Problem for t-Turn DPDA Is Co-NP.	ICALP	2003	DBLP DOI BibTeX RDF	deterministic pushdown automata, matrix semi-groups, complexity, equivalence problem
2	Antonín Kucera, Richard Mayr	On the Complexity of Semantic Equivalences for Pushdown Automata and BPA.	MFCS	2002	DBLP DOI BibTeX RDF
2	Jennifer McDonald	Interactive Pushdown Automata Animation.	SIGCSE	2002	DBLP DOI BibTeX RDF
2	Juraj Hromkovic, Georg Schnitger	On the Power of Randomized Pushdown Automata.	Developments in Language Theory	2001	DBLP DOI BibTeX RDF
2	Massimiliano Goldwurm, Beatrice Palano, Massimo Santini	On the Circuit Complexity of Random Generation Problems for Regular and Context-Free Languages.	STACS	2001	DBLP DOI BibTeX RDF	Uniform random generation, ambiguous context-free languages, auxiliary pushdown automata, circuit complexity
2	Giovanni Pighizzini	Unary Pushdown Automata and Auxiliary Space Lower Bounds.	MFCS	2000	DBLP DOI BibTeX RDF
2	Marats Golovkins	Quantum Pushdown Automata.	SOFSEM	2000	DBLP DOI BibTeX RDF
2	Alberto Bertoni, Massimiliano Goldwurm, Massimo Santini	Random Generation and Approximate Counting of Ambiguously Described Combinatorial Structures.	STACS	2000	DBLP DOI BibTeX RDF	uniform random generation, auxiliary pushdown automata, rational trace languages, inherent ambiguity, context-free languages, approximate counting
2	Oscar H. Ibarra, Tao Jiang, Nicholas Q. Trân, Hui Wang 0008	On the Equivalence of Two-way Pushdown Automata and Counter Machines over Bounded Languages.	STACS	1993	DBLP DOI BibTeX RDF
2	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
2	Tirza Hirst, David Harel	On the Power of Bounded Concurrency II: The Pushdown Automata Level.	CAAP	1990	DBLP DOI BibTeX RDF
2	V. Vinay, V. Chandru	The Expressibility of Nondeterministic Auxiliary Stack Automata and its Relation to Treesize Bounded Alternating Auxiliary Pushdown Automata.	FSTTCS	1990	DBLP DOI BibTeX RDF
2	Birgit Jenner, Bernd Kirsig	Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown Automata.	STACS	1988	DBLP DOI BibTeX RDF
2	Ivan Hal Sudborough	Time and Tape Bounded Auxiliary Pushdown Automata.	MFCS	1977	DBLP DOI BibTeX RDF
1	Xiuhong Guo	A comment on "Automata theory based on complete residuated lattice-valued logic: Pushdown automata".	Fuzzy Sets and Systems	2012	DBLP DOI BibTeX RDF
1	Oscar H. Ibarra, Nicholas Q. Trân	Weak Synchronization and Synchronizability of Multitape Pushdown Automata and Turing Machines.	LATA	2012	DBLP DOI BibTeX RDF
1	Nguyen Van Tang, Hitoshi Ohsaki	On Model Checking for Visibly Pushdown Automata.	LATA	2012	DBLP DOI BibTeX RDF
1	Pavol Duris, Marek Kosta	Flip-Pushdown Automata with k Pushdown Reversals and E0L Systems are Incomparable.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Changwook Kim	Quasi-rocking real-time pushdown automata.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Nguyen Van Tang, Hitoshi Ohsaki	Checking On-the-Fly Universality and Inclusion Problems of Visibly Pushdown Automata.	IEICE Transactions	2011	DBLP BibTeX RDF
1	Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil	Blackhole Pushdown Automata.	Fundam. Inform.	2011	DBLP DOI BibTeX RDF
1	Tamar Aizikowitz, Michael Kaminski	LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata.	CSR	2011	DBLP DOI BibTeX RDF
1	Fevzi Belli, Mutlu Beyazit, Tomohiko Takagi, Zengo Furukawa	Mutation Testing of "Go-Back" Functions Based on Pushdown Automata.	ICST	2011	DBLP DOI BibTeX RDF
1	Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis	Tree Indexing by Pushdown Automata and Repeats of Subtrees.	FedCSIS	2011	DBLP BibTeX RDF
1	Jan Travnicek, Jan Janousek, Borivoj Melichar	Nonlinear Tree Pattern Pushdown Automata.	FedCSIS	2011	DBLP BibTeX RDF
1	Martin Plicka, Jan Janousek, Borivoj Melichar	Subtree Oracle Pushdown Automata for Ranked and Unranked Ordered Trees.	FedCSIS	2011	DBLP BibTeX RDF
1	David Hopkins, Andrzej S. Murawski, C.-H. Luke Ong	A Fragment of ML Decidable by Visibly Pushdown Automata.	ICALP	2011	DBLP DOI BibTeX RDF
1	Pierre-Cyrille Héam, Catherine Masson	A Random Testing Approach Using Pushdown Automata.	TAP	2011	DBLP DOI BibTeX RDF
1	Alexander Okhotin, Kai Salomaa	State Complexity of Operations on Input-Driven Pushdown Automata.	MFCS	2011	DBLP DOI BibTeX RDF
1	Pawel Parys	Collapse Operation Increases Expressive Power of Deterministic Higher Order Pushdown Automata.	STACS	2011	DBLP DOI BibTeX RDF
1	Nuri Tasdemir, A. C. Cem Say	Models of Pushdown Automata with Reset.	Developments in Language Theory	2011	DBLP DOI BibTeX RDF
1	Werner Kuich	Algebraic Systems and Pushdown Automata.	Algebraic Foundations in Computer Science	2011	DBLP DOI BibTeX RDF
1	Benedek Nagy, Friedrich Otto, Marcel Vollweiler	Pushdown Automata with Translucent Pushdown Symbols.	NCMA	2011	DBLP BibTeX RDF
1	Martin Cermák, Alexander Meduna	n-Accepting Restricted Pushdown Automata Systems.	AFL	2011	DBLP BibTeX RDF
1	Andreas Malcher, Carlo Mereghetti, Beatrice Palano	Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals.	DCFS	2011	DBLP DOI BibTeX RDF
1	Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti, Beatrice Palano	The Size-Cost of Boolean Operations on Constant Height Deterministic Pushdown Automata.	DCFS	2011	DBLP DOI BibTeX RDF
1	Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis	Tree Template Matching in Ranked Ordered Trees by Pushdown Automata.	CIAA	2011	DBLP DOI BibTeX RDF
1	Hongfei Fu, Joost-Pieter Katoen	Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems.	FSTTCS	2011	DBLP DOI BibTeX RDF
1	Tomás Flouri, Jan Janousek, Borivoj Melichar	Subtree matching by pushdown automata.	Comput. Sci. Inf. Syst.	2010	DBLP DOI BibTeX RDF
1	Eric Allender, Klaus-Jörn Lange	Symmetry Coincides with Nondeterminism for Time-Bounded Auxiliary Pushdown Automata.	Electronic Colloquium on Computational Complexity (ECCC)	2010	DBLP BibTeX RDF
1	Martin Kutrib, Hartmut Messerschmidt, Friedrich Otto	On Stateless Two-Pushdown Automata and Restarting Automata.	Int. J. Found. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Juraj Hromkovic, Georg Schnitger	On probabilistic pushdown automata.	Inf. Comput.	2010	DBLP DOI BibTeX RDF
1	Tomás Masopust	Regulated Nondeterminism in Pushdown Automata: The Non-Regular Case.	Fundam. Inform.	2010	DBLP DOI BibTeX RDF
1	C.-H. Luke Ong	Models of Higher-Order Computation: Recursion Schemes and Collapsible Pushdown Automata.	Logics and Languages for Reliability and Security	2010	DBLP DOI BibTeX RDF
1	Martin Kutrib, Andreas Malcher	Reversible Pushdown Automata.	LATA	2010	DBLP DOI BibTeX RDF
1	Borivoj Melichar	Arbology: Trees and Pushdown Automata.	LATA	2010	DBLP DOI BibTeX RDF
1	Markus Holzer, Martin Kutrib	Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata.	RP	2010	DBLP DOI BibTeX RDF
1	Erzsébet Csuhaj-Varjú, Tomás Masopust, György Vaszil	Blackhole State-Controlled Regulated Pushdown Automata.	NCMA	2010	DBLP BibTeX RDF