| 2009 |
|---|
| 64 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Reduction Graphs from Overlap Graphs for Gene Assembly in Ciliates.
Int. J. Found. Comput. Sci. 20(2): 271-291 (2009) |
| 63 | EE | Robert Brijder,
Hendrik Jan Hoogeboom:
Perfectly quilted rectangular snake tilings.
Theor. Comput. Sci. 410(16): 1486-1494 (2009) |
| 2008 |
|---|
| 62 | EE | Robert Brijder,
Hendrik Jan Hoogeboom:
Extending the Overlap Graph for Gene Assembly in Ciliates.
LATA 2008: 137-148 |
| 61 | EE | Robert Brijder,
Hendrik Jan Hoogeboom:
The fibers and range of reduction graphs in ciliates.
Acta Inf. 45(5): 383-402 (2008) |
| 60 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Michael Muskulus:
Strategies of loop recombination in ciliates.
Discrete Applied Mathematics 156(10): 1736-1753 (2008) |
| 59 | EE | Hendrik Jan Hoogeboom,
Walter A. Kosters,
Jeroen F. J. Laros:
Selection of DNA Markers.
IEEE Transactions on Systems, Man, and Cybernetics, Part C 38(1): 26-32 (2008) |
| 2007 |
|---|
| 58 | EE | Robert Brijder,
Hendrik Jan Hoogeboom:
Characterizing Reduction Graphs for Gene Assembly in Ciliates.
Developments in Language Theory 2007: 120-131 |
| 57 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
From Micro to Macro: How the Overlap Graph Determines the Reduction Graph in Ciliates.
FCT 2007: 149-160 |
| 56 | EE | André H. Deutz,
Rudy van Vliet,
Hendrik Jan Hoogeboom:
High Spies (or How to Win a Programming Contest).
FUN 2007: 93-107 |
| 55 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom,
Bart Samwel:
XML transformation by tree-walking transducers with invisible pebbles.
PODS 2007: 63-72 |
| 54 | EE | Robert Brijder,
Hendrik Jan Hoogeboom:
Extending the Overlap Graph for Gene Assembly in Ciliates
CoRR abs/0712.3380: (2007) |
| 53 | EE | Robert Brijder,
Hendrik Jan Hoogeboom:
The Fibers and Range of Reduction Graphs in Ciliates
CoRR abs/cs/0702041: (2007) |
| 52 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
How Overlap Determines the Macronuclear Genes in Ciliates
CoRR abs/cs/0702171: (2007) |
| 51 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure
CoRR abs/cs/0703079: (2007) |
| 50 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Finitary Compositions of Two-way Finite-State Transductions.
Fundam. Inform. 80(1-3): 111-123 (2007) |
| 49 | EE | Yan Gao,
Hendrik Jan Hoogeboom:
P Systems with Single passenger Carriers.
Int. J. Found. Comput. Sci. 18(6): 1227-1235 (2007) |
| 48 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure.
Logical Methods in Computer Science 3(2): (2007) |
| 2006 |
|---|
| 47 | | Hendrik Jan Hoogeboom,
Gheorghe Paun,
Grzegorz Rozenberg,
Arto Salomaa:
Membrane Computing, 7th International Workshop, WMC 2006, Leiden, The Netherlands, July 17-21, 2006, Revised, Selected, and Invited Papers
Springer 2006 |
| 46 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Michael Muskulus:
Applicability of Loop Recombination in Ciliates Using the Breakpoint Graph.
CompLife 2006: 97-106 |
| 45 | EE | Matteo Cavaliere,
Pierluigi Frisco,
Hendrik Jan Hoogeboom:
Computing by Only Observing.
Developments in Language Theory 2006: 304-314 |
| 44 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Nested Pebbles and Transitive Closure.
STACS 2006: 477-488 |
| 43 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Reducibility of Gene Patterns in Ciliates using the Breakpoint Graph
CoRR abs/cs/0601122: (2006) |
| 42 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Michael Muskulus:
Strategies of Loop Recombination in Ciliates
CoRR abs/cs/0601135: (2006) |
| 41 | EE | Rudy van Vliet,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
The Construction of Minimal DNA Expressions.
Natural Computing 5(2): 127-149 (2006) |
| 40 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Reducibility of gene patterns in ciliates using the breakpoint graph.
Theor. Comput. Sci. 356(1-2): 26-45 (2006) |
| 2005 |
|---|
| 39 | EE | Robert Brijder,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
The Breakpoint Graph in Ciliates.
CompLife 2005: 128-139 |
| 2004 |
|---|
| 38 | EE | Rudy van Vliet,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Combinatorial Aspects of Minimal DNA Expressions.
DNA 2004: 375-388 |
| 37 | EE | Pierluigi Frisco,
Hendrik Jan Hoogeboom:
P systems with symport/antiport simulating counter automata.
Acta Inf. 41(2-3): 145-170 (2004) |
| 36 | EE | Hendrik Jan Hoogeboom,
Walter A. Kosters:
Tetris and decidability.
Inf. Process. Lett. 89(6): 267-272 (2004) |
| 35 | EE | Ron Breukelaar,
Erik D. Demaine,
Susan Hohenberger,
Hendrik Jan Hoogeboom,
Walter A. Kosters,
David Liben-Nowell:
Tetris is hard, even to approximate.
Int. J. Comput. Geometry Appl. 14(1-2): 41-68 (2004) |
| 34 | EE | Hendrik Jan Hoogeboom,
Walter A. Kosters:
How to Construct Tetris Configurations.
Int. J. Intell. Games & Simulation 3(2): 97-105 (2004) |
| 2003 |
|---|
| 33 | EE | Vesa Halava,
Tero Harju,
Hendrik Jan Hoogeboom,
Michel Latteux:
Languages Defined by Generalized Equality Sets.
FCT 2003: 355-363 |
| 2002 |
|---|
| 32 | EE | Hendrik Jan Hoogeboom:
Carriers and Counters: P Systems with Carriers vs. (Blind) Counter Automata.
Developments in Language Theory 2002: 140-151 |
| 31 | EE | Hendrik Jan Hoogeboom,
Nike van Vugt:
Upper Bounds for Restricted Splicing.
Formal and Natural Computing 2002: 361-375 |
| 30 | EE | Pierluigi Frisco,
Hendrik Jan Hoogeboom:
Simulating Counter Automata by P Systems with Symport/Antiport.
WMC-CdeA 2002: 288-301 |
| 29 | | Pierluigi Frisco,
Hendrik Jan Hoogeboom,
Paul Sant:
A Direct Construction of a Universal P System.
Fundam. Inform. 49(1-3): 103-122 (2002) |
| 2001 |
|---|
| 28 | EE | Hendrik Jan Hoogeboom:
Context-Free Valence Grammars - Revisited.
Developments in Language Theory 2001: 293-303 |
| 27 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
MSO definable string transductions and two-way finite-state transducers.
ACM Trans. Comput. Log. 2(2): 216-254 (2001) |
| 26 | EE | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg,
Nike van Vugt:
Sequences of languages in forbidding-enforcing families.
Soft Comput. 5(2): 121-125 (2001) |
| 2000 |
|---|
| 25 | EE | Hendrik Jan Hoogeboom,
Nike van Vugt:
Fair sticker languages.
Acta Inf. 37(3): 213-225 (2000) |
| 1999 |
|---|
| 24 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Two-Way Finite State Transducers and Monadic Second-Order Logic.
ICALP 1999: 311-320 |
| 23 | | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Tree-Walking Pebble Automata.
Jewels are Forever 1999: 72-83 |
| 22 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom,
Jan-Pascal Van Best:
Trips on Trees.
Acta Cybern. 14(1): 51-64 (1999) |
| 21 | EE | Joost Engelfriet,
Hendrik Jan Hoogeboom:
MSO definable string transductions and two-way finite state transducers
CoRR cs.LO/9906007: (1999) |
| 1997 |
|---|
| 20 | EE | Hendrik Jan Hoogeboom,
Anca Muscholl:
The Code Problem for Traces - Improving the Boundaries.
Theor. Comput. Sci. 172(1-2): 309-321 (1997) |
| 19 | | Hendrik Jan Hoogeboom,
Paulien ten Pas:
Monadic Second-Order Definable Text Languages.
Theory Comput. Syst. 30(4): 335-354 (1997) |
| 1996 |
|---|
| 18 | | Hendrik Jan Hoogeboom,
Paulien ten Pas:
Text Languages in an Algebraic Framework.
Fundam. Inform. 25(3): 353-380 (1996) |
| 1994 |
|---|
| 17 | | Hendrik Jan Hoogeboom,
Paulien ten Pas:
MSO Definable Text Languages.
MFCS 1994: 413-422 |
| 16 | | Tero Harju,
Hendrik Jan Hoogeboom,
H. C. M. Kleijn:
Identities and Transductions.
Results and Trends in Theoretical Computer Science 1994: 140-144 |
| 15 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Combinatorial Properties of Dependence Graphs
Inf. Comput. 114(2): 315-328 (1994) |
| 1993 |
|---|
| 14 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Paulien ten Pas,
Grzegorz Rozenberg:
An Introduction to Context-free Text Grammars.
Developments in Language Theory 1993: 357-369 |
| 13 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
On the Structure of Recognizable Languages of Dependence Graphs.
ITA 27(1): 7-22 (1993) |
| 12 | | Joost Engelfriet,
Hendrik Jan Hoogeboom:
X-Automata on omega-Words.
Theor. Comput. Sci. 110(1): 1-51 (1993) |
| 1991 |
|---|
| 11 | | Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Diamond properties of elementary net systems.
Fundam. Inform. 14(3): 287-300 (1991) |
| 1989 |
|---|
| 10 | | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Automata with Storage on Infinite Words.
ICALP 1989: 289-303 |
| 9 | | IJsbrand Jan Aalbersberg,
Hendrik Jan Hoogeboom:
Characterizations of the Decidability of Some Problems for Regular Trace Languages.
Mathematical Systems Theory 22(1): 1-19 (1989) |
| 1988 |
|---|
| 8 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Recording the Use of Memory in Right-Boundary Grammars and Push-Down Automata.
Acta Inf. 25(2): 203-231 (1988) |
| 7 | | Joost Engelfriet,
Hendrik Jan Hoogeboom:
Prefix and Equality Languages of Rational Functions are Co-Context-Free.
Inf. Process. Lett. 28(2): 77-79 (1988) |
| 1987 |
|---|
| 6 | | IJsbrand Jan Aalbersberg,
Hendrik Jan Hoogeboom:
Decision Problems for Regular Trace Languages.
ICALP 1987: 250-259 |
| 1986 |
|---|
| 5 | | Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Infinitary Languages: Basic Theory an Applications to Concurrent Systems.
Current Trends in Concurrency 1986: 266-342 |
| 4 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Coordinated Pair Systems; Part I: Dyck Works and Classical Pumping.
ITA 20(4): 405-424 (1986) |
| 3 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
Coordinated Pair Systems; Part II: Sparse Structure of Dyck Words and Ogden's Lemma.
ITA 20(4): 425-439 (1986) |
| 2 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
On the Active and Full Use of Memory in Right-Boundary Grammars and Push-Down Automata.
Theor. Comput. Sci. 48(3): 201-228 (1986) |
| 1985 |
|---|
| 1 | | Andrzej Ehrenfeucht,
Hendrik Jan Hoogeboom,
Grzegorz Rozenberg:
On coordinated rewriting.
FCT 1985: 100-111 |
