Skip to content

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

Mathieu Caralp, Pierre-Alain Reynier, Jean-Marc Talbot

VenueCDLT
Year2012
ProceedingsDevelopments in Language Theory

Browse the full DLT paper archive.