Polynomial-time equivalence testing for deterministic fresh-register automata
From MaRDI portal
Publication:5005176
DOI10.4230/LIPIcs.MFCS.2018.72MaRDI QIDQ5005176
Andrzej S. Murawski, S. J. Ramsay, Nikos Tzevelekos
Publication date: 4 August 2021
Full work available at URL: https://doi.org/10.4230/lipics.mfcs.2018.72
68Qxx: Theory of computing
Related Items
Cites Work
- Active learning for extended finite state machines
- Automata for XML -- a survey
- Efficient representation of perm groups
- Finite-memory automata
- Intractability of decision problems for finite-memory automata
- Learning Register Automata with Fresh Value Generation
- Automata theory in nominal sets
- A Robust Class of Data Languages and an Application to Learning
- Algorithmic Nominal Game Semantics
- Full abstraction for nominal general references
- Learning Meets Verification
- On the length of subgroup chains in the symmetric group
- Bisimilarity in Fresh-Register Automata
- Finite state machines for strings over infinite alphabets
- Runtime Verification Based on Register Automata
- Learning nominal automata
- Fresh-register automata