default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Malcher
Person information
- affiliation: University of Giessen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j72]Martin Kutrib
, Andreas Malcher:
Reversible Computations of One-Way Counter Automata. RAIRO Theor. Informatics Appl. 58: 5 (2024)- [j71]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
On the power of pushing or stationary moves for input-driven pushdown automata. Theor. Comput. Sci. 996: 114503 (2024) - [c88]Martin Kutrib, Andreas Malcher:
Cellular Automata: Communication Matters. CiE 2024: 32-43 - [c87]Martin Kutrib, Andreas Malcher:
Cellular Automata: From Black-and-White to High Gloss Color. DLT 2024: 22-36 - [c86]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
Deterministic Pushdown Automata with Translucent Input Letters. DLT 2024: 203-217 - [c85]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Priscilla Raucci, Matthias Wendlandt:
On Properties of Languages Accepted by Deterministic Pushdown Automata with Translucent Input Letters. CIAA 2024: 208-220 - [c84]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Unary Exclusive Nondeterministic Finite Automata. NCMA 2024: 136-149 - 2023
- [j70]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. J. Autom. Lang. Comb. 28(1-3): 59-88 (2023) - [j69]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated uniform finite-state transducers on unary languages. Theor. Comput. Sci. 969: 114049 (2023) - [c83]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Complexity of Exclusive Nondeterministic Finite Automata. DCFS 2023: 121-133 - [c82]Martin Kutrib, Andreas Malcher:
Reversible Two-Party Computations. AFL 2023: 142-154 - 2022
- [j68]Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite automata with undirected state graphs. Acta Informatica 59(1): 163-181 (2022) - [j67]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. Fundam. Informaticae 185(4): 337-356 (2022) - [j66]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional complexity of iterated uniform finite-state transducers. Inf. Comput. 284: 104691 (2022) - [j65]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. Int. J. Found. Comput. Sci. 33(3&4): 285-311 (2022) - [j64]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. J. Autom. Lang. Comb. 27(1-3): 47-77 (2022) - [j63]Martin Kutrib, Andreas Malcher:
Iterative arrays with finite inter-cell communication. Nat. Comput. 21(1): 3-15 (2022) - [j62]Martin Kutrib, Andreas Malcher:
One-dimensional pattern generation by cellular automata. Nat. Comput. 21(3): 361-375 (2022) - [c81]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
On the Power of Pushing or Stationary Moves for Input-Driven Pushdown Automata. CIAA 2022: 140-151 - [c80]Martin Kutrib, Andreas Malcher:
Reversible Computations of One-Way Counter Automata. NCMA 2022: 126-142 - [i2]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers. CoRR abs/2205.15631 (2022) - 2021
- [j61]Henning Fernau, Andreas Malcher, Giovanni Pighizzini:
Preface to Martin Kutrib Festschrift. Acta Informatica 58(4): 241-242 (2021) - [j60]Martin Kutrib, Andreas Malcher:
String Generation by Cellular Automata. Complex Syst. 30(2): 111-132 (2021) - [j59]Andreas Malcher:
Decidability Questions for Insertion Systems and Related Models. Fundam. Informaticae 180(1-2): 53-76 (2021) - [j58]Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible pushdown transducers. Inf. Comput. 281: 104813 (2021) - [j57]Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. RAIRO Theor. Informatics Appl. 55: 1-19 (2021) - [j56]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-driven multi-counter automata. Theor. Comput. Sci. 870: 121-136 (2021) - [c79]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Transduction on Unary Languages. ICTCS 2021: 87-92 - [c78]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers on Unary Languages. SOFSEM 2021: 218-232 - 2020
- [j55]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Reversible Pushdown and Queue Machines by Preprocessing. Int. J. Found. Comput. Sci. 31(8): 1021-1049 (2020) - [j54]Andreas Malcher:
Hierarchies and undecidability results for iterative arrays with sparse communication. Nat. Comput. 19(4): 797-809 (2020) - [c77]Martin Kutrib, Andreas Malcher:
One-Dimensional Pattern Generation by Cellular Automata. ACRI 2020: 46-55 - [c76]Martin Kutrib, Andreas Malcher:
Cellular String Generators. Automata 2020: 59-70 - [c75]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power. CiE 2020: 87-99 - [c74]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion. DCFS 2020: 117-129
2010 – 2019
- 2019
- [j53]Andreas Malcher:
Report on DCFS 2019. Bull. EATCS 129 (2019) - [j52]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing reversibly with finite state machines. Theor. Comput. Sci. 787: 111-126 (2019) - [c73]Martin Kutrib, Andreas Malcher:
Iterative Arrays with Finite Inter-cell Communication. Automata 2019: 35-47 - [c72]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Iterated Uniform Finite-State Transducers. DCFS 2019: 223-234 - [c71]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Iterated Uniform Finite-State Transducers. ICTCS 2019: 52-57 - [c70]Martin Kutrib, Andreas Malcher:
Digging input-driven pushdown automata. NCMA 2019: 109-124 - [c69]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Multi-counter Automata. CIAA 2019: 197-208 - 2018
- [j51]Andreas Malcher:
Report on DCFS 2018. Bull. EATCS 126 (2018) - [j50]Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. RAIRO Theor. Informatics Appl. 52(2-3-4): 89-110 (2018) - [c68]Andreas Malcher:
Hierarchies and Undecidability Results for Iterative Arrays with Sparse Communication. Automata 2018: 100-112 - [c67]Martin Kutrib, Andreas Malcher, Christian Schneider:
Finite Automata with Undirected State Graphs. DCFS 2018: 212-223 - [c66]Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero:
Reversible Pushdown Transducers. DLT 2018: 354-365 - [c65]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Pushdown and Queue Machines by Preprocessing. CIAA 2018: 28-40 - [p2]Martin Kutrib, Andreas Malcher:
Cellular Automata: Descriptional Complexity and Decidability. Reversibility and Universality 2018: 129-168 - [p1]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Queue Automata: Foundations and Developments. Reversibility and Universality 2018: 385-431 - 2017
- [j49]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown, Counter, and Stack Automata. Fundam. Informaticae 155(1-2): 59-88 (2017) - [j48]Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. J. Autom. Lang. Comb. 22(1-3): 93-121 (2017) - [j47]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Shrinking one-way cellular automata. Nat. Comput. 16(3): 383-396 (2017) - [j46]Martin Kutrib, Andreas Malcher:
One-way reversible multi-head finite automata. Theor. Comput. Sci. 682: 149-164 (2017) - [c64]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Fast One-Way Cellular Automata with Reversible Mealy Cells. AUTOMATA 2017: 139-150 - [c63]Andreas Malcher:
Decidability questions for insertion systems. NCMA 2017: 165-180 - [c62]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Transducing Reversibly with Finite State Machines. CIAA 2017: 151-162 - [c61]Markus Holzer, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Double-Head Pushdown Automata. AFL 2017: 128-142 - 2016
- [j45]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible Queue Automata. Fundam. Informaticae 148(3-4): 341-368 (2016) - [j44]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Set Automata. Int. J. Found. Comput. Sci. 27(2): 187-214 (2016) - [j43]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversiblity. RAIRO Theor. Informatics Appl. 50(4): 313-330 (2016) - [j42]Martin Kutrib, Andreas Malcher:
Iterative Arrays with Set Storage. J. Cell. Autom. 12(1-2): 7-26 (2016) - [c60]Andrea Herrmann, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Descriptional Complexity of Bounded Regular Languages. DCFS 2016: 138-152 - [c59]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Input-Driven Queue Automata with Internal Transductions. LATA 2016: 156-167 - [c58]Holger Bock Axelsen, Markus Holzer, Martin Kutrib, Andreas Malcher:
Reversible Shrinking Two-Pushdown Automata. LATA 2016: 579-591 - [c57]Simon Beier, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Diving into the queue. NCMA 2016: 89-104 - [c56]Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Boosting Reversible Pushdown Machines by Preprocessing. RC 2016: 89-104 - 2015
- [j41]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Returning Parallel Communicating Finite Automata with Communication Bounds: Hierarchies, Decidabilities, and Undecidabilities. Int. J. Found. Comput. Sci. 26(8): 1101-1126 (2015) - [j40]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Deterministic input-driven queue automata: Finite turns, decidability, and closure properties. Theor. Comput. Sci. 578: 58-71 (2015) - [c55]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Shrinking One-Way Cellular Automata. Automata 2015: 141-154 - [c54]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Tinput-Driven Pushdown Automata. MCU 2015: 94-112 - [c53]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
When input-driven pushdown automata meet reversibility. NCMA 2015: 141-157 - [c52]Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher:
A Hierarchy of Fast Reversible Turing Machines. RC 2015: 29-44 - 2014
- [j39]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Head and state hierarchies for unary multi-head finite automata. Acta Informatica 51(8): 553-569 (2014) - [j38]Martin Kutrib, Andreas Malcher, Giovanni Pighizzini:
Oblivious two-way finite automata: Decidability and complexity. Inf. Comput. 237: 294-302 (2014) - [j37]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Simulations of Unary One-Way Multi-Head Finite Automata. Int. J. Found. Comput. Sci. 25(7): 877-896 (2014) - [j36]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Stateless One-Way Multi-Head Finite Automata with Pebbles. Int. J. Found. Comput. Sci. 25(8): 1141-1160 (2014) - [j35]Jarkko Kari, Martin Kutrib, Andreas Malcher:
Preface. J. Cell. Autom. 9(5-6): 339 (2014) - [c51]Martin Kutrib, Andreas Malcher:
Iterative Arrays with Set Storage. ACRI 2014: 25-34 - [c50]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Real-Time Reversible One-Way Cellular Automata. Automata 2014: 56-69 - [c49]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Regularity and Size of Set Automata. DCFS 2014: 282-293 - [c48]Martin Kutrib, Andreas Malcher:
Measuring Communication in Automata Systems - (Invited Paper). Developments in Language Theory 2014: 260-274 - [c47]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Deterministic Set Automata. Developments in Language Theory 2014: 303-314 - [c46]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Reversible queue automata. NCMA 2014: 163-178 - [c45]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Measuring Communication in Parallel Communicating Finite Automata. AFL 2014: 124-138 - 2013
- [j34]Martin Kutrib, Andreas Malcher:
One-Dimensional Cellular Automaton Transducers. Fundam. Informaticae 126(2-3): 201-224 (2013) - [j33]Andreas Malcher, Giovanni Pighizzini:
Descriptional complexity of bounded context-free languages. Inf. Comput. 227: 1-20 (2013) - [c44]Viliam Geffert, Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
A Direct Construction of Finite State Automata for Pushdown Store Languages. DCFS 2013: 90-101 - [c43]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
Size of Unary One-Way Multi-head Finite Automata. DCFS 2013: 148-159 - [c42]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
One-Way Multi-Head Finite Automata with Pebbles But No States. Developments in Language Theory 2013: 313-324 - [c41]Martin Kutrib, Andreas Malcher, Carlo Mereghetti, Beatrice Palano, Matthias Wendlandt:
Input-Driven Queue Automata: Finite Turns, Decidability, and Closure Properties. CIAA 2013: 232-243 - [e1]Jarkko Kari, Martin Kutrib, Andreas Malcher:
Cellular Automata and Discrete Complex Systems - 19th International Workshop, AUTOMATA 2013, Gießen, Germany, September 17-19, 2013. Proceedings. Lecture Notes in Computer Science 8155, Springer 2013, ISBN 978-3-642-40866-3 [contents] - 2012
- [j32]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
First-order logics: some characterizations and closure properties. Acta Informatica 49(4): 225-248 (2012) - [j31]Andreas Malcher:
Report from DCFS 2012. Bull. EATCS 108: 168-169 (2012) - [j30]Martin Kappes, Andreas Malcher, Detlef Wotschke:
In Memoriam Chandra Kintala. Int. J. Found. Comput. Sci. 23(1): 5-19 (2012) - [j29]Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 23(3): 713-732 (2012) - [j28]Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Pushdown Store Languages. J. Autom. Lang. Comb. 17(2-4): 225-244 (2012) - [j27]Martin Kutrib, Andreas Malcher:
The Size Impact of Little Iterative Array Resources. J. Cell. Autom. 7(5-6): 489-507 (2012) - [j26]Martin Kutrib, Andreas Malcher:
Reversible pushdown automata. J. Comput. Syst. Sci. 78(6): 1814-1827 (2012) - [j25]Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional complexity of two-way pushdown automata with restricted head reversals. Theor. Comput. Sci. 449: 119-133 (2012) - [c40]Martin Kutrib, Andreas Malcher:
Iterative Arrays: Little Resources Big Size Impact. ACRI 2012: 42-51 - [c39]Andreas Malcher, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Pushdown Store Languages. DCFS 2012: 209-221 - [c38]Martin Kutrib, Andreas Malcher, Matthias Wendlandt:
States and Heads Do Count for Unary Multi-head Finite Automata. Developments in Language Theory 2012: 214-225 - [c37]Suna Bensch, Markus Holzer, Martin Kutrib, Andreas Malcher:
Input-Driven Stack Automata. IFIP TCS 2012: 28-42 - [c36]Martin Kutrib, Andreas Malcher, Giovanni Pighizzini:
Oblivious Two-Way Finite Automata: Decidability and Complexity. LATIN 2012: 518-529 - [c35]Martin Kutrib, Andreas Malcher:
One-Way Reversible Multi-head Finite Automata. RC 2012: 14-28 - [c34]Martin Kutrib, Andreas Malcher:
Transductions Computed by One-Dimensional Cellular Automata. AUTOMATA & JAC 2012: 194-207 - 2011
- [j24]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Int. J. Found. Comput. Sci. 22(7): 1577-1592 (2011) - [j23]Markus Holzer, Martin Kutrib, Andreas Malcher:
Complexity of multi-head finite automata: Origins and directions. Theor. Comput. Sci. 412(1-2): 83-96 (2011) - [j22]Martin Kutrib, Andreas Malcher:
Cellular automata with limited inter-cell bandwidth. Theor. Comput. Sci. 412(30): 3917-3931 (2011) - [c33]Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Descriptional Complexity of Two-Way Pushdown Automata with Restricted Head Reversals. DCFS 2011: 248-260 - 2010
- [j21]Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Sublinearly Space Bounded Iterative Arrays. Int. J. Found. Comput. Sci. 21(5): 843-858 (2010) - [j20]Martin Kutrib, Andreas Malcher:
One-Way Cellular Automata, Bounded Languages, and Minimal Communication. J. Autom. Lang. Comb. 15(1/2): 135-153 (2010) - [j19]Martin Kutrib, Andreas Malcher:
Real-time reversible iterative arrays. Theor. Comput. Sci. 411(4-5): 812-822 (2010) - [j18]Martin Kutrib, Andreas Malcher:
Cellular automata with sparse communication. Theor. Comput. Sci. 411(38-39): 3516-3526 (2010) - [c32]Martin Kutrib, Jonas Lefèvre, Andreas Malcher:
The Size of One-Way Cellular Automata. Automata 2010: 71-90 - [c31]Henning Bordihn, Martin Kutrib, Andreas Malcher:
Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. Developments in Language Theory 2010: 88-99 - [c30]Martin Kutrib, Andreas Malcher:
Measuring Communication in Cellular Automata. JAC 2010: 13-30 - [c29]Martin Kutrib, Andreas Malcher:
Transductions Computed by Iterative Arrays. JAC 2010: 156-167 - [c28]Christian Choffrut, Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
On the Expressive Power of FO[ + ]. LATA 2010: 190-201 - [c27]Martin Kutrib, Andreas Malcher:
Reversible Pushdown Automata. LATA 2010: 368-379 - [c26]Martin Kutrib, Andreas Malcher:
Two-Party Watson-Crick Computations. CIAA 2010: 191-200 - [c25]Martin Kappes, Andreas Malcher, Detlef Wotschke:
Remembering Chandra Kintala. DCFS 2010: 15-26
2000 – 2009
- 2009
- [j17]Jürgen Dassow, Andreas Malcher:
Editorial. J. Autom. Lang. Comb. 14(1): 5-6 (2009) - [j16]Martin Kutrib, Andreas Malcher:
Computations and Decidability of Iterative Arrays with Restricted Communication. Parallel Process. Lett. 19(2): 247-264 (2009) - [j15]Martin Kutrib, Andreas Malcher, Larissa Werlein:
Regulated nondeterminism in pushdown automata. Theor. Comput. Sci. 410(37): 3447-3460 (2009) - [c24]Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Logical Description of Structured and XML Languages. ICTCS 2009: 162-168 - [c23]Martin Kutrib, Andreas Malcher:
Cellular Automata with Sparse Communication. CIAA 2009: 34-43 - [c22]Martin Kutrib, Andreas Malcher:
Bounded Languages Meet Cellular Automata with Sparse Communication. DCFS 2009: 163-172 - [c21]Martin Kutrib, Andreas Malcher:
On One-way One-bit O (One)-message Cellular Automata. AUTOMATA 2009: 77-91 - [i1]Andreas Malcher, Giovanni Pighizzini:
Descriptional complexity of bounded context-free languages. CoRR abs/0905.1045 (2009) - 2008
- [j14]Martin Kutrib, Andreas Malcher, Detlef Wotschke:
The Boolean closure of linear context-free languages. Acta Informatica 45(3): 177-191 (2008) - [j13]Martin Kutrib, Andreas Malcher:
Fast reversible language recognition using cellular automata. Inf. Comput. 206(9-10): 1142-1151 (2008) - [j12]Remco Loos, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Splicing Systems. Int. J. Found. Comput. Sci. 19(4): 813-826 (2008) - [c20]Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Sublinearly Space Bounded Iterative Arrays. AFL 2008: 292-301 - [c19]Martin Kutrib, Andreas Malcher:
Real-time reversible language recognition by cellular automata. Automata 2008: 208-221 - [c18]Andreas Malcher, Carlo Mereghetti, Beatrice Palano:
Recent results on iterative arrays with small space bounds. Automata 2008: 222-227 - [c17]Henning Bordihn, Martin Kutrib, Andreas Malcher:
On the Computational Capacity of Parallel Communicating Finite Automata. Developments in Language Theory 2008: 146-157 - [c16]Markus Holzer, Martin Kutrib, Andreas Malcher:
Multi-Head Finite Automata: Characterizations, Concepts and Open Problems. CSP 2008: 93-107 - 2007
- [j11]Martin Kutrib, Andreas Malcher:
Finite turns and the regular closure of linear context-free languages. Discret. Appl. Math. 155(16): 2152-2164 (2007) - [j10]Martin Kutrib, Andreas Malcher:
When Church-Rosser Becomes Context Free. Int. J. Found. Comput. Sci. 18(6): 1293-1302 (2007) - [j9]Andreas Malcher, Bettina Sunckel:
On Metalinear Parallel Communicating Grammar Systems. Int. J. Found. Comput. Sci. 18(6): 1313-1322 (2007) - [j8]Andreas Malcher:
On Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata. J. Autom. Lang. Comb. 12(1-2): 265-277 (2007) - [j7]Martin Kutrib, Andreas Malcher:
Context-dependent nondeterminism for pushdown automata. Theor. Comput. Sci. 376(1-2): 101-111 (2007) - [c15]Remco Loos, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Splicing Systems. DCFS 2007: 93-104 - [c14]Andreas Malcher, Giovanni Pighizzini:
Descriptional Complexity of Bounded Context-Free Languages. Developments in Language Theory 2007: 312-323 - [c13]Martin Kutrib, Andreas Malcher:
Real-Time Reversible Iterative Arrays. FCT 2007: 376-387 - [c12]Martin Kutrib, Andreas Malcher:
Fast Reversible Language Recognition Using Cellular Automata. LATA 2007: 331-342 - [c11]Martin Kutrib, Andreas Malcher, Larissa Werlein:
Regulated Nondeterminism in Pushdown Automata. CIAA 2007: 85-96 - 2006
- [c10]Andreas Malcher:
Cellular Automata and Descriptional Complexity. DCFS 2006: 26-40 - [c9]Martin Kutrib, Andreas Malcher:
Context-Dependent Nondeterminism for Pushdown Automata. Developments in Language Theory 2006: 133-144 - [c8]Martin Kutrib, Andreas Malcher:
Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. IFIP TCS 2006: 151-164 - [c7]Martin Kutrib, Andreas Malcher:
Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. MFCS 2006: 634-645 - 2005
- [j6]Andreas Malcher:
On two-way communication in cellular automata with a fixed number of cells. Theor. Comput. Sci. 330(2): 325-338 (2005) - [c6]Andreas Malcher:
On Recursive and Non-Recursive Trade-Offs Between Finite-Turn Pushdown Automata. DCFS 2005: 215-226 - 2004
- [b1]Andreas Malcher:
Beschreibungskomplexität von Zellularautomaten. Goethe University Frankfurt, Frankfurt am Main, Germany, 2004, pp. 1-136 - [j5]Andreas Malcher:
On the Descriptional Complexity of Iterative Arrays. IEICE Trans. Inf. Syst. 87-D(3): 721-725 (2004) - [j4]Andreas Malcher:
Minimizing finite automata is computationally hard. Theor. Comput. Sci. 327(3): 375-390 (2004) - [c5]Martin Kutrib, Andreas Malcher, Detlef Wotschke:
The Boolean Closure of Linear Context-Free Languages. Developments in Language Theory 2004: 284-295 - 2003
- [j3]Andreas Malcher:
On One-Way Cellular Automata with a Fixed Number of Cells. Fundam. Informaticae 58(2003): 355-368 (2003) - [c4]Andreas Malcher:
On Two-Way Communication in Cellular Automata With a Fixed Number of Cells. DCFS 2003: 162-173 - [c3]Andreas Malcher:
Minimizing Finite Automata Is Computationally Hard. Developments in Language Theory 2003: 386-397 - 2002
- [j2]Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions. J. Autom. Lang. Comb. 7(4): 549-560 (2002) - [j1]Jonathan Goldstine, Martin Kappes, Chandra M. R. Kintala, Hing Leung, Andreas Malcher, Detlef Wotschke:
Descriptional Complexity of Machines with Limited Resources. J. Univers. Comput. Sci. 8(2): 193-234 (2002) - [c2]Andreas Malcher:
On One-Way Cellular Automata with a Fixed Number of Cells. DCFS 2002: 160-173 - 2001
- [c1]Andreas Malcher:
Descriptional Complexity of Cellular Automata and Decidability Questions. DCFS 2001: 123-131
Coauthor Index
[j72] [j71] [c88] [c87] [c86] [c85] [c84] [j70] [j69] [c83] [c82] [j68] [j67] [j66] [j65] [j64] [j63] [j62] [c81] [c80] [i2] [j60] [j58] [j57] [j56] [c79] [c78] [j55] [c77] [c76] [c75] [c74] [j52] [c73] [c72] [c71] [c70] [c69] [j50] [c67] [c66] [c65] [p2] [p1] [j49] [j48] [j47] [j46] [c64] [c62] [c61] [j45] [j44] [j43] [j42] [c60] [c59] [c58] [c57] [c56] [j41] [j40] [c55] [c54] [c53] [c52] [j39] [j38] [j37] [j36] [j35] [c51] [c50] [c49] [c48] [c47] [c46] [c45] [j34] [c43] [c42] [c41] [e1] [j29] [j27] [j26] [c40] [c38] [c37] [c36] [c35] [c34] [j24] [j23] [j22] [j20] [j19] [j18] [c32] [c31] [c30] [c29] [c27] [c26] [j16] [j15] [c23] [c22] [c21] [j14] [j13] [c19] [c17] [c16] [j11] [j10] [j7] [c13] [c12] [c11] [c9] [c8] [c7] [c5]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
