History-Register Automata
From MaRDI portal
Publication:2800969
DOI10.2168/LMCS-12(1:7)2016zbMath1448.68264arXiv1209.0680OpenAlexW2549752607MaRDI QIDQ2800969
Radu Grigore, Nikos Tzevelekos
Publication date: 19 April 2016
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.0680
register automatacounter automatafreshnessautomata over infinite alphabetsinfinite systems reachability
Related Items (4)
Layered memory automata: recognizers for quasi-regular languages with unbounded memory ⋮ Nominal Automata with Name Binding ⋮ Fast computations on ordered nominal sets ⋮ The Parametric Complexity of Lossy Counter Machines
This page was built for publication: History-Register Automata
