The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hendrik Jan Hoogeboom: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  53. Pivot and Loop Complementation on Graphs and Set Systems. [Citation Graph (, )][DBLP]


  54. Extending the Overlap Graph for Gene Assembly in Ciliates. [Citation Graph (, )][DBLP]


  55. The fibers and range of reduction graphs in ciliates. [Citation Graph (, )][DBLP]


  56. Extending the Overlap Graph for Gene Assembly in Ciliates [Citation Graph (, )][DBLP]


  57. The Group Structure of Pivot and Loop Complementation on Graphs and Set Systems [Citation Graph (, )][DBLP]


  58. Maximal Pivots on Graphs with an Application to Gene Assembly [Citation Graph (, )][DBLP]


  59. Nullity Invariance for Pivot and the Interlace Polynomial [Citation Graph (, )][DBLP]


  60. Strategies of loop recombination in ciliates. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002