Minimizing Finite Automata with Graph Programs

Singh, Amritesh, Plump, Detlef orcid.org/0000-0002-1148-822X and Suri, Robin (2011) Minimizing Finite Automata with Graph Programs. Electronic Communications of the EASST. ISSN 1863-2122

Metadata

Item Type: Article
Authors/Creators:
Dates:
  • Published: 2011
Institution: The University of York
Academic Units: The University of York > Faculty of Sciences (York) > Computer Science (York)
Depositing User: Pure (York)
Date Deposited: 10 Jan 2023 14:50
Last Modified: 16 Oct 2024 13:06
Published Version: https://doi.org/10.14279/tuj.eceasst.39.658
Status: Published
Refereed: Yes
Identification Number: 10.14279/tuj.eceasst.39.658
Related URLs:
Open Archives Initiative ID (OAI ID):

Download

Published Version

Filename: PlumpSuriSingh.ECEASST.11.pdf

Description: PlumpSuriSingh.ECEASST.11

Licence: CC-BY 2.5

CLICK TO DOWNLOAD [thumbnail of PlumpSuriSingh.ECEASST.11]

Export

Statistics


CORE (COnnecting REpositories)