W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21341Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Trybulec, Michał | - |
| dc.date.accessioned | 2026-10-27T08:52:15Z | - |
| dc.date.available | 2026-10-27T08:52:15Z | - |
| dc.date.issued | 2007 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 15, Issue 1, Pages 11-15 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/21341 | - |
| dc.description.abstract | Formal languages are introduced as subsets of the set of all 0-based finite sequences over a given set (the alphabet). Concatenation, the n -th power and closure are defined and their properties are shown. Finally, it is shown that the closure of the alphabet (understood here as the language of words of length 1) equals to the set of all words over that alphabet, and that the alphabet is the minimal set with this property. Notation and terminology were taken from [5] and [13]. | pl |
| dc.description.sponsorship | Motorola Software Group, Cracow, Poland | pl |
| dc.language.iso | en | pl |
| dc.publisher | University of Białystok | pl |
| dc.rights | Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) | - |
| dc.rights.uri | https://creativecommons.org/licenses/by-sa/4.0/ | - |
| dc.title | Formal Languages - Concatenation and Closure | pl |
| dc.type | Article | pl |
| dc.rights.holder | © 2008 Michał Trybulec, published by University of Białystok | pl |
| dc.rights.holder | This work is licensed under the Creative Commons License. | pl |
| dc.identifier.doi | 10.2478/v10037-007-0002-y | - |
| dc.description.references | Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91{96, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990. | pl |
| dc.description.references | Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990. | pl |
| dc.description.references | Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990. | pl |
| dc.description.references | John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, 1979. | pl |
| dc.description.references | Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990. | pl |
| dc.description.references | Karol Pąk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006. | pl |
| dc.description.references | Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics. | pl |
| dc.description.references | Andrzej Trybulec. Domains and their Cartesian products. Formalized Mathematics, 1(1):115-122, 1990. | pl |
| dc.description.references | Andrzej Trybulec. Tarski Grothendieck set theory. Formalized Mathematics, 1(1):9-11, 1990. | pl |
| dc.description.references | Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990. | pl |
| dc.description.references | Tetsuya Tsunetou, Grzegorz Bancerek, and Yatsuka Nakamura. Zero-based nite sequences. Formalized Mathematics, 9(4):825-829, 2001. | pl |
| dc.description.references | William M. Waite and Gerhard Goos. Compiler Construction. Springer-Verlag New York Inc., 1984. | pl |
| dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990. | pl |
| dc.description.volume | 15 | pl |
| dc.description.issue | 1 | pl |
| dc.description.firstpage | 11 | pl |
| dc.description.lastpage | 15 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2007, Volume 15, Issue 1 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| Formal_Languages_-_Concatenation_and_Closure.pdf | 120,54 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
