"A Practical Linear Time Algorithm for Trivial Automata Model Checking of ..."

Naoki Kobayashi (2011)

> Home

Details and statistics

DOI: 10.1007/978-3-642-19805-2_18

access: open

type: Conference or Workshop Paper

metadata version: 2019-10-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fossacs/Kobayashi11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fossacs/Kobayashi11
Naoki Kobayashi:
A Practical Linear Time Algorithm for Trivial Automata Model Checking of Higher-Order Recursion Schemes. FoSSaCS 2011: 260-274

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.