Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
Z
zellularautomaten-ausarbeitung
Project
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Philipp Adolf
zellularautomaten-ausarbeitung
Commits
8b539e39
Commit
8b539e39
authored
Jun 18, 2016
by
Philipp Adolf
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Add biblatex with biber
parent
35ff2445
Pipeline
#166
passed with stage
in 6 minutes 59 seconds
Changes
3
Pipelines
1
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
28 additions
and
0 deletions
+28
-0
.gitlab-ci.yml
.gitlab-ci.yml
+1
-0
ausarbeitung.tex
ausarbeitung.tex
+4
-0
bibtex.bib
bibtex.bib
+23
-0
No files found.
.gitlab-ci.yml
View file @
8b539e39
...
...
@@ -5,6 +5,7 @@ generate_ausarbeitung:
stage
:
generate
image
:
tianon/latex
script
:
-
apt-get update && apt-get install -y biber
-
latexmk -pdf ausarbeitung.tex
artifacts
:
paths
:
...
...
ausarbeitung.tex
View file @
8b539e39
...
...
@@ -7,6 +7,8 @@
%\usepackage{libertine}
\usepackage
{
tikz
}
\usepackage
[style=alphabetic]
{
biblatex
}
\addbibresource
{
bibtex.bib
}
\newcommand
{
\teilnehmername
}{
Philipp Adolf
}
\newcommand
{
\teilnehmermatrnr
}{
1669101
}
...
...
@@ -90,4 +92,6 @@ mit Abänderungen entnommen wurde.
% Ende zweite Seite
%=======================================================================
\printbibliography
\end{document}
bibtex.bib
0 → 100644
View file @
8b539e39
@inproceedings{DMTCS-AA0110,
author = {J{\'e}r{\^o}me Durand-Lose},
title = {Representing Reversible Cellular Automata with Reversible Block Cellular Automata},
keywords = {Cellular automata, reversibility, block cellular automata, partitioning cellular automata},
editor = {Robert Cori and Jacques Mazoyer and Michel Morvan and R{\'e}my Mosseri},
booktitle = {Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001},
abstract = {Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local
function. Block permutations are mappings that generalize a given permutation
of blocks (finite arrays of fixed size) to a given partition of the lattice in
blocks. We prove that any d-dimensional reversible cellular automaton
can be exp ressed as the composition of d+1 block permutations. We built a
simulation in linear time of reversible cellular automata by reversible block
cellular automata (also known as partitioning CA and CA with the Margolus
neighborhood) which is valid for both finite and infinite configurations.
This proves a 1990 conjecture by Toffoli and Margolus \textit{Physica D} 45
improved by Kari in 1996 \textit{Mathematical System Theory} 29).},
series = {DMTCS Proceedings},
publisher = {Discrete Mathematics and Theoretical Computer Science},
year = 2001,
volume = {AA},
pages = {145-154},
url = {http://www.dmtcs.org/proceedings/html/dmAA0110.abs.html}
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment