---
res:
  bibo_abstract:
  - The notion of delays arises naturally in many computational models, such as, in
    the design of circuits, control systems, and dataflow languages. In this work,
    we introduce automata with delay blocks (ADBs), extending finite state automata
    with variable time delay blocks, for deferring individual transition output symbols,
    in a discrete-time setting. We show that the ADB languages strictly subsume the
    regular languages, and are incomparable in expressive power to the context-free
    languages. We show that ADBs are closed under union, concatenation and Kleene
    star, and under intersection with regular languages, but not closed under complementation
    and intersection with other ADB languages. We show that the emptiness and the
    membership problems are decidable in polynomial time for ADBs, whereas the universality
    problem is undecidable. Finally we consider the linear-time model checking problem,
    i.e., whether the language of an ADB is contained in a regular language, and show
    that the model checking problem is PSPACE-complete. Copyright 2012 ACM.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000−0002−2985−7724
  - foaf_Person:
      foaf_givenName: Vinayak
      foaf_name: Prabhu, Vinayak
      foaf_surname: Prabhu
  bibo_doi: 10.1145/2380356.2380370
  dct_date: 2012^xs_gYear
  dct_language: eng
  dct_publisher: ACM@
  dct_title: Finite automata with time delay blocks@
...