- -

A description based on languages of the final non-deterministic automaton

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A description based on languages of the final non-deterministic automaton

Show full item record

Ballester-Bolinches, A.; Cosme-Llopez, E.; Esteban Romero, R. (2014). A description based on languages of the final non-deterministic automaton. Theoretical Computer Science. 536:1-20. doi:10.1016/j.tcs.2014.01.018

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/51041

Files in this item

Item Metadata

Title: A description based on languages of the final non-deterministic automaton
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada
Issued date:
Abstract:
The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at ...[+]
Subjects: Non-deterministic automaton , Formal language , Coalgebra , Bisimilarity , Final automaton
Copyrigths: Reserva de todos los derechos
Source:
Theoretical Computer Science. (issn: 0304-3975 )
DOI: 10.1016/j.tcs.2014.01.018
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.tcs.2014.01.018
Thanks:
This work has been supported by the grant MTM2010-19938-C03-01 from the Ministerio de Ciencia e Innovacion (Spanish Government). The first author has been supported by a research project from the National Natural Science ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record