Filters








721 Hits in 4.9 sec

A Note on Limited Pushdown Alphabets in Stateless Deterministic Pushdown Automata [article]

Tomáš Masopust
2012 arXiv   pre-print
The existence of such a hierarchy for m-state deterministic pushdown automata is left open.  ...  Recently, an infinite hierarchy of languages accepted by stateless deterministic pushdown automata has been established based on the number of pushdown symbols.  ...  Research supported by the GAČR grant no. P202/11/P028 and by RVO: 67985840.  ... 
arXiv:1208.5002v1 fatcat:o5prfv5nzreero3y4n3cwtg7du

Page 5387 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
Decidability of the inclusion problems for metalinear two-way deterministic pushdown automata, deterministic ultra- linear context-free languages and for ultralinear unary recursive schemata with individual  ...  Using the obser- vation that a vast majority of timed automata have a very regular timing structure, we propose a class of timed automata, alternat- ing RQ timed automata, and prove that they have simple  ... 

On the complexities of linear LL(1) and LR(1) grammars [chapter]

Markus Holzer, Klaus -Jörn Lange
1993 Lecture Notes in Computer Science  
In contrast to that, deterministic linear languages de ned via automata models turn out to have a DSPACE(log n)complete membership problem.  ...  We exhibit close relationships between simple linear languages and the deterministic linear languages both according to Nasu and Honda and to Ibarra, Jiang, and Ravikumar.  ...  Vollath for helpful comments on the UNIX 9 tools yacc and bison.  ... 
doi:10.1007/3-540-57163-9_25 fatcat:wuacgcrb2veq5ablq4zy74he2a

A Tighter Bound for the Determinization of Visibly Pushdown Automata

Nguyen Van Tang
2009 Electronic Proceedings in Theoretical Computer Science  
Next, we propose simple on-the-fly algorithms to check universality and inclusion problems of this automata class. Then, we implement the proposed algorithms in a prototype tool.  ...  In this paper we consider the problem of implementing VPA-based model checking algorithms. For doing so, we first present an improvement on upper bound for determinization of VPA.  ...  Acknowledgements: I would like to thank Professor Mizuhito Ogawa and Nao Hirokawa for helpful discussions on this work.  ... 
doi:10.4204/eptcs.10.5 fatcat:cxfubsp4sja2bneubrkas5tuam

The inclusion problem for simple languages

Emily P. Friedman
1976 Theoretical Computer Science  
It follows that the inc> on problems for the U (k) languages and the free monadic recursion schemes that do not' use an identity function :Ire ako undecidable. * The results reported are a rtion of thrt  ...  A determinist? pushdown tor is called a simple machine when it is restricted 6~ have only on5t state, eperate in real-and accept by empty store.  ...  languages d by bite-turn deterministic pushdown automata, one-counter deterministic pu&adown automata, and nonsingular automata.  ... 
doi:10.1016/0304-3975(76)90074-8 fatcat:gpz7jxyqmrea7ftcaz5crxwkky

Properties of probabilistic pushdown automata

Ioan I. Macarie, Mitsunori Ogihara
1998 Theoretical Computer Science  
Complete characterizations in terms of well-known complexity classes are given for the classes of languages recognized by polynomial time-bounded, logarithmic space-bounded auxiliary pushdown automata  ...  Also, complexity lower bounds are given for the classes of languages recognized by these automata with unlimited running time.  ...  Acknowledgements The first author is grateful to Eric Allender for enjoyable discussions on this topic.  ... 
doi:10.1016/s0304-3975(98)00059-0 fatcat:wblsfvu4urfxhj4p2vz3pjopiy

Visibly pushdown automata for streaming XML

Viraj Kumar, P. Madhusudan, Mahesh Viswanathan
2007 Proceedings of the 16th international conference on World Wide Web - WWW '07  
We propose the study of visibly pushdown automata (Vpa) for processing XML documents.  ...  Vpas are pushdown automata where the input determines the stack operation, and XML documents are naturally visibly pushdown with the Vpa pushing onto the stack on open-tags and popping the stack on close-tags  ...  Finally, the inclusion problem (which is undecidable for pushdown automata) is decidable for Vpas.  ... 
doi:10.1145/1242572.1242714 dblp:conf/www/KumarMV07 fatcat:273dd6dx3bgvblraeitpfpyrxi

Complexity of multi-head finite automata: Origins and directions

Markus Holzer, Martin Kutrib, Andreas Malcher
2011 Theoretical Computer Science  
Although multi-head finite automata are a simple concept, their computational behavior can be already very complex and leads to undecidable or even non-semi-decidable problems on these devices such as,  ...  In the present paper, we tour a fragment of this literature. Although multi-head finite automata are very simple devices, their computational behavior is already highly complex.  ...  The problems of emptiness, universality, finiteness, infiniteness, inclusion, and equivalence are decidable for nondeterministic two-way k-head pushdown automata accepting a bounded language, if the automata  ... 
doi:10.1016/j.tcs.2010.08.024 fatcat:yjkjor7r5rawrjijnxihcdnuve

Page 573 of Mathematical Reviews Vol. , Issue 2003A [page]

2003 Mathematical Reviews  
Orna Kupferman (1-CA-C; Berkeley, CA) 2003a:68080 68Q45 Makinen, Erkki (FIN-TAM-CI; Tampere) On the inclusion problem for very simple deterministic pushdown automata. (English summary) J. Autom.  ...  In the paper the author presents a new algorithm for checking the inclusion of very simple deterministic pushdown automata. This algorithm checks the inclusion “L(M,) C L(M>)?” in two steps.  ... 

Page 1063 of Mathematical Reviews Vol. , Issue 88b [page]

1988 Mathematical Reviews  
This result is one more par- tial solution of the general equivalence problem for deterministic context-free languages.  ...  The third result is that the inclusion problem is undecidable for NTS languages. Yasuyoshi Inagaki (Nagoya) 88b:68101 68Q45 03D05 68Q05 Brandenburg, Franz-J.  ... 

Verification for Timed Automata extended with Unbounded Discrete Data Structures

Karin Quaas, Frits Vaandrager
2015 Logical Methods in Computer Science  
The goal of this paper is to identify subclasses of timed pushdown automata for which the language inclusion problem and related problems are decidable.  ...  We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack.  ...  I would like to thank Michael Emmi and Rupak Majumdar for helpful discussions on their work on timed pushdown automata.  ... 
doi:10.2168/lmcs-11(3:20)2015 fatcat:iuojj5yccjc7nkjna4zzbbe4hu

Verification for Timed Automata Extended with Unbounded Discrete Data Structures [chapter]

Karin Quaas
2014 Lecture Notes in Computer Science  
The goal of this paper is to identify subclasses of timed pushdown automata for which the language inclusion problem and related problems are decidable.  ...  We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack.  ...  I would like to thank Michael Emmi and Rupak Majumdar for helpful discussions on their work on timed pushdown automata.  ... 
doi:10.1007/978-3-662-44584-6_35 fatcat:nonrzogf7reilfwnh3mdgeal4a

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems

Markus Holzer, Martin Kutrib, Andreas Malcher
2009 Electronic Proceedings in Theoretical Computer Science  
Although multi-head finite automata are a simple concept, their computational behavior can be already very complex and leads to undecidable or even non-semi-decidable problems on these devices such as,  ...  Since that time, a vast literature on computational and descriptional complexity issues on multi-head finite automata documenting the importance of these devices has been developed.  ...  Although multi-head finite automata are very simple devices, their computational behavior is already highly complex.  ... 
doi:10.4204/eptcs.1.9 fatcat:gdxlz36uczhghkxhtxhiatw2ja

Verification of Opacity and Diagnosability for Pushdown Systems

Koichi Kobayashi, Kunihiko Hiraishi
2013 Journal of Applied Mathematics  
In this paper, we discuss verification of opacity and diagnosability for infinite-state DESs modeled by pushdown automata (called here pushdown systems).  ...  Finally, as one of the applications, we consider data integration using XML (Extensible Markup Language). The obtained result is useful for developing control theory of infinite-state DESs.  ...  Acknowledgment This work was partially supported by Grant-in-Aid for Young Scientists (B) 23760387.  ... 
doi:10.1155/2013/654059 fatcat:sxkotf6tunfclpusq5hj7oovuy

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
Open Problems: Which are the most pressing open problems in tree transducer theory? The seminar fully satisfied our expectations.  ...  The 33 participants from 13 countries (Australia, and the US) had been invited by the organizer Sebastian Maneth to give particular survey talks about their recent research on applications and theory of  ...  Given a tree of size n, we construct deterministic pushdown automata or deterministic finite tree automata which represent a full index of the tree for subtrees or tree patterns.  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i
« Previous Showing results 1 — 15 out of 721 results