Reversible Nondeterministic Finite Automata
- 25 May 2017
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Minimal and Reduced Reversible AutomataLecture Notes in Computer Science, 2016
- Minimal Reversible Deterministic Finite AutomataPublished by Springer Science and Business Media LLC ,2015
- A Simple and Efficient Universal Reversible Turing MachineLecture Notes in Computer Science, 2011
- On the efficient construction of quasi-reversible automata for reversible languagesInformation Processing Letters, 2008
- On the Construction of Reversible Automata for Reversible LanguagesLecture Notes in Computer Science, 2002
- Learning approximately regular languages with reversible languagesTheoretical Computer Science, 1997
- Inference of Reversible LanguagesJournal of the ACM, 1982
- Some remarks on multiple-entry finite automataJournal of Computer and System Sciences, 1979
- Multiple-entry finite automataJournal of Computer and System Sciences, 1974
- Logical Reversibility of ComputationIBM Journal of Research and Development, 1973