REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3533
Pełny rekord metadanych
Pole DCWartośćJęzyk
dc.contributor.authorTrybulec, Michał-
dc.date.accessioned2015-12-01T19:26:35Z-
dc.date.available2015-12-01T19:26:35Z-
dc.date.issued2009-
dc.identifier.citationFormalized Mathematics, Volume 17, Issue 2, 2009, Pages 163-171-
dc.identifier.issn1426-2630-
dc.identifier.issn1898-9934-
dc.identifier.urihttp://hdl.handle.net/11320/3533-
dc.description.abstractThis article introduces labelled state transition systems, where transitions may be labelled by words from a given alphabet. Reduction relations from [4] are used to define transitions between states, acceptance of words, and reachable states. Deterministic transition systems are also defined.-
dc.language.isoen-
dc.publisherDe Gruyter Open-
dc.titleLabelled State Transition Systems-
dc.typeArticle-
dc.identifier.doi10.2478/v10037-009-0019-5-
dc.description.AffiliationYAC Software, Warsaw, Poland-
dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.-
dc.description.referencesGrzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41-46, 1990.-
dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
dc.description.referencesGrzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996.-
dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.-
dc.description.referencesCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.-
dc.description.referencesCzesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.-
dc.description.referencesCzesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.-
dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
dc.description.referencesKarol Pąk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006, doi:10.2478/v10037-006-0019-7.-
dc.description.referencesAndrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990.-
dc.description.referencesAndrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.-
dc.description.referencesMichał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007, doi:10.2478/v10037-007-0002-y.-
dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
dc.description.referencesTetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based finite sequences. Formalized Mathematics, 9(4):825-829, 2001.-
dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.-
dc.description.referencesEdmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.-
Występuje w kolekcji(ach):Formalized Mathematics, 2009, Volume 17, Issue 2

Pliki w tej pozycji:
Plik Opis RozmiarFormat 
v10037-009-0019-5.pdf203,88 kBAdobe PDFOtwórz
Pokaż uproszczony widok rekordu Zobacz statystyki


Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons