On Determinism in State-Synchronized Automata Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F14%3APU112018" target="_blank" >RIV/00216305:26230/14:PU112018 - isvavai.cz</a>
Result on the web
<a href="http://www.feec.vutbr.cz/EEICT/2014/sbornik/03doktorskeprojekty/08informacnisystemy/02-xkucer28@stud.fit.vutbr.cz.pdf" target="_blank" >http://www.feec.vutbr.cz/EEICT/2014/sbornik/03doktorskeprojekty/08informacnisystemy/02-xkucer28@stud.fit.vutbr.cz.pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On Determinism in State-Synchronized Automata Systems
Original language description
In this paper is studied the determinism in state-synchronized automata systems of degree n. It will be shown that every recursively enumerable language can be accepted by corresponding deterministic state-synchronized automata system containing at least two pushdown automata.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 20th Conference STUDENT EEICT 2014
ISBN
978-80-214-4924-4
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
259-263
Publisher name
Brno University of Technology
Place of publication
Brno
Event location
Brno
Event date
Apr 24, 2014
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—