Content Provider: Hochschulschriftenserver ...
(CSV)
Filter By:
  • Funder (15)
  • Project (99+)
  • Publication Date (77)
  • Access Mode (1)
  • Type (20)
  • Language (26)
  • Community (3)
  • Content Provider (100+)
Content Provider: Hochschulschriftenserver ...
(CSV)
  • Funder (15)
  • Project (99+)
  • Publication Date (77)
  • Access Mode (1)
  • Type (20)
  • Language (26)
  • Community (3)
  • Content Provider (100+)
  • On non-recursive trade-offs between finite-turn pushdown automata

    Research English OPEN
    Malcher, Andreas; (2004)
    It is shown that between one-turn pushdown automata (1-turn PDAs) and deterministic finite automata (DFAs) there will be savings concerning the size of description not bounded by any recursive function, so-called non-recursive tradeoffs. Considering the number of turns ...
  • (
Last index information