BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Australia
1 × Czech Republic
1 × Finland
1 × France
1 × Germany
1 × Japan
1 × New Zealand
1 × Russia
1 × Taiwan
1 × USA
3 × Canada
3 × Hungary
Collaborated with:
M.Kutrib M.Wendlandt H.Bordihn C.Mereghetti B.Palano G.Pighizzini L.Werlein D.Wotschke C.Choffrut M.Holzer
Talks about:
automata (18) finit (10) communic (7) head (5) pushdown (4) parallel (4) languag (3) context (3) driven (3) comput (3)

Person: Andreas Malcher

DBLP DBLP: Malcher:Andreas

Contributed to:

AFL 20142014
DLT 20142014
CIAA 20132013
CIAA 20132015
DLT 20132013
DLT 20132014
DLT 20122012
CIAA 20102010
DLT 20102010
DLT 20102011
LATA 20102010
CIAA 20092009
AFL 20082008
CIAA 20082010
DLT 20082008
CIAA 20072007
DLT 20072007
LATA 20072007
DLT 20062006
DLT 20042004
DLT 20032003
AFL 20172017

Wrote 24 papers:

AFL-2014-BordihnKM #automaton #communication #finite #parallel
Measuring Communication in Parallel Communicating Finite Automata (HB, MK, AM), pp. 124–138.
DLT-2014-KutribM #automaton #communication
Measuring Communication in Automata Systems — (MK, AM), pp. 260–274.
DLT-2014-KutribMW #automaton #set
Deterministic Set Automata (MK, AM, MW), pp. 303–314.
CIAA-2013-KutribMMPW #automaton #decidability #finite #queue
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties (MK, AM, CM, BP, MW), pp. 232–243.
CIAA-J-2013-KutribMMPW15 #automaton #decidability #finite #queue
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties (MK, AM, CM, BP, MW), pp. 58–71.
DLT-2013-KutribMW #automaton #finite #multi
One-Way Multi-Head Finite Automata with Pebbles But No States (MK, AM, MW), pp. 313–324.
DLT-J-2013-KutribMW14a #automaton #finite #multi
Stateless One-Way Multi-Head Finite Automata with Pebbles (MK, AM, MW), pp. 1141–1160.
DLT-2012-KutribMW #automaton #finite #multi
States and Heads Do Count for Unary Multi-head Finite Automata (MK, AM, MW), pp. 214–225.
CIAA-2010-KutribM
Two-Party Watson-Crick Computations (MK, AM), pp. 191–200.
DLT-2010-BordihnKM #automaton #communication #finite #parallel
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 88–99.
DLT-J-2010-BordihnKM11 #automaton #communication #finite #parallel
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata (HB, MK, AM), pp. 1577–1592.
LATA-2010-ChoffrutMMP #on the #power of
On the Expressive Power of FO[+] (CC, AM, CM, BP), pp. 190–201.
LATA-2010-KutribM #automaton
Reversible Pushdown Automata (MK, AM), pp. 368–379.
CIAA-2009-KutribM #automaton #communication
Cellular Automata with Sparse Communication (MK, AM), pp. 34–43.
AFL-2008-MalcherMP #array #bound
Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 292–301.
AFL-J-2008-MalcherMP10 #array #bound
Sublinearly Space Bounded Iterative Arrays (AM, CM, BP), pp. 843–858.
DLT-2008-BordihnKM #automaton #capacity #communication #finite #on the #parallel
On the Computational Capacity of Parallel Communicating Finite Automata (HB, MK, AM), pp. 146–157.
CIAA-2007-KutribMW #automaton #nondeterminism
Regulated Nondeterminism in Pushdown Automata (MK, AM, LW), pp. 85–96.
DLT-2007-MalcherP #bound #complexity #context-free grammar
Descriptional Complexity of Bounded Context-Free Languages (AM, GP), pp. 312–323.
LATA-2007-KutribM #automaton #performance #recognition #using
Fast Reversible Language Recognition Using Cellular Automata (MK, AM), pp. 331–342.
DLT-2006-KutribM #automaton #nondeterminism
Context-Dependent Nondeterminism for Pushdown Automata (MK, AM), pp. 133–144.
DLT-2004-KutribMW #context-free grammar #linear
The Boolean Closure of Linear Context-Free Languages (MK, AM, DW), pp. 284–295.
DLT-2003-Malcher #automaton #finite
Minimizing Finite Automata Is Computationally Hard (AM), pp. 386–397.
AFL-2017-HolzerKMW #automaton
Input-Driven Double-Head Pushdown Automata (MH, MK, AM, MW), pp. 128–142.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.