scientific article; zbMATH DE number 2086620
From MaRDI portal
Publication:4737155
zbMath1056.68097MaRDI QIDQ4737155
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23800170.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Quotients and atoms of reversible languages ⋮ Reversible and Irreversible Computations of Deterministic Finite-State Devices ⋮ Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata ⋮ Bisimulations for fuzzy automata ⋮ Nondeterministic automata: equivalence, bisimulations, and uniform relations ⋮ Minimal Reversible Deterministic Finite Automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reversibility of computations in graph-walking automata ⋮ Quantum Reversible Fuzzy Grammars ⋮ Reversible pushdown automata ⋮ On the efficient construction of quasi-reversible automata for reversible languages ⋮ Introducing VAUCANSON ⋮ On locally reversible languages ⋮ Descriptional complexity of regular languages
This page was built for publication:
