Fresh-register automata

DOI10.1145/1926385.1926420zbMath1284.68368MaRDI QIDQ5408551

Nikos Tzevelekos

Publication date: 10 April 2014

Published in: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1926385.1926420

zbMATH Keywords

register automata; finite-memory automata; computation with fresh-name generation

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Unnamed Item, Unnamed Item, Polynomial-time equivalence testing for deterministic fresh-register automata, Denotational Semantics with Nominal Scott Domains, Unnamed Item, A taxonomy and reductions for common register automata formalisms, On-the-fly bisimilarity checking for fresh-register automata, Program equivalence in a simple language with state, Regular and context-free nominal traces, Reactive synthesis from visibly register pushdown automata, Layered memory automata: recognizers for quasi-regular languages with unbounded memory, Weak and Nested Class Memory Automata, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours, Nominal Automata for Resource Usage Control, Nominal Automata with Name Binding, Algorithmic Nominal Game Semantics, An Automaton over Data Words That Captures EMSO Logic