References

  1. Rajeev Alur & P. Madhusudan (2009): Adding nesting structure to words. J. ACM 56, pp. 16:1–16:43, doi:10.1145/1516512.1516518.
  2. Sébastien Bardin, Alain Finkel, Jér^ome Leroux & Philippe Schnoebelen (2005): Flat acceleration in symbolic model checking. In: Proceedings of the 3rd International Symposium on Automated Technology for Verification and Analysis (ATVA'05), LNCS 3707. Springer, Taipei, Taiwan, pp. 474–488, doi:10.1007/11562948_35.
  3. Mikolaj Bojanczyk (2009): Weak MSO with the Unbounding Quantifier. In: STACS 2009 3, pp. 159–170, doi:10.4230/LIPIcs.STACS.2009.1834.
  4. Ahmed Bouajjani & Peter Habermehl (1998): Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Theoretical Computer Science 221, doi:10.1016/S0304-3975(99)00033-X.
  5. Michaël Cadilhac, Alain Finkel & Pierre McKenzie (2011): On the expressiveness of Parikh automata and related models. In: Proceedings of 3rd International Workshop on Non-Classical Models of Automata and Applications (to appear).
  6. Flavio D'Alessandro & Stefano Varricchio (2008): On the growth of context-free languages. J. Autom. Lang. Comb. 13, pp. 95–104.
  7. Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer & Jianwen Su (2000): Binary Reachability Analysis of Discrete Pushdown Timed Automata. In: CAV, LNCS 1855. Springer, pp. 69–84, doi:10.1007/10722167_9.
  8. Stéphane Demri, Alain Finkel, Valentin Goranko & Govert van Drimmelen (2010): Model-checking (CTL*) over Flat Presburger Counter Systems. Journal of Applied Non-Classical Logics 20(4), pp. 313–344, doi:10.3166/jancl.20.313-344.
  9. Herbert B. Enderton (1972): A Mathematical Introduction to Logic. Academic Press.
  10. Alain Finkel, S. Purushothaman Iyer & Grégoire Sutre (2003): Well-abstracted transition systems: application to FIFO automata. Information and Computation 181(1), pp. 131, doi:10.1016/S0890-5401(02)00027-5.
  11. Patrick C. Fischer (1965): Multi-tape and infinite-state automata—a survey. Commun. ACM 8(12), pp. 799–805, doi:10.1145/365691.365962.
  12. Seymour Ginsburg (1966): The Mathematical Theory of Context-Free Languages. McGraw-Hill, Inc., New York, NY, USA.
  13. Seymour Ginsburg & Edwin H. Spanier (1964): Bounded ALGOL-Like Languages. Transactions of the American Mathematical Society 113(2), pp. 333–368, doi:10.2307/1994067.
  14. Oscar H. Ibarra (1978): Reversal-Bounded Multicounter Machines and Their Decision Problems. J. ACM 25(1), pp. 116–133, doi:10.1145/322047.322058.
  15. Oscar H. Ibarra & Jianwen Su (1999): A technique for proving decidability of containment and equivalence of linear constraint queries. J. Comput. Syst. Sci. 59(1), pp. 1–28, doi:10.1006/jcss.1999.1624.
  16. Oscar H. Ibarra, Jianwen Su, Zhe Dang, Tevfik Bultan & Richard A. Kemmerer (2002): Counter Machines and Verification Problems. TCS 289(1), pp. 165–189, doi:10.1016/S0304-3975(01)00268-7.
  17. Michael Kaminski & Nissim Francez (1994): Finite-memory automata. TCS 134(2), pp. 329–363, doi:10.1016/0304-3975(94)90242-9.
  18. Felix Klaedtke & Harald Rueß (2003): Monadic Second-Order Logics with Cardinalities. In: ICALP, LNCS 2719. Springer-Verlag, pp. 681–696, doi:10.1007/3-540-45061-0_54.
  19. Nils Klarlund & Fred B. Schneider (1989): Verifying Safety Properties Using Non-deterministic Infinite-state Automata. Technical Report, Ithaca, NY, USA.
  20. L. P Lisovik & D. A Koval' (2005): Language recognition by two-way deterministic pushdown automata. Cybernetics and Systems Analysis 40, pp. 939–942, doi:10.1007/s10559-005-0034-7. ACM ID: 1057268.
  21. Rohit J. Parikh (1966): On context-free languages. Journal of the ACM 13(4), pp. 570–581, doi:10.1145/321356.321364.
  22. Howard Straubing (1994): Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, Boston, doi:10.1007/978-1-4612-0289-9.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org