Sixth Workshop on Non - Classical Models of Automata and Applications ( NCMA 2014 ) Short Papers
نویسندگان
چکیده
We generalize the models of visibly pushdown automata (VPDAs) and visibly pushdown transducers (VPDTs) by equipping them with reversal-bounded counters. We show that some of the results for VPDAs and VPDTs (e.g., closure under intersection and decidability of emptiness for VPDA languages) carry over to the generalized models, but other results (e.g., determinization and closure under complementation) do not carry over. We also investigate the finite-ambiguity and finite-valuedness problems concerning these devices.
منابع مشابه
Preface: Non-Classical Models of Automata and Applications VII
The Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015) was organised to bring together researchers who work on various aspects of non-classical and classical models of automata, providing an excellent opportunity to develop and discuss novel ideas. Numerous models of automata, both classical and non-classical, are natural objects of theoretical computer science. T...
متن کاملClassical and quantum realtime alternating automata
We present some new results on realtime classical and quantum alternating models. Firstly, we show that the emptiness problem for alternating one-counter automata on unary alphabets is undecidable. Then, we define realtime private alternating finite automata (PAFAs) and show that they can recognize some non-regular unary languages, and the emptiness problem is undecidable for them. Moreover, PA...
متن کاملTwo-way finite automata with restricted nondeterminism and descriptional complexity
Acknowledgements : many thanks to professor Giovanni Pighizzini for its welcome and for having directed my internship. Many thanks also to Carlo Mereghetti and Beatrice Palano and all organizing committee of NCMA workshop for having given me the possibility to assist at this workshop. Many thanks also to Viliam Geffert for his contribution to our work. Thanks to Antonio Capoduro for coffees and...
متن کاملOn the optimal reachability problem in weighted timed automata and games
In these notes, we survey works made on the models of weighted timed automata and games, and more specifically on the optimal reachability problem.
متن کاملDistinguishing different types of conference submissions: the ACL case study
Many conferences in AI and NLP call for long and short papers; and satellite workshops co-locate with the main conference. In this work, we focus on distinguishing full from short from workshop papers, as submitted to some recent ACL conferences. We propose a framework that takes into account both metadata and content of the paper. To extract metadata, we devised a full-fledged paper parser. SV...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014