W BIAŁYMSTOKU
Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji:
http://hdl.handle.net/11320/21377Pełny rekord metadanych
| Pole DC | Wartość | Język |
|---|---|---|
| dc.contributor.author | Trybulec, Michał | - |
| dc.date.accessioned | 2026-10-30T07:35:02Z | - |
| dc.date.available | 2026-10-30T07:35:02Z | - |
| dc.date.issued | 2007 | - |
| dc.identifier.citation | Formalized Mathematics, Volume 15, Issue 3, Pages 121-126 | pl |
| dc.identifier.issn | 1426-2630 | - |
| dc.identifier.uri | http://hdl.handle.net/11320/21377 | - |
| dc.description.abstract | Basing on the definitions from [15], semi-Thue systems, Thue systems, and direct derivations are introduced. Next, the standard reduction relation is defined that, in turn, is used to introduce derivations using the theory from [1]. Finally, languages generated by rewriting systems are defined as all strings reachable from an initial word. This is followed by the introduction of the equivalence of semi-Thue systems with respect to the initial word. | 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 | String Rewriting Systems | 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-0013-8 | - |
| dc.description.Affiliation | Motorola Software Group, Cracow, Poland | pl |
| dc.description.references | Grzegorz Bancerek. Reduction relations. Formalized Mathematics, 5(4):469-478, 1996. | pl |
| dc.description.references | Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990. | pl |
| dc.description.references | Czesław Byliński. Finite sequences and tuples of elements of a non-empty sets. Formalized Mathematics, 1(3):529-536, 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 | Patricia L. Carlson and Grzegorz Bancerek. Context-free grammar - part 1. Formalized Mathematics, 2(5):683-687, 1991. | pl |
| dc.description.references | Markus Moschner. Basic notions and properties of orthoposets. Formalized Mathematics, 11(2):201-210, 2003. | pl |
| dc.description.references | Karol Pαk. The Catalan numbers. Part II. Formalized Mathematics, 14(4):153-159, 2006.10.2478/v10037-006-0019-7 | pl |
| dc.description.references | Andrzej Trybulec. Subsets of complex numbers. To appear in Formalized Mathematics. | pl |
| dc.description.references | Andrzej Trybulec. Binary operations applied to functions. Formalized Mathematics, 1(2):329-334, 1990. | 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 | Michał Trybulec. Formal languages - concatenation and closure. Formalized Mathematics, 15(1):11-15, 2007. | 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 finite 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 and their basic properties. Formalized Mathematics, 1(1):73-83, 1990. | pl |
| dc.description.references | Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990. | pl |
| dc.description.references | Edmund Woronowicz and Anna Zalewska. Properties of binary relations. Formalized Mathematics, 1(1):85-89, 1990. | pl |
| dc.description.volume | 15 | pl |
| dc.description.issue | 3 | pl |
| dc.description.firstpage | 121 | pl |
| dc.description.lastpage | 126 | pl |
| dc.identifier.citation2 | Formalized Mathematics | pl |
| Występuje w kolekcji(ach): | Formalized Mathematics, 2007, Volume 15, Issue 3 | |
Pliki w tej pozycji:
| Plik | Opis | Rozmiar | Format | |
|---|---|---|---|---|
| String_Rewriting_Systems.pdf | 138,58 kB | Adobe PDF | Otwórz |
Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL
