Non-Termination of cycle rewriting by finite automata

Research output: Contribution to JournalArticleAcademicpeer-review

Original languageEnglish
Pages (from-to)3-4
Number of pages2
JournalElectronic Proceedings in Theoretical Computer Science
Volume225
DOIs
Publication statusPublished - 10 Sep 2016

Cite this

@article{65fbff14067940d998d8eae74fb4bf96,
title = "Non-Termination of cycle rewriting by finite automata",
author = "J{\"o}rg Endrullis",
year = "2016",
month = "9",
day = "10",
doi = "10.4204/EPTCS.225.2",
language = "English",
volume = "225",
pages = "3--4",
journal = "Electronic Proceedings in Theoretical Computer Science",
issn = "2075-2180",
publisher = "Open Publishing Association",

}

Non-Termination of cycle rewriting by finite automata. / Endrullis, Jörg.

In: Electronic Proceedings in Theoretical Computer Science, Vol. 225, 10.09.2016, p. 3-4.

Research output: Contribution to JournalArticleAcademicpeer-review

TY - JOUR

T1 - Non-Termination of cycle rewriting by finite automata

AU - Endrullis, Jörg

PY - 2016/9/10

Y1 - 2016/9/10

UR - http://www.scopus.com/inward/record.url?scp=85015858784&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015858784&partnerID=8YFLogxK

U2 - 10.4204/EPTCS.225.2

DO - 10.4204/EPTCS.225.2

M3 - Article

VL - 225

SP - 3

EP - 4

JO - Electronic Proceedings in Theoretical Computer Science

JF - Electronic Proceedings in Theoretical Computer Science

SN - 2075-2180

ER -