Automata-2008: Theory and Applications of Cellular Automata - Google...
books.google.de
Cellular automata are regular uniform networks of locally-connected finite-state machines. They are discrete systems with non-trivial behaviour. Cellular...
Descriptional Complexity of Formal Systems: 15th International...
books.google.ae
Size of Unary One-Way Multi-head Finite Automata Martin Kutrib, Andreas Malcher, and Matthias Wendlandt Institut für Informatik, Universität Giessen ...
[ v1] Multi-Head Finite Automata: Characterizations, Concepts...
arxiv.org
Title:Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. Authors:Markus Holzer, Martin Kutrib, Andreas Malcher.
Iterated Uniform Finite-State Transducers on Unary Languages
papers.ssrn.com
von M Kutrib · Zitiert von: 1 — affiliation not provided to SSRN. Andreas Malcher. affiliation not provided to SSRN ... Andreas Malcher. affiliation not provided to SSRN ... › papers
Andreas Malcher - Academia.eduindependent.academia.edu › AndreasMalcher
independent.academia.edu
Andreas Malcher studies Multi Agent System, Finite Automata, and Holocaust Studies.
On recursive and non-recursive trade-offs between finite-turn ...
dl.acm.org
von A Malcher · · Zitiert von: 12 — Andreas Malcher. Institut für Informatik, Johann Wolfgang Goethe-Universität, Frankfurt am Main, Germany. Institut für Informatik, Johann Wolfgang ... › doi › abs
Finite Automata with Undirected State Graphs - Archive ouverte HALhal.science › hal
hal.science
Andreas Malcher 1 Christian Schneider 1. Détails. 1 JLU - Justus-Liebig ... Martin Kutrib, Andreas Malcher, Christian Schneider. Finite Automata with ...
On non-recursive trade-offs between finite-turn pushdown automatapublikationen.ub.uni-frankfurt.de › year › docId
publikationen.ub.uni-frankfurt.de
Andreas Malcher. URN: urn:nbn:de:hebis: ISSN: Parent Title (German):, Frankfurter Informatik-Berichte ; Nr. 04,2. Series (Serial Number): ...
Theorietag Uni Bremenuser.informatik.uni-bremen.de › smaneth › program
user.informatik.uni-bremen.de
10:50–11:10 Andreas Malcher, On Iterated Uniform Finite State Transducers 11:10–11:30 Simon Beier, Semirecognizable Sets and Right One-Way Jumping Finite ...
Programme | AUTOMATA WordPress.com
automata2019.wordpress.com
— Martin Kutrib and Andreas Malcher. Iterative Arrays with Finite Inter-Cell Communication. 13:00, Lunch. 14:30, Contributed talks ... › ...
Alle Infos zum Namen "Andreas Malcher"
Accepted Papers | AFL2014www.inf.u-szeged.hu › afl2014
www.inf.u-szeged.hu
Henning Bordihn, Martin Kutrib and Andreas Malcher : Measuring Communication in Parallel Communicating Finite Automata; Karel Brinda : Languages of lossless ...
Accepted papers - CIAA Université Paris-Est Marne-la-Valléeciaa17.univ-mlv.fr › accepted
ciaa17.univ-mlv.fr
Martin Kutrib, Andreas Malcher and Matthias Wendlandt. Transducing Reversibly with Finite State Machines. Martin Berglund, Brink van der Merwe, Bruce Watson ...
CIAA Accepted Paperscs.smu.ca › ~ciaa2013 › accepted
cs.smu.ca
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano and Matthias Wendlandt. Input-Driven Queue Automata: Finite Turns, Decidability, and ...
(PDF) Multi-Head Finite Automata: Characterizations, Concepts and...
www.academia.edu
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
DLT 2012cc.ee.ntu.edu.tw › ~dlt2012 › Accepted_Paper_List
cc.ee.ntu.edu.tw
Martin Kutrib, Andreas Malcher and Matthias Wendlandt. States and Heads Do Count For Unary Multi-Head Finite Automata. Friedrich Otto. On Centralized PC ...
DCFS Accepted Papers
im.saske.sk
... Martin Kutrib, Andreas Malcher, Carlo Mereghetti, and Beatrice Palano: Descriptional Complexity of Iterated Uniform Finite State Transducers; Mizuhito Ogawa ...
Descriptional Complexity of Iterated Uniform Finite-State Transducerwww.researcher-app.com › paper
www.researcher-app.com
Descriptional Complexity of Iterated Uniform Finite-State Transducers. Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. We introduce the ...
A Direct Construction of Finite State Automata for Pushdown ...
www.springerprofessional.de
verfasst von: Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano. Mehr anzeigen. Erschienen in: Descriptional Complexity of ... › ...
A Direct Construction of Finite State Automata for Pushdown Store ...www.springerprofessional.de › a-direct-construction...
www.springerprofessional.de
Authors: Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano. Publisher: Springer Berlin Heidelberg.
Head and state hierarchies for unary multi-head finite automatawww.proquest.com › scholarly-journals › docview
www.proquest.com
Martin Kutrib Andreas Malcher. Matthias Wendlandt. Received: 27 November Accepted: 1 August Published online: 27 August Springer-Verlag ...
Descriptional Complexity of Iterated Uniform Finite-State Transducers...
hal.inria.fr
Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano. Descriptional Complexity of Iterated Uniform Finite-State Transducers.
Cellular String Generators - HAL-Inria
hal.inria.fr
von M Kutrib · · Zitiert von: 1 — Martin Kutrib, Andreas Malcher. Cellular String Generators. 26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), ... von M Kutrib · · Zitiert von: 2 — Martin Kutrib, Andreas Malcher. Iterative Arrays with Finite Inter-cell Communication. 25th International Workshop on Cellular Automata and Discrete Complex ... › hal › hal
Deterministic input-driven queue automata: Finite turns,...
www.infona.pl
We introduce and study the model of deterministic input-driven queue automata. On such devices, the input letters uniquely determine the operations on the...
Descriptional Complexity of Cellular Automata and ...
www.semanticscholar.org
Andreas Malcher; Published in DCFS 1 September 2002; Computer Science. We study the descriptional complexity of cellular automata (CA) which are a parallel ... Andreas Malcher, G. Pighizzini; Published in Inf. Comput. 3 July 2007; Computer Science. Finite-turn pushdown automata (PDA) are investigated concerning ... › ...
Input-Driven Queue Automata: Finite Turns, Decidability, and ...www.springerprofessional.de › input-driven-queue-...
www.springerprofessional.de
Authors: Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt. Publisher: Springer Berlin Heidelberg.
Iterative Arrays with Finite Inter-cell Communication - Hal-Inriahal.inria.fr › hal
hal.inria.fr
Martin Kutrib, Andreas Malcher. Iterative Arrays with Finite Inter-cell Communication. 25th International Workshop on Cellular Automata and Discrete Complex ...
STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH ...www.worldscientific.com › doi
www.worldscientific.com
STATELESS ONE-WAY MULTI-HEAD FINITE AUTOMATA WITH PEBBLES. MARTIN KUTRIB,; ANDREAS MALCHER, and; MATTHIAS WENDLANDT.
Iterative Arrays with Finite Inter-cell Communication
hal.univ-reunion.fr
von M Kutrib · · Zitiert von: 2 — Martin Kutrib, Andreas Malcher. Iterative Arrays with Finite Inter-cell Communication. 25th International Workshop on Cellular Automata and ... › hal
JALC | Journal of Automata, Languages, and Combinatorics
www.jalc.de
von A Malcher · Zitiert von: 11 — On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata. Andreas Malcher. Pages 265–277. Download Abstract › issue_12_1-2
Archive ouverte HAL - Transductions Computed by Iterative Arrays
hal.archives-ouvertes.fr
Iterative arrays are one-dimensional arrays of interconnected interacting finite automata. The cell at the origin is equipped with a one-way read-only input...
Verwandte Suchanfragen zu Andreas Malcher
Matthias Wendlandt Martin Kutrib Werner Sobek | Barbara Malcher |
Person "Malcher" (1) Vorname "Andreas" (97752) Name "Malcher" (284) |
sortiert nach Relevanz / Datum