On the efficient construction of quasi-reversible automata for reversible languages
type: Item
instance of: scholarly article
title: On the efficient construction of quasi-reversible automata for reversible languages
zbMATH Open document ID: 1186.68255
author: Pedro García
author: Manuel Vázquez de Parga
author: Damián López
published in: Information Processing Letters
publication date: 2010-04-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5694946
zbMATH Keywords: formal languages
zbMATH Keywords: reversible language
zbMATH Keywords: quasi-reversible automata
zbMATH Keywords: residual finite state automaton
describes a project that uses: RFSA
MaRDI profile type: Publication
full work available at URL: j.ipl.2007.12.004
OpenAlex ID: W2160728288
Wikidata QID: Q58209344
cites work: Inference of Reversible Languages
cites work: An algorithm for strongly connected component analysis in \(n \log n\) symbolic steps
cites work: Q4799353
cites work: Q2754000
cites work: Learning regular languages using RFSAs.
cites work: A lower bound for reversible automata
cites work: Q4737155
cites work: Q3044317
cites work: Q3763607
DBLP publication ID: journals/ipl/GarciaPL08
DOI: 10.1016/J.IPL.2007.12.004
description: scientific article; zbMATH DE number 5694946