"Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness."

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-31653-1_21

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/dlt/CaralpRT12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/CaralpRT12
Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot:
Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness. Developments in Language Theory 2012: 226-238

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.