Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness

DOI10.1007/978-3-642-31653-1_21zbMath1370.68162OpenAlexW39507754MaRDI QIDQ3167498

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

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_21

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (4)

Symbolic weighted language models, quantitative parsing and automated music transcription ⋮ Cost Register Automata for Nested Words ⋮ Deciding path size of nondeterministic (and input-driven) pushdown automata ⋮ Trimming visibly pushdown automata

This page was built for publication: Visibly Pushdown Automata with Multiplicities: Finiteness and K-Boundedness