Fresh-register automata

DOI10.1145/1926385.1926420zbMath1284.68368OpenAlexW4240267080MaRDI 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 automatafinite-memory automatacomputation with fresh-name generation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (17)

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

This page was built for publication: Fresh-register automata