Találati lista | Tudóstér

001-es BibID:	BIBFORM099913
035-os BibID:	(WOS)000674657100003 (Scopus)85110800103
Első szerző:	Bordihn, Henning
Cím:	Reversible parallel communicating finite automata systems / Henning Bordihn, György Vaszil
Dátum:	2021
ISSN:	0001-5903
Megjegyzések:	We study the concept of reversibility in connection with parallel communicating systems of finite automata (PCFA in short). We define the notion of reversibility in the case of PCFA (also covering the non-deterministic case) and discuss the relationship of the reversibility of the systems and the reversibility of its components. We show that a system can be reversible with non-reversible components, and the other way around, the reversibility of the components does not necessarily imply the reversibility of the system as a whole. We also investigate the computational power of deterministic centralized reversible PCFA. We show that these very simple types of PCFA (returning or non-returning) can recognize regular languages which cannot be accepted by reversible (deterministic) finite automata, and that they can even accept languages that are not context-free. We also separate the deterministic and non-deterministic variants in the case of systems with non-returning communication. We show that there are languages accepted by non-deterministic centralized PCFA, which cannot be recognized by any deterministic variant of the same type.
Tárgyszavak:	Természettudományok Matematika- és számítástudományok idegen nyelvű folyóiratközlemény külföldi lapban folyóiratcikk Finite automata Reversibility Systems of parallel communicating automata
Megjelenés:	Acta Informatica. - 58 : 4 (2021), p. 263-279. -
További szerzők:	Vaszil György (1968-) (matematikus)
Pályázati támogatás:	120558 OTKA
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: