List

List of papers

2024

  1. Commutative N-polyregular functions Lopez, Aliaume arxiv:2404.02232v1
    BibTeX 
    @misc{LOPEZ24,
 archiveprefix = {arXiv},
 author = {Lopez, Aliaume},
 eprint = {2404.02232v1},
 primaryclass = {cs.LO},
 title = {Commutative N-polyregular functions},
 url = {https://arxiv.org/abs/2404.02232},
 year = {2024}
}
  2. Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width Lopez, Aliaume arxiv:2405.10894
    BibTeX 
    @misc{LOPEZ24,
 archiveprefix = {arXiv},
 author = {Lopez, Aliaume},
 eprint = {2405.10894},
 primaryclass = {cs.LO},
 title = {Labelled Well Quasi Ordered Classes of Bounded Linear Clique-Width},
 url = {https://arxiv.org/abs/2405.10894},
 year = {2024}
}

2023

  1. Optimization of string transducers Douéneau-Tabot, Gaëtan sha256:4EF3069A61
    BibTeX 
    @phdthesis{DOUE23,
 author = {Douéneau-Tabot, Gaëtan},
 school = {Université Paris Cité},
 sha256 = {4EF3069A61CFA903DE0EB573A0A098123D0135D3A0BE509BEF1C9998AB31D60F},
 title = {Optimization of string transducers},
 url = {https://gdoueneau.github.io/pages/DOUENEAU-TABOT_Optimization-transducers_v2.pdf},
 urldate = {Version of 24th November 2023},
 year = {2023}
}
  2. Refutations of pebble minimization via output languages Kiefer, Sandra Nguyễn, Lê Thành Dũng (Tito) Pradic, Cécilia arxiv:2301.09234v2 sha256:99939DDE8E
    BibTeX 
    @misc{KLEP23,
 archiveprefix = {arXiv},
 author = {Kiefer, Sandra and Nguyễn, Lê Thành Dũng (Tito) and Pradic, Cécilia},
 eprint = {2301.09234v2},
 primaryclass = {cs.FL},
 sha256 = {99939DDE8E11EDD1CEE0A183D50EF504DAD6870FEDDA173D892665C0EF27E10B},
 title = {Refutations of pebble minimization via output languages},
 year = {2023}
}
  3. {Z}-polyregular functions Colcombet, Thomas Douéneau-Tabot, Gaëtan Lopez, Aliaume doi:10.1109/LICS56636.2023.10175685 arxiv:2207.07450v4 sha256:060922DD2F
    BibTeX 
    @inproceedings{CDTL23,
 address = {Los Alamitos, CA, USA},
 author = {Colcombet, Thomas and Douéneau-Tabot, Gaëtan and Lopez, Aliaume},
 booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
 doi = {10.1109/LICS56636.2023.10175685},
 eprint = {2207.07450v4},
 month = {jun},
 pages = {1-13},
 publisher = {IEEE Computer Society},
 sha256 = {060922DD2F6FC229FFD967336B3A2F6CEC7E648558324552A1A831EE4C4E58CB},
 title = {{Z}-polyregular functions},
 url = {https://doi.ieeecomputersociety.org/10.1109/LICS56636.2023.10175685},
 year = {2023}
}
  4. On the Growth Rates of Polyregular Functions Bojańczyk, Mikołaj doi:10.1109/LICS56636.2023.10175808 arxiv:2212.11631 sha256:1140AA60C6
    BibTeX 
    @inproceedings{BOJA23,
 author = {Bojańczyk, Mikołaj},
 booktitle = {2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
 doi = {10.1109/LICS56636.2023.10175808},
 eprint = {2212.11631},
 keywords = {Computer science;Transducers;Computational modeling},
 pages = {1--13},
 sha256 = {1140AA60C6DEADDE3E1B743FC77E1B3270BE9C8A6769A2D87EB15E4B26934633},
 title = {On the Growth Rates of Polyregular Functions},
 year = {2023}
}
  5. Canonical decompositions in monadically stable and bounded shrubdepth graph classes Ohlmann, Pierre Pilipczul, Michał Toruńczyk, Szymon Przybyszewski, Wojciech arxiv:2303.01473 sha256:4B4F23FA3F
    BibTeX 
    @misc{OHPT23,
 archiveprefix = {arXiv},
 author = {Ohlmann, Pierre and Pilipczul, Michał and Toruńczyk, Szymon and Przybyszewski, Wojciech},
 eprint = {2303.01473},
 primaryclass = {cs.LO},
 sha256 = {4B4F23FA3F2860E81703AED96FC3ECFA718EBA68C2D173E9E1077C08E97F2421},
 title = {Canonical decompositions in monadically stable and bounded shrubdepth graph classes},
 year = {2023}
}
  6. First-Order Model Checking on Monadically Stable Graph Classes Dreier, Jan Eleftheriadis, Ioannis Mählmann, Nikolas McCarty, Rose Pilipczuk, Michał Toruńczyk, Szymon arxiv:2311.18740 sha256:1436C4275E
    BibTeX 
    @misc{DREI23,
 archiveprefix = {arXiv},
 author = {Dreier, Jan and Eleftheriadis, Ioannis and Mählmann, Nikolas and McCarty, Rose and Pilipczuk, Michał and Toruńczyk, Szymon},
 eprint = {2311.18740},
 primaryclass = {cs.LO},
 sha256 = {1436C4275ECF89ECC61075BE15AF12A6697DF59C48DBA2C58EAA5A4C1924A361},
 title = {First-Order Model Checking on Monadically Stable Graph Classes},
 year = {2023}
}
  7. Fixed Points and Noetherian Topologies Lopez, Aliaume doi:10.1007/978-3-031-30829-1_22 arxiv:2207.07614
    BibTeX 
    @inproceedings{LOPEZ23,
 author = {Lopez, Aliaume},
 booktitle = {Foundations of Software Science and Computation Structures},
 doi = {10.1007/978-3-031-30829-1_22},
 editor = {Kupferman, Orna and Sobocinski, Pawel},
 eprint = {2207.07614},
 isbn = {978-3-031-30828-4},
 pages = {456--476},
 publisher = {Springer Nature Switzerland},
 shortlocation = {FoSSACS'23},
 title = {Fixed Points and Noetherian Topologies},
 url = {https://link.springer.com/chapter/10.1007/978-3-031-30829-1_22},
 volume = {13992},
 year = {2023}
}

2022

  1. Transducers of polynomial growth Bojańczyk, Mikołaj doi:10.1145/3531130.3533326 sha256:2A4B5CB038
    BibTeX 
    @inproceedings{BOJA22,
 address = {New York, NY, USA},
 articleno = {1},
 author = {Bojańczyk, Mikołaj},
 booktitle = {Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science},
 doi = {10.1145/3531130.3533326},
 isbn = {9781450393515},
 location = {Haifa, Israel},
 numpages = {27},
 publisher = {Association for Computing Machinery},
 series = {LICS '22},
 sha256 = {2A4B5CB03817E6A29A761A8351560092C0B364D970FAB5896E3967B4D6F9C7AF},
 title = {Transducers of polynomial growth},
 year = {2022}
}
  2. {Hiding Pebbles When the Output Alphabet Is Unary} Douéneau-Tabot, Gaëtan doi:10.4230/LIPIcs.ICALP.2022.120 arxiv:2112.10212v4 sha256:E8CD4C0097
    BibTeX 
    @inproceedings{DOUE22,
 address = {Dagstuhl, Germany},
 author = {Douéneau-Tabot, Gaëtan},
 booktitle = {49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)},
 doi = {10.4230/LIPIcs.ICALP.2022.120},
 editor = {Bojańczyk, Mikołaj and Merelli, Emanuela and Woodruff, David P.},
 eprint = {2112.10212v4},
 isbn = {978-3-95977-235-8},
 issn = {1868-8969},
 pages = {120:1--120:17},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {E8CD4C0097A42998312B014C9E9A2B1E7C240BC5A6465BE11469A40B63EC5E0A},
 title = {{Hiding Pebbles When the Output Alphabet Is Unary}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.120},
 urn = {urn:nbn:de:0030-drops-164613},
 volume = {229},
 year = {2022}
}
  3. Hereditary classes of ordered sets of width at most two Pouzet, Maurice Zaguia, Imed arxiv:2112.02633v2 sha256:0B2FB89FA0
    BibTeX 
    @misc{POZA22,
 archiveprefix = {arXiv},
 author = {Pouzet, Maurice and Zaguia, Imed},
 eprint = {2112.02633v2},
 primaryclass = {math.CO},
 sha256 = {0B2FB89FA07F8E82E105821FB8C711CEB030DC5114B46141202DDA6A38F7DA10},
 title = {Hereditary classes of ordered sets of width at most two},
 year = {2022}
}

2021

  1. Comparison-Free Polyregular Functions Nguyễn, Lê Thành Dũng (Tito) Noûs, Camille Pradic, Cécilia doi:10.4230/LIPIcs.ICALP.2021.139 arxiv:2105.08358v2 sha256:6C9AEEC9B3
    BibTeX 
    @inproceedings{LENP21,
 address = {Dagstuhl, Germany},
 author = {Nguyễn, Lê Thành Dũng (Tito) and Noûs, Camille and Pradic, Cécilia},
 booktitle = {48th International Colloquium on Automata, Languages, and Programming (ICALP 2021)},
 doi = {10.4230/LIPIcs.ICALP.2021.139},
 editor = {Bansal, Nikhil and Merelli, Emanuela and Worrell, James},
 eprint = {2105.08358v2},
 hal_id = {hal-02986228},
 isbn = {978-3-95977-195-5},
 issn = {1868-8969},
 pages = {139:1--139:20},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {6C9AEEC9B395CCB504499123654CA95600601CC69836CBADE6EDECE2A345E693},
 title = {Comparison-Free Polyregular Functions},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2021.139},
 urn = {urn:nbn:de:0030-drops-142087},
 volume = {198},
 year = {2021}
}
  2. {Pebble Transducers with Unary Output} Douéneau-Tabot, Gaëtan doi:10.4230/LIPIcs.MFCS.2021.40 arxiv:2104.14019v6 sha256:016da0cf2a
    BibTeX 
    @inproceedings{DOUE21,
 address = {Dagstuhl, Germany},
 author = {Douéneau-Tabot, Gaëtan},
 booktitle = {46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021)},
 doi = {10.4230/LIPIcs.MFCS.2021.40},
 editor = {Bonchi, Filippo and Puglisi, Simon J.},
 eprint = {2104.14019v6},
 isbn = {978-3-95977-201-3},
 issn = {1868-8969},
 pages = {40:1--40:17},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {016da0cf2ae49f4c12ace6e9a89166ae359e7ddb06fcde98f3f7c041ba342403},
 title = {{Pebble Transducers with Unary Output}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2021.40},
 urn = {urn:nbn:de:0030-drops-144805},
 volume = {202},
 year = {2021}
}
  3. XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles Engelfriet, Joost Hoogeboom, Hendrik Jan Samwel, Bart doi:10.1016/j.tcs.2020.10.030 arxiv:1809.05730
    BibTeX 
    @article{EHS14,
 author = {Engelfriet, Joost and Hoogeboom, Hendrik Jan and Samwel, Bart},
 doi = {10.1016/j.tcs.2020.10.030},
 eprint = {1809.05730},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 keywords = {Tree transducers, Tree-walking automata, Pebbles, XML document navigation, XML document transformation},
 pages = {40-97},
 title = {XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles},
 url = {https://www.sciencedirect.com/science/article/pii/S0304397520306137},
 volume = {850},
 year = {2021}
}
  4. Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs Atminas, Aistis Brignall, Robert Lozin, Vadim V. Stacho, Juraj doi:10.1016/j.dam.2021.02.007 arxiv:1503.01628v3
    BibTeX 
    @article{ABLS21,
 author = {Atminas, Aistis and Brignall, Robert and Lozin, Vadim V. and Stacho, Juraj},
 doi = {10.1016/j.dam.2021.02.007},
 eprint = {1503.01628v3},
 issn = {0166-218X},
 journal = {Discrete Applied Mathematics},
 month = {May},
 pages = {57–69},
 publisher = {Elsevier BV},
 title = {Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs},
 url = {http://dx.doi.org/10.1016/j.dam.2021.02.007},
 volume = {295},
 year = {2021}
}
  5. SD-Regular Transducer Expressions for Aperiodic Transformations Dartois, Luc Gastin, Paul Krishna, Shankara Narayanan doi:10.1109/LICS52264.2021.9470738
    BibTeX 
    @inproceedings{DGK21,
 author = {Dartois, Luc and Gastin, Paul and Krishna, Shankara Narayanan},
 booktitle = {2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
 doi = {10.1109/LICS52264.2021.9470738},
 keywords = {Computer science;Transducers;Complexity theory;Delays;Synchronization;Time complexity},
 pages = {1-13},
 title = {SD-Regular Transducer Expressions for Aperiodic Transformations},
 year = {2021}
}

2020

  1. Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes Dabrowski, Konrad K. Lozin, Vadim V. Paulusma, Daniël doi:10.1016/j.jcss.2019.09.001 arxiv:1711.08837 sha256:63B5412EA1 sha256:2DA3B03F23
    BibTeX 
    @article{DLP17,
 archiveprefix = {arXiv},
 author = {Dabrowski, Konrad K. and Lozin, Vadim V. and Paulusma, Daniël},
 doi = {10.1016/j.jcss.2019.09.001},
 eprint = {1711.08837},
 issn = {0022-0000},
 journal = {Journal of Computer and System Sciences},
 keywords = {Clique-width, Forbidden induced subgraph, Hereditary graph class, Well-quasi-ordering},
 pages = {64-91},
 primaryclass = {math.CO},
 sha256 = {63B5412EA14AE900FA077449B7CA0660C0BB3C05C0974CA22A39DC29418F0BB4,
2DA3B03F23ED06FD4CCFD4C421028B07AE378B93456C7ED56823CA841D6C1E06},
 title = {Clique-width and Well-Quasi-Ordering of Triangle-Free Graph Classes},
 url = {https://www.sciencedirect.com/science/article/pii/S0022000018305087},
 volume = {108},
 year = {2020}
}
  2. On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders Džamonja, Mirna Schmitz, Sylvain Schnoebelen, Philippe doi:10.1007/978-3-030-30229-0_2
    BibTeX 
    @inbook{DZSCSC20,
 address = {Cham},
 author = {Džamonja, Mirna and Schmitz, Sylvain and Schnoebelen, Philippe},
 booktitle = {Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory},
 doi = {10.1007/978-3-030-30229-0_2},
 editor = {Schuster, Peter M. and Seisenberger, Monika and Weiermann, Andreas},
 isbn = {978-3-030-30229-0},
 pages = {29--54},
 publisher = {Springer International Publishing},
 title = {On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders},
 url = {https://doi.org/10.1007/978-3-030-30229-0_2},
 year = {2020}
}
  3. From Kruskal’s theorem to Friedman’s gap condition Freund, Anton doi:10.1017/S0960129520000298 sha256:1E6B0E5770
    BibTeX 
    @article{FREU20,
 author = {Freund, Anton},
 doi = {10.1017/S0960129520000298},
 journal = {Mathematical Structures in Computer Science},
 number = {8},
 pages = {952–975},
 sha256 = {1E6B0E577024D6527D64BB8D8E19DF9A42C1269E64D860C16C2F774285DEAA42},
 title = {From Kruskal’s theorem to Friedman’s gap condition},
 volume = {30},
 year = {2020}
}

2019

  1. {String-to-String Interpretations With Polynomial-Size Output} Bojańczyk, Mikołaj Kiefer, Sandra Lhote, Nathan doi:10.4230/LIPIcs.ICALP.2019.106 arxiv:1905.13190v1 sha256:9E83D8B092
    BibTeX 
    @inproceedings{BOKL19,
 address = {Dagstuhl, Germany},
 author = {Bojańczyk, Mikołaj and Kiefer, Sandra and Lhote, Nathan},
 booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
 doi = {10.4230/LIPIcs.ICALP.2019.106},
 editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
 eprint = {1905.13190v1},
 isbn = {978-3-95977-109-2},
 issn = {1868-8969},
 pages = {106:1--106:14},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {9E83D8B0929E94AD5EB0DF2CC1DA4F2609FE91CE874793BCE072479E30042BB6},
 title = {{String-to-String Interpretations With Polynomial-Size Output}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.106},
 urn = {urn:nbn:de:0030-drops-106821},
 volume = {132},
 year = {2019}
}
  2. {The Many Facets of String Transducers} Muscholl, Anca Puppis, Gabriele doi:10.4230/LIPIcs.STACS.2019.2 sha256:B50352E308
    BibTeX 
    @inproceedings{MUSC19,
 address = {Dagstuhl, Germany},
 annote = {Keywords: String transducers, complexity},
 author = {Muscholl, Anca and Puppis, Gabriele},
 booktitle = {36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019)},
 doi = {10.4230/LIPIcs.STACS.2019.2},
 editor = {Niedermeier, Rolf and Paul, Christophe},
 isbn = {978-3-95977-100-9},
 issn = {1868-8969},
 pages = {2:1--2:21},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {B50352E308A157F1DA786F6558109C45A57137EDC25160F133D1F1CA9CDF7958},
 title = {{The Many Facets of String Transducers}},
 url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2019.2},
 urn = {urn:nbn:de:0030-drops-102410},
 volume = {126},
 year = {2019}
}
  3. {Aperiodic Weighted Automata and Weighted First-Order Logic} Droste, Manfred Gastin, Paul doi:10.4230/LIPIcs.MFCS.2019.76 arxiv:1902.08149v3
    BibTeX 
    @inproceedings{DRGA19,
 address = {Dagstuhl, Germany},
 author = {Droste, Manfred and Gastin, Paul},
 booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
 doi = {10.4230/LIPIcs.MFCS.2019.76},
 editor = {Rossmanith, Peter and Heggernes, Pinar and Katoen, Joost-Pieter},
 eprint = {1902.08149v3},
 isbn = {978-3-95977-117-7},
 issn = {1868-8969},
 pages = {76:1--76:15},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 title = {{Aperiodic Weighted Automata and Weighted First-Order Logic}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2019.76},
 urn = {urn:nbn:de:0030-drops-110203},
 volume = {138},
 year = {2019}
}
  4. The Parametric Complexity of Lossy Counter Machines Schmitz, Sylvain doi:10.4230/LIPIcs.ICALP.2019.129
    BibTeX 
    @inproceedings{SCHMITZ19,
 address = {Dagstuhl, Germany},
 author = {Schmitz, Sylvain},
 booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)},
 doi = {10.4230/LIPIcs.ICALP.2019.129},
 editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano},
 isbn = {978-3-95977-109-2},
 issn = {1868-8969},
 pages = {129:1--129:15},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum für Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 title = {The Parametric Complexity of Lossy Counter Machines},
 url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.129},
 urn = {urn:nbn:de:0030-drops-107056},
 volume = {132},
 year = {2019}
}

2018

  1. An Algebraic Approach to MSO-Definability on Countable Linear Orderings Carton, Olivier Colcombet, Thomas Puppis, Gabriele
    BibTeX 
    @article{CACOPU18,
 author = {Carton, Olivier and Colcombet, Thomas and Puppis, Gabriele},
 issn = {00224812, 19435886},
 journal = {The Journal of Symbolic Logic},
 number = {3},
 pages = {1147--1189},
 publisher = {Association for Symbolic Logic, Cambridge University Press},
 title = {An Algebraic Approach to MSO-Definability on Countable Linear Orderings},
 url = {https://www.jstor.org/stable/26600366},
 urldate = {2024-10-18},
 volume = {83},
 year = {2018}
}
  2. First-order logic and aperiodic languages: a revisionist history Straubing, Howard doi:10.1145/3242953.3242956 sha256:41AE378973
    BibTeX 
    @article{STRA18,
 abstract = {A fundamental result about formal languages states:
Theorem 1 A regular language is first-order definable
if and only if its syntactic monoid contains no nontrivial groups.
Rest assured, we will explain in the next section exactly
what the various terms in the statement mean!},
 address = {New York, NY, USA},
 author = {Straubing, Howard},
 doi = {10.1145/3242953.3242956},
 issue_date = {July 2018},
 journal = {ACM SIGLOG News},
 month = {jul},
 number = {3},
 numpages = {17},
 pages = {4–20},
 publisher = {Association for Computing Machinery},
 sha256 = {41AE3789730E30BAEBD3E089D08CFA71139E99F06CD3491989F17A4809E6981D},
 title = {First-order logic and aperiodic languages: a revisionist history},
 url = {https://doi.org/10.1145/3242953.3242956},
 volume = {5},
 year = {2018}
}
  3. Polyregular Functions Bojańczyk, Mikołaj arxiv:1810.08760 sha256:A534D00239
    BibTeX 
    @misc{BOJA18,
 archiveprefix = {arXiv},
 author = {Bojańczyk, Mikołaj},
 eprint = {1810.08760},
 primaryclass = {cs.FL},
 sha256 = {A534D00239BAA743247DFF886C16DE982E6A5E997E54360CBC340F1FDB903D7E},
 title = {Polyregular Functions},
 url = {https://arxiv.org/abs/1810.08760},
 year = {2018}
}
  4. A counterexample regarding labelled well-quasi-ordering Brignall, Robert Engen, Michael Vatter, Vincent doi:10.1007/s00373-018-1962-0 arxiv:1709.10042 sha256:34E8DACB31
    BibTeX 
    @article{BEV18,
 archiveprefix = {arXiv},
 author = {Brignall, Robert and Engen, Michael and Vatter, Vincent},
 doi = {10.1007/s00373-018-1962-0},
 eprint = {1709.10042},
 journal = {Graphs and Combinatorics},
 pages = {1395-1409},
 primaryclass = {math.CO},
 sha256 = {34E8DACB31E1D9786938FF7EF87CB9C86CA13141563D9A859887058241070FF9},
 title = {A counterexample regarding labelled well-quasi-ordering},
 year = {2018}
}
  5. Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes Dabrowski, Konrad K. Lozin, Vadim V. Paulusma, Daniël doi:10.1016/j.jctb.2017.09.012 arxiv:1611.03671 sha256:5259DC87FA sha256:852613C695
    BibTeX 
    @article{DLP18,
 archiveprefix = {arXiv},
 author = {Dabrowski, Konrad K. and Lozin, Vadim V. and Paulusma, Daniël},
 doi = {10.1016/j.jctb.2017.09.012},
 eprint = {1611.03671},
 issn = {0095-8956},
 journal = {Journal of Combinatorial Theory, Series B},
 pages = {1-18},
 primaryclass = {math.CO},
 sha256 = {5259DC87FACDC3BD92998F9517721F87D9E9B5AE7789312E4E4660BD0852C3F3,
852613C69562AA5B6B93BA1F406E28F46CCC5EFF8925B85702790C430755DE09},
 title = {Well-Quasi-Ordering versus Clique-Width: New Results on Bigenic Classes},
 url = {https://www.sciencedirect.com/science/article/pii/S0095895617301004},
 volume = {130},
 year = {2018}
}
  6. Regular and First-Order List Functions Bojańczyk, Mikołaj Daviaud, Laure Krishna, Shankara Narayanan doi:10.1145/3209108.3209163
    BibTeX 
    @inproceedings{BDK18,
 address = {New York, NY, USA},
 author = {Bojańczyk, Mikołaj and Daviaud, Laure and Krishna, Shankara Narayanan},
 booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
 doi = {10.1145/3209108.3209163},
 isbn = {9781450355834},
 location = {Oxford, United Kingdom},
 numpages = {10},
 pages = {125–134},
 publisher = {Association for Computing Machinery},
 series = {LICS '18},
 title = {Regular and First-Order List Functions},
 url = {https://doi.org/10.1145/3209108.3209163},
 year = {2018}
}
  7. {On Canonical Models for Rational Functions over Infinite Words} Filiot, Emmanuel Gauwin, Olivier Lhote, Nathan Muscholl, Anca doi:10.4230/LIPIcs.FSTTCS.2018.30 sha256:827F80AC61
    BibTeX 
    @inproceedings{FGLM18,
 address = {Dagstuhl, Germany},
 author = {Filiot, Emmanuel and Gauwin, Olivier and Lhote, Nathan and Muscholl, Anca},
 booktitle = {38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018)},
 doi = {10.4230/LIPIcs.FSTTCS.2018.30},
 editor = {Ganguly, Sumit and Pandya, Paritosh},
 isbn = {978-3-95977-093-4},
 issn = {1868-8969},
 pages = {30:1--30:17},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {827F80AC61A8475C019B6DA64988447D707AC9CDB7E270F3E3B26DC8C023D15F},
 title = {{On Canonical Models for Rational Functions over Infinite Words}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2018.30},
 urn = {urn:nbn:de:0030-drops-99295},
 volume = {122},
 year = {2018}
}
  8. Polynomial Invariants for Affine Programs Hrushovski, Ehud Ouaknine, Joël Pouly, Amaury Worrell, James doi:10.1145/3209108.3209142 sha256:5FE6ECE8C5
    BibTeX 
    @inproceedings{HOPW18,
 address = {New York, NY, USA},
 author = {Hrushovski, Ehud and Ouaknine, Joël and Pouly, Amaury and Worrell, James},
 booktitle = {Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science},
 doi = {10.1145/3209108.3209142},
 isbn = {9781450355834},
 location = {Oxford, United Kingdom},
 numpages = {10},
 pages = {530–539},
 publisher = {Association for Computing Machinery},
 series = {LICS '18},
 sha256 = {5FE6ECE8C5E46199C916894504CD4F54E769689215A26FDE9FA88C888EBAFB20},
 title = {Polynomial Invariants for Affine Programs},
 url = {https://doi.org/10.1145/3209108.3209142},
 year = {2018}
}

2017

  1. {Optimizing Tree Decompositions in MSO} Bojanczyk, Mikolaj Pilipczuk, Michal doi:10.4230/LIPIcs.STACS.2017.15 sha256:528560FC3F
    BibTeX 
    @inproceedings{BOPIL17,
 address = {Dagstuhl, Germany},
 annote = {Keywords: tree decomposition, treewidth, transduction, monadic second-order logic},
 author = {Bojanczyk, Mikolaj and Pilipczuk, Michal},
 booktitle = {34th Symposium on Theoretical Aspects of Computer Science (STACS 2017)},
 doi = {10.4230/LIPIcs.STACS.2017.15},
 editor = {Vollmer, Heribert and Vall\'{e}e, Brigitte},
 isbn = {978-3-95977-028-6},
 issn = {1868-8969},
 pages = {15:1--15:13},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {528560FC3FAA0B25430743CD5E568CCB782EE658E20FF1AC2DDAAEAAEF6B1276},
 title = {{Optimizing Tree Decompositions in MSO}},
 url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2017.15},
 urn = {urn:nbn:de:0030-drops-70173},
 volume = {66},
 year = {2017}
}

2016

  1. {The Taming of the Semi-Linear Set} Chistikov, Dmitry Haase, Christoph doi:10.4230/LIPIcs.ICALP.2016.128 sha256:791B0C4916
    BibTeX 
    @inproceedings{CHHA16,
 address = {Dagstuhl, Germany},
 author = {Chistikov, Dmitry and Haase, Christoph},
 booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
 doi = {10.4230/LIPIcs.ICALP.2016.128},
 editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
 isbn = {978-3-95977-013-2},
 issn = {1868-8969},
 pages = {128:1--128:13},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {791B0C4916C84279A3528A85E42B31E7C887808400739CD6DAB6D0FF3CC0ACFD},
 title = {{The Taming of the Semi-Linear Set}},
 url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.128},
 urn = {urn:nbn:de:0030-drops-62636},
 volume = {55},
 year = {2016}
}
  2. Well-quasi-ordering does not imply bounded clique-width Lozin, Vadim V. Razgon, Igor Zamaraev, Viktor doi:10.1007/978-3-662-53174-7_25 arxiv:1503.00571v1 sha256:FA2B64283E
    BibTeX 
    @inproceedings{LRZ16,
 address = {Berlin, Heidelberg},
 archiveprefix = {arXiv},
 author = {Lozin, Vadim V. and Razgon, Igor and Zamaraev, Viktor},
 booktitle = {Graph-Theoretic Concepts in Computer Science},
 doi = {10.1007/978-3-662-53174-7_25},
 eprint = {1503.00571v1},
 isbn = {978-3-662-53173-0,978-3-662-53174-7},
 pages = {351--359},
 primaryclass = {cs.DM},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {FA2B64283E2F45830B7BDCCC6C12483F1DB81B96A7491024DE3CF94EB89BEC59},
 title = {Well-quasi-ordering does not imply bounded clique-width},
 year = {2016}
}
  3. {Aperiodicity of Rational Functions Is PSPACE-Complete} Filiot, Emmanuel Gauwin, Olivier Lhote, Nathan doi:10.4230/LIPIcs.FSTTCS.2016.13 sha256:2896E18ABB
    BibTeX 
    @inproceedings{FGL16,
 address = {Dagstuhl, Germany},
 author = {Filiot, Emmanuel and Gauwin, Olivier and Lhote, Nathan},
 booktitle = {36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)},
 doi = {10.4230/LIPIcs.FSTTCS.2016.13},
 editor = {Lal, Akash and Akshay, S. and Saurabh, Saket and Sen, Sandeep},
 isbn = {978-3-95977-027-9},
 issn = {1868-8969},
 pages = {13:1--13:15},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {2896E18ABB7F08A4988E82131FA797DEB8452349675ADE2747C292C1793D360D},
 title = {{Aperiodicity of Rational Functions Is PSPACE-Complete}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2016.13},
 urn = {urn:nbn:de:0030-drops-68482},
 volume = {65},
 year = {2016}
}
  4. {Minimizing Resources of Sweeping and Streaming String Transducers} Baschenis, Félix Gauwin, Olivier Muscholl, Anca Puppis, Gabriele doi:10.4230/LIPIcs.ICALP.2016.114
    BibTeX 
    @inproceedings{BGMP16,
 address = {Dagstuhl, Germany},
 author = {Baschenis, Félix and Gauwin, Olivier and Muscholl, Anca and Puppis, Gabriele},
 booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
 doi = {10.4230/LIPIcs.ICALP.2016.114},
 editor = {Chatzigiannakis, Ioannis and Mitzenmacher, Michael and Rabani, Yuval and Sangiorgi, Davide},
 isbn = {978-3-95977-013-2},
 issn = {1868-8969},
 pages = {114:1--114:14},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 title = {{Minimizing Resources of Sweeping and Streaming String Transducers}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2016.114},
 urn = {urn:nbn:de:0030-drops-62496},
 volume = {55},
 year = {2016}
}
  5. Aperiodic String Transducers Dartois, Luc Jecker, Ismaël Reynier, Pierre-Alain doi:10.1007/978-3-662-53132-7\_11
    BibTeX 
    @inproceedings{DJR16,
 author = {Dartois, Luc and Jecker, Ismaël and Reynier, Pierre-Alain},
 booktitle = {Developments in Language Theory - 20th International Conference, {DLT}
2016, Montr{\'{e}}al, Canada, July 25-28, 2016, Proceedings},
 doi = {10.1007/978-3-662-53132-7\_11},
 editor = {Srecko Brlek and
Christophe Reutenauer},
 pages = {125--137},
 publisher = {Springer},
 series = {Lecture Notes in Computer Science},
 title = {Aperiodic String Transducers},
 url = {https://doi.org/10.1007/978-3-662-53132-7\_11},
 volume = {9840},
 year = {2016}
}
  6. Complexity Hierarchies beyond Elementary Schmitz, Sylvain doi:10.1145/2858784
    BibTeX 
    @article{SCHMITZ16,
 address = {New York, NY, USA},
 articleno = {3},
 author = {Schmitz, Sylvain},
 doi = {10.1145/2858784},
 issn = {1942-3454},
 issue_date = {February 2016},
 journal = {ACM Trans. Comput. Theory},
 month = {February},
 number = {1},
 numpages = {36},
 publisher = {Association for Computing Machinery},
 title = {Complexity Hierarchies beyond Elementary},
 url = {https://doi.org/10.1145/2858784},
 volume = {8},
 year = {2016}
}

2015

  1. {One-way Definability of Sweeping Transducer} Baschenis, Félix Gauwin, Olivier Muscholl, Anca Puppis, Gabriele doi:10.4230/LIPIcs.FSTTCS.2015.178 arxiv:1706.01668v3 sha256:1D6A981F66
    BibTeX 
    @inproceedings{BGMP15,
 address = {Dagstuhl, Germany},
 author = {Baschenis, Félix and Gauwin, Olivier and Muscholl, Anca and Puppis, Gabriele},
 booktitle = {35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2015)},
 doi = {10.4230/LIPIcs.FSTTCS.2015.178},
 editor = {Harsha, Prahladh and Ramalingam, G.},
 eprint = {1706.01668v3},
 isbn = {978-3-939897-97-2},
 issn = {1868-8969},
 pages = {178--191},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {1D6A981F660ECBB1098DF68DBB87809CD5A21C8E29E7318FB36B915A4017932D},
 title = {{One-way Definability of Sweeping Transducer}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2015.178},
 urn = {urn:nbn:de:0030-drops-56297},
 volume = {45},
 year = {2015}
}
  2. {Aperiodic Two-way Transducers and FO-Transductions} Carton, Olivier Dartois, Luc doi:10.4230/LIPIcs.CSL.2015.160 sha256:91D85F3A3B
    BibTeX 
    @inproceedings{CADA15,
 address = {Dagstuhl, Germany},
 author = {Carton, Olivier and Dartois, Luc},
 booktitle = {24th EACSL Annual Conference on Computer Science Logic (CSL 2015)},
 doi = {10.4230/LIPIcs.CSL.2015.160},
 editor = {Kreutzer, Stephan},
 isbn = {978-3-939897-90-3},
 issn = {1868-8969},
 pages = {160--174},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {91D85F3A3BF27CA267B9403B3BCC09672D42FD6EB5B45CCC5FDA7B08873B5B25},
 title = {{Aperiodic Two-way Transducers and FO-Transductions}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.160},
 urn = {urn:nbn:de:0030-drops-54133},
 volume = {41},
 year = {2015}
}

2014

  1. {Transducers with Origin Information} Bojańczyk, Mikołaj doi:10.1007/978-3-662-43951-7_3 arxiv:1309.6124v1 sha256:D6C0B7720C
    BibTeX 
    @inproceedings{BOJA14,
 author = {Bojańczyk, Mikołaj},
 booktitle = {Automata, Languages, and Programming},
 doi = {10.1007/978-3-662-43951-7_3},
 editor = {Esparza, Javier and Fraigniaud, Pierre and Husfeldt, Thore and Koutsoupias, Elias},
 eprint = {1309.6124v1},
 isbn = {978-3-662-43951-7},
 pages = {26--37},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {D6C0B7720C661F3BA7662F7BCAD05DE18571ED18E812CB037A031BB49EF48B04},
 title = {{Transducers with Origin Information}},
 year = {2014}
}
  2. {First-order Definable String Transformations} Filiot, Emmanuel Krishna, Shankara Narayanan Trivedi, Ashutosh doi:10.4230/LIPIcs.FSTTCS.2014.147 sha256:65DA701B02
    BibTeX 
    @inproceedings{FKT14,
 address = {Dagstuhl, Germany},
 author = {Filiot, Emmanuel and Krishna, Shankara Narayanan and Trivedi, Ashutosh},
 booktitle = {34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
 doi = {10.4230/LIPIcs.FSTTCS.2014.147},
 editor = {Raman, Venkatesh and Suresh, S. P.},
 isbn = {978-3-939897-77-4},
 issn = {1868-8969},
 pages = {147--159},
 publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
 series = {Leibniz International Proceedings in Informatics (LIPIcs)},
 sha256 = {65DA701B02713F722E9F4AF28AA6DB55C7BED7BC5A28519191337D382A5A5BEB},
 title = {{First-order Definable String Transformations}},
 url = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.147},
 urn = {urn:nbn:de:0030-drops-48393},
 volume = {29},
 year = {2014}
}

2013

  1. Quantitative Monadic Second-Order Logic Kreutzer, Stephan Riveros, Cristian doi:10.1109/LICS.2013.16 sha256:3756866442
    BibTeX 
    @inproceedings{KRRC13,
 author = {Kreutzer, Stephan and Riveros, Cristian},
 booktitle = {2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science},
 doi = {10.1109/LICS.2013.16},
 pages = {113-122},
 sha256 = {37568664428FFFA4A3480AEF379A0046FB1A05AC217468E8A00E50EB348F47BC},
 title = {Quantitative Monadic Second-Order Logic},
 year = {2013}
}
  2. From Two-Way to One-Way Finite State Transducers Filiot, Emmanuel Gauwin, Olivier Reynier, Pierre-Alain Servais, Frederic arxiv:1301.5197v2
    BibTeX 
    @inproceedings{FGRS13,
 author = {Filiot, Emmanuel and Gauwin, Olivier and Reynier, Pierre-Alain and Servais, Frederic},
 booktitle = {Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science},
 eprint = {1301.5197v2},
 isbn = {9780769550206},
 numpages = {10},
 pages = {468–477},
 publisher = {IEEE Computer Society},
 series = {LICS '13},
 title = {From Two-Way to One-Way Finite State Transducers},
 year = {2013}
}
  3. Simplified {Proof} of {Kruskal}'s {Tree} {Theorem} Singh, Devendra Shuaibu, Ali Maianguwa Ndayawo, Muhammad doi:10.13140/RG.2.2.12298.39363
    BibTeX 
    @article{SSM13,
 author = {Singh, Devendra and Shuaibu, Ali Maianguwa and Ndayawo, Muhammad},
 doi = {10.13140/RG.2.2.12298.39363},
 journal = {Mathematical Theory and Modeling},
 pages = {93--100},
 title = {Simplified {Proof} of {Kruskal}'s {Tree} {Theorem}},
 volume = {3},
 year = {2013}
}
  4. The Power of Priority Channel Systems Haase, Christoph Schmitz, Sylvain Schnoebelen, Philippe doi:10.1007/978-3-642-40184-8_22
    BibTeX 
    @inproceedings{HSS13,
 address = {Berlin, Heidelberg},
 author = {Haase, Christoph and Schmitz, Sylvain and Schnoebelen, Philippe},
 booktitle = {CONCUR 2013 -- Concurrency Theory},
 doi = {10.1007/978-3-642-40184-8_22},
 editor = {D'Argenio, Pedro R. and Melgratti, Hernán},
 isbn = {978-3-642-40184-8},
 pages = {319--333},
 publisher = {Springer Berlin Heidelberg},
 title = {The Power of Priority Channel Systems},
 year = {2013}
}

2012

  1. Algorithmic Aspects of WQO Theory (MPRI course) Demeri, Stéphane Finkel, Alain Goubault-Larrecq, Jean Schmitz, Sylvain Schnoebelen, Philippe
    BibTeX 
    @unpublished{SCSC12,
 author = {Demeri, Stéphane and Finkel, Alain and Goubault-Larrecq, Jean and  Schmitz, Sylvain and Schnoebelen, Philippe},
 title = {Algorithmic Aspects of WQO Theory (MPRI course)},
 url = {https://cel.archives-ouvertes.fr/cel-00727025},
 year = {2012}
}

2011

  1. Green's Relations and Their Use in Automata Theory Colcombet, Thomas sha256:66F54EFCA8
    BibTeX 
    @inproceedings{COLC11,
 address = {Berlin, Heidelberg},
 author = {Colcombet, Thomas},
 booktitle = {Language and Automata Theory and Applications},
 editor = {Dediu, Adrian-Horia and Inenaga, Shunsuke and Martín-Vide, Carlos},
 isbn = {978-3-642-21253-6,978-3-642-21254-3},
 pages = {1--21},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {66F54EFCA818EE0DE35920211A003529B4F1826FC2F5DE63F0C404AA87402233},
 title = {Green's Relations and Their Use in Automata Theory},
 year = {2011}
}

2010

  1. Noncommutative rational series with applications Berstel, Jean Reutenauer, Christophe doi:10.1017/CBO9780511760860 sha256:0A4B618142
    BibTeX 
    @book{BERE10,
 author = {Berstel, Jean and Reutenauer, Christophe},
 doi = {10.1017/CBO9780511760860},
 isbn = {0521190223,9780521190220,9780511760860},
 publisher = {Cambridge University Press},
 series = {Encyclopedia of Mathematics and its Applications},
 sha256 = {0A4B61814201B20ABA0D4B37251CAF334AB1B95B67D6BB06FFC8B23582290B12},
 title = {Noncommutative rational series with applications},
 volume = {137},
 year = {2010}
}
  2. Well-Quasi-Order of Relabel Functions Daligault, Jean Rao, Michael Thomassé, Stéphan doi:10.1007/s11083-010-9174-0 sha256:0532D1A91F
    BibTeX 
    @article{DRT10,
 author = {Daligault, Jean and Rao, Michael and Thomassé, Stéphan},
 doi = {10.1007/s11083-010-9174-0},
 issn = {1572-9273},
 journal = {Order},
 month = {September},
 number = {3},
 pages = {301–315},
 publisher = {Springer Science and Business Media LLC},
 sha256 = {0532D1A91F704673541C86B927B288C8B2F013E2B573E2432AF8A6F8CF5C3338},
 title = {Well-Quasi-Order of Relabel Functions},
 url = {http://dx.doi.org/10.1007/s11083-010-9174-0},
 volume = {27},
 year = {2010}
}

2007

  1. A Combinatorial Theorem for Trees Colcombet, Thomas sha256:F9F8035661
    BibTeX 
    @inproceedings{COLC07,
 address = {Berlin, Heidelberg},
 author = {Colcombet, Thomas},
 booktitle = {Automata, Languages and Programming},
 editor = {Arge, Lars and Cachin, Christian and Jurdziński, Tomasz and Tarlecki, Andrzej},
 isbn = {978-3-540-73420-8},
 pages = {901--912},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {F9F803566167FC8D36903104A7E9C242A8DDF48F18695ECB9D02B194490B8D5B},
 title = {A Combinatorial Theorem for Trees},
 year = {2007}
}
  2. XML transformation by tree-walking transducers with invisible pebbles Engelfriet, Joost Hoogeboom, Hendrik Jan Samwel, Bart doi:10.1145/1265530.1265540 arxiv:1809.05730
    BibTeX 
    @inproceedings{EHS07,
 address = {New York, NY, USA},
 author = {Engelfriet, Joost and Hoogeboom, Hendrik Jan and Samwel, Bart},
 booktitle = {Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems},
 doi = {10.1145/1265530.1265540},
 eprint = {1809.05730},
 isbn = {9781595936851},
 keywords = {tree transducer, pebble, XML},
 numpages = {10},
 pages = {63–72},
 publisher = {Association for Computing Machinery},
 series = {PODS '07},
 title = {XML transformation by tree-walking transducers with invisible pebbles},
 url = {https://doi.org/10.1145/1265530.1265540},
 year = {2007}
}
  3. Weighted automata and weighted logics Droste, Manfred Gastin, Paul doi:10.1016/j.tcs.2007.02.055 sha256:D5CD0F0F73
    BibTeX 
    @article{DRGA07,
 author = {Droste, Manfred and Gastin, Paul},
 doi = {10.1016/j.tcs.2007.02.055},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 note = {Automata, Languages and Programming},
 number = {1},
 pages = {69-86},
 sha256 = {D5CD0F0F73FD664CF5BBAE4D2F3975321B8BD21C0AF668D956122FBA29CAC0C9},
 title = {Weighted automata and weighted logics},
 url = {https://www.sciencedirect.com/science/article/pii/S0304397507001582},
 volume = {380},
 year = {2007}
}

2005

  1. Weighted automata and weighted logics Droste, Manfred Gastin, Paul doi:10.1007/11523468_42 sha256:2F2EC6CCEF
    BibTeX 
    @inproceedings{DRAG05,
 address = {Berlin, Heidelberg},
 author = {Droste, Manfred and Gastin, Paul},
 booktitle = {Automata, Languages and Programming},
 doi = {10.1007/11523468_42},
 editor = {Caires, Lu{\'i}s
and Italiano, Giuseppe F.
and Monteiro, Lu{\'i}s
and Palamidessi, Catuscia
and Yung, Moti},
 isbn = {978-3-540-31691-6,978-3-540-27580-0},
 pages = {513--525},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {2F2EC6CCEFF2975A62F76F16E64F923AB1A6CB9D8791AFCA5991D20EEE8853DE},
 title = {Weighted automata and weighted logics},
 year = {2005}
}
  2. Regular solutions of language inequalities and well quasi-orders Kunc, Michal doi:https://doi.org/10.1016/j.tcs.2005.09.018 sha256:2121996B6E
    BibTeX 
    @article{KUNC05,
 author = {Kunc, Michal},
 doi = {https://doi.org/10.1016/j.tcs.2005.09.018},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 note = {Automata, Languages and Programming: Algorithms and Complexity (ICALP-A 2004)},
 number = {2},
 pages = {277-293},
 sha256 = {2121996B6E53EEC38DEB4BA19CFAE66DAEF034D538C893415BEF3EB8F6DCC372},
 title = {Regular solutions of language inequalities and well quasi-orders},
 url = {https://www.sciencedirect.com/science/article/pii/S0304397505005384},
 volume = {348},
 year = {2005}
}

2004

  1. On factorization forests of finite height Chalopin, Jérémie Leung, Hing doi:10.1016/s0304-3975(03)00344-x
    BibTeX 
    @article{CHALE04,
 author = {Chalopin, Jérémie and Leung, Hing},
 doi = {10.1016/s0304-3975(03)00344-x},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 month = {January},
 number = {1–3},
 pages = {489–499},
 publisher = {Elsevier BV},
 title = {On factorization forests of finite height},
 volume = {310},
 year = {2004}
}
  2. Algorithmic uses of the {F}eferman--{V}aught {T}heorem Makowsky, Johann A. doi:10.1016/j.apal.2003.11.002 sha256:0294D450B2
    BibTeX 
    @article{MAKOW04,
 author = {Makowsky, Johann A.},
 doi = {10.1016/j.apal.2003.11.002},
 issn = {0168-0072},
 journal = {Annals of Pure and Applied Logic},
 number = {1},
 pages = {159--213},
 publisher = {Elsevier},
 sha256 = {0294D450B2C9AEF54144EB73CD1549E7FA06CBE23DF2EB36099042A78C3A5EC3},
 title = {Algorithmic uses of the {F}eferman--{V}aught {T}heorem},
 url = {https://www.sciencedirect.com/science/article/pii/S0168007203001003},
 volume = {126},
 year = {2004}
}
  3. Graph Minors. XX. Wagner's conjecture Robertson, Neil Seymour, Paul D. doi:10.1016/j.jctb.2004.08.001 sha256:3f39a2bf08
    BibTeX 
    @article{ROBSEY04,
 abstract = {We prove Wagner's conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.},
 author = {Robertson, Neil and Seymour, Paul D.},
 doi = {10.1016/j.jctb.2004.08.001},
 issn = {0095-8956},
 journal = {Journal of Combinatorial Theory, Series B},
 keywords = {Graph, Minor, Surface embedding, Well-quasi-ordering},
 note = {Special Issue Dedicated to Professor W.T. Tutte},
 number = {2},
 pages = {325-357},
 sha256 = {3f39a2bf0802358e910ff39e6e92aa884bd2112ee84615c0228d3b943653e82e},
 title = {Graph Minors. XX. Wagner's conjecture},
 url = {https://www.sciencedirect.com/science/article/pii/S0095895604000784},
 volume = {92},
 year = {2004}
}

2003

  1. Minimizing subsequential transducers: a survey Choffrut, Christian doi:10.1016/S0304-3975(01)00219-5 sha256:4accc2f4c7
    BibTeX 
    @article{CHOF03,
 author = {Choffrut, Christian},
 doi = {10.1016/S0304-3975(01)00219-5},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 note = {Selected Papers in honor of Jean Berstel},
 number = {1},
 pages = {131-143},
 sha256 = {4accc2f4c7b71961e0ac1ecb0d3e5bae6089a25c1aed645f79b6013fc55bca66},
 title = {Minimizing subsequential transducers: a survey},
 url = {https://www.sciencedirect.com/science/article/pii/S0304397501002195},
 volume = {292},
 year = {2003}
}
  2. Gap Embedding for Well-Quasi-Orderings1 Derhowitz, Nachum Tzameret, Iddo doi:10.1016/S1571-0661(04)80846-6 sha256:0020423B17
    BibTeX 
    @article{DERSHOWITZ200380,
 author = {Derhowitz, Nachum and Tzameret, Iddo},
 doi = {10.1016/S1571-0661(04)80846-6},
 issn = {1571-0661},
 journal = {Electronic Notes in Theoretical Computer Science},
 note = {WoLLIC'2003, 10th Workshop on Logic, Language, Information and Computation},
 pages = {80-90},
 sha256 = {0020423B17BACF2D9AE9CC0945C22032E3946CB79DE479918B2B5287A44C47EA},
 title = {Gap Embedding for Well-Quasi-Orderings1},
 url = {https://www.sciencedirect.com/science/article/pii/S1571066104808466},
 volume = {84},
 year = {2003}
}

2002

  1. The finite power problem revisited Kirsten, Daniel doi:10.1016/S0020-0190(02)00319-8 sha256:AFEA1DDCB4
    BibTeX 
    @article{KIRS02,
 author = {Kirsten, Daniel},
 doi = {10.1016/S0020-0190(02)00319-8},
 issn = {0020-0190},
 journal = {Information Processing Letters},
 keywords = {Formal languages, Recognizable languages, Finite power property, Finite power problem},
 number = {6},
 pages = {291-294},
 sha256 = {AFEA1DDCB418D7794DAAFF2A92E48E4B6AFC9F602D0476D837EF7ED50C643CD8},
 title = {The finite power problem revisited},
 url = {https://www.sciencedirect.com/science/article/pii/S0020019002003198},
 volume = {84},
 year = {2002}
}
  2. Two Way Finite State Transducers with Nested Pebbles Engelfriet, Joost Maneth, Sebastian doi:10.1007/3-540-45687-2_19 sha256:C4F9002939
    BibTeX 
    @inproceedings{ENMA02,
 address = {Berlin, Heidelberg},
 author = {Engelfriet, Joost and Maneth, Sebastian},
 booktitle = {Mathematical Foundations of Computer Science 2002},
 doi = {10.1007/3-540-45687-2_19},
 editor = {Diks, Krzysztof and Rytter, Wojciech},
 isbn = {978-3-540-44040-6,978-3-540-44040-6},
 pages = {234--244},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {C4F9002939D782CA1DA3D2D1E810A6E9B224FFE5DFFC5B7447DC674194C68AC2},
 title = {Two Way Finite State Transducers with Nested Pebbles},
 url = {https://doi.org/10.1007/3-540-45687-2_21},
 volume = {2420},
 year = {2002}
}

2001

  1. MSO definable string transductions and two-way finite-state transducers Engelfriet, Joost Hoogeboom, Hendrik Jan doi:10.1145/371316.371512 sha256:1A086F3723
    BibTeX 
    @article{ENHO01,
 address = {New York, NY, USA},
 author = {Engelfriet, Joost and Hoogeboom, Hendrik Jan},
 doi = {10.1145/371316.371512},
 issn = {1529-3785},
 issue_date = {April 2001},
 journal = {ACM Trans. Comput. Logic},
 month = {apr},
 number = {2},
 numpages = {39},
 pages = {216–254},
 publisher = {Association for Computing Machinery},
 sha256 = {1A086F3723716994129E0A4573EB4EC451B14866E24CB468A49E012684750867},
 title = {MSO definable string transductions and two-way finite-state transducers},
 url = {https://doi.org/10.1145/371316.371512},
 volume = {2},
 year = {2001}
}
  2. Well-structured transition systems everywhere! Finkel, Alain Schnoebelen, Philippe doi:10.1016/S0304-3975(00)00102-X sha256:E34FB9C439
    BibTeX 
    @article{FINSCH01,
 author = {Finkel, Alain and Schnoebelen, Philippe},
 doi = {10.1016/S0304-3975(00)00102-X},
 journal = {Theoretical Computer Science},
 pages = {63--92},
 sha256 = {E34FB9C4398C578BD9064A2E8D8979F2D1CB3FEDF3FC5B40950C0449ECB8AF2A},
 title = {Well-structured transition systems everywhere!},
 url = {https://linkinghub.elsevier.com/retrieve/pii/S030439750000102X},
 urldate = {2023-06-19},
 volume = {256},
 year = {2001}
}

1999

  1. Trips on Trees Engelfriet, Joost Jan Hoogeboom, Hendrik van Best, Jan{-}Pascal sha256:C13616C9AC
    BibTeX 
    @article{EHB99,
 author = {Engelfriet, Joost and
Jan Hoogeboom, Hendrik and
van Best, Jan{-}Pascal},
 journal = {Acta Cybernetica},
 number = {1},
 pages = {51--64},
 sha256 = {C13616C9AC344133063A120B18F46A865CC9FDB290C29562858A662D791EDA2E},
 title = {Trips on Trees},
 url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3510},
 volume = {14},
 year = {1999}
}

1998

  1. On a duality between Kruskal and Dershowitz theorems Melliès, Paul-André doi:10.1007/BFb0055085 sha256:7EF0983474
    BibTeX 
    @inproceedings{MELL98,
 address = {Berlin, Heidelberg},
 author = {Melliès, Paul-André},
 booktitle = {Automata, Languages and Programming},
 doi = {10.1007/BFb0055085},
 editor = {Larsen, Kim G. and Skyum, Sven and Winskel, Glynn},
 isbn = {978-3-540-68681-1,978-3-540-64781-2},
 pages = {518--529},
 publisher = {Springer Berlin Heidelberg},
 sha256 = {7EF0983474C7F95148EC66BB7BABAEAFE6810C7AB568341D0E5BDF6EA0D0A24A},
 title = {On a duality between Kruskal and Dershowitz theorems},
 url = {https://doi.org/10.1007/BFb0055085},
 year = {1998}
}
  2. Verifying networks of timed processes Abdulla, Parosh Aziz Jonsson, Bengt doi:10.1007/BFb0054179 sha256:064BF31AB5
    BibTeX 
    @inproceedings{ABDU98,
 author = {Abdulla, Parosh Aziz and Jonsson, Bengt},
 booktitle = {Proceedings of TACAS'98},
 doi = {10.1007/BFb0054179},
 pages = {298--312},
 publisher = {Springer},
 sha256 = {064BF31AB54ECE6B0E9BD0985B1A8C13D96221AF1DB0F4C5CFE8FB439BB602E1},
 title = {Verifying networks of timed processes},
 volume = {1384},
 year = {1998}
}

1997

  1. Languages, automata, and logic Thomas, Wolfgang doi:10.1007/978-3-642-59136-5 sha256:C6422F792F
    BibTeX 
    @incollection{THOM97,
 author = {Thomas, Wolfgang},
 booktitle = {Handbook of formal languages},
 doi = {10.1007/978-3-642-59136-5},
 editor = {Rozenberg, Grzegorz and Salomaa, Arto},
 isbn = {978-3-540-60420-4,978-3-642-63863-3,978-3-642-59136-5},
 pages = {389--455},
 publisher = {Springer},
 sha256 = {C6422F792FC953D77F8C83F98AFF5A818A25F5DAFF0EB00D5CF84F826F1E2A5C},
 title = {Languages, automata, and logic},
 year = {1997}
}

1996

  1. Integer-Valued Polynomials Cahen, Paul-Jean Chabert, Jean-Luc doi:10.1090/surv/048 sha256:A763FE4A9A
    BibTeX 
    @book{CACHA1996,
 author = {Cahen, Paul-Jean and Chabert, Jean-Luc},
 doi = {10.1090/surv/048},
 isbn = {9781470412791},
 issn = {2331-7159},
 journal = {Mathematical Surveys and Monographs},
 month = {December},
 notions = {entire function, integer-valued function},
 publisher = {American Mathematical Society},
 sha256 = {A763FE4A9A8ECDD348BDEC2CDCEC7B7808586C47A0E5DEDB8A9996EF1FE44128},
 title = {Integer-Valued Polynomials},
 url = {https://people.math.rochester.edu/faculty/doug/otherpapers/Cahen-Chabert.pdf},
 year = {1996}
}
  2. General decidability theorems for infinite-state systems Abdulla, Parosh Aziz {\v{C}}er{\=a}ns, Karlis Tsay, Bengt Jonsson Yih-Kuen doi:10.1109/LICS.1996.561359 sha256:33683952C3
    BibTeX 
    @inproceedings{ABDU96,
 author = {Abdulla, Parosh Aziz and {\v{C}}er{\=a}ns, Karlis and Tsay, Bengt Jonsson and Yih-Kuen},
 booktitle = {Proceedings of LICS'96},
 doi = {10.1109/LICS.1996.561359},
 pages = {313--321},
 publisher = {IEEE},
 sha256 = {33683952C37EB88C4766353EE163985A86906F2B929FDE9321563702342BA9D5},
 title = {General decidability theorems for infinite-state systems},
 year = {1996}
}

1994

  1. k-NLC graphs and polynomial algorithms Wanke, Egon doi:https://doi.org/10.1016/0166-218X(94)90026-4 sha256:24B5603FD2
    BibTeX 
    @article{WANKE94,
 author = {Wanke, Egon},
 doi = {https://doi.org/10.1016/0166-218X(94)90026-4},
 issn = {0166-218X},
 journal = {Discrete Applied Mathematics},
 number = {2},
 pages = {251-266},
 sha256 = {24B5603FD2FD51D42D860F0D61D544236336DCE18D4285D42F0D1C13FED35EDF},
 title = {k-NLC graphs and polynomial algorithms},
 url = {https://www.sciencedirect.com/science/article/pii/0166218X94900264},
 volume = {54},
 year = {1994}
}
  2. Monadic second-order definable graph transductions: a survey Courcelle, Bruno doi:https://doi.org/10.1016/0304-3975(94)90268-2 sha256:8CCF4BE864
    BibTeX 
    @article{COUR94,
 author = {Courcelle, Bruno},
 doi = {https://doi.org/10.1016/0304-3975(94)90268-2},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 number = {1},
 pages = {53-75},
 sha256 = {8CCF4BE864F281071D683B078E3F6B55503823432CA62145C134B507841392B4},
 title = {Monadic second-order definable graph transductions: a survey},
 url = {https://www.sciencedirect.com/science/article/pii/0304397594902682},
 volume = {126},
 year = {1994}
}

1993

  1. Handle-rewriting hypergraph grammars Courcelle, Bruno Engelfriet, Joost Rozenberg, Grzegorz doi:https://doi.org/10.1016/0022-0000(93)90004-G sha256:07785ACDDA
    BibTeX 
    @article{COJOGR93,
 author = {Courcelle, Bruno and Engelfriet, Joost and Rozenberg, Grzegorz},
 doi = {https://doi.org/10.1016/0022-0000(93)90004-G},
 issn = {0022-0000},
 journal = {Journal of Computer and System Sciences},
 number = {2},
 pages = {218-270},
 sha256 = {07785ACDDA6E44CF495B2FC150A3C2422AD55F427A6F40503CF2D5E7AF59F2B5},
 title = {Handle-rewriting hypergraph grammars},
 url = {https://www.sciencedirect.com/science/article/pii/002200009390004G},
 volume = {46},
 year = {1993}
}
  2. Verifying programs with unreliable channels Abdulla, P. Jonsson, B. doi:10.1109/LICS.1993.287591
    BibTeX 
    @inproceedings{ABDU93,
 author = {Abdulla, P. and Jonsson, B.},
 booktitle = {[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science},
 doi = {10.1109/LICS.1993.287591},
 pages = {160-170},
 title = {Verifying programs with unreliable channels},
 year = {1993}
}

1992

  1. Subgraphs and well‐quasi‐ordering Ding, Guoli doi:10.1002/jgt.3190160509
    BibTeX 
    @article{DING92,
 author = {Ding, Guoli},
 doi = {10.1002/jgt.3190160509},
 issn = {1097-0118},
 journal = {Journal of Graph Theory},
 month = {November},
 number = {5},
 pages = {489–502},
 publisher = {Wiley},
 title = {Subgraphs and well‐quasi‐ordering},
 url = {http://dx.doi.org/10.1002/jgt.3190160509},
 volume = {16},
 year = {1992}
}

1991

  1. The monadic second-order logic of graphs V: on closing the gap between definability and recognizability Courcelle, Bruno doi:https://doi.org/10.1016/0304-3975(91)90387-H sha256:5DA72EFD51
    BibTeX 
    @article{COUR91,
 author = {Courcelle, Bruno},
 doi = {https://doi.org/10.1016/0304-3975(91)90387-H},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 number = {2},
 pages = {153-202},
 sha256 = {5DA72EFD51CBEA53078D9CA979C04F5277659156E7E6CD5E1969431084956993},
 title = {The monadic second-order logic of graphs V: on closing the gap between definability and recognizability},
 url = {https://www.sciencedirect.com/science/article/pii/030439759190387H},
 volume = {80},
 year = {1991}
}

1990

  1. Factorization forests of finite height Simon, Imre doi:10.1016/0304-3975(90)90047-L sha256:78D7BA16FB
    BibTeX 
    @article{SIMO90,
 author = {Simon, Imre},
 doi = {10.1016/0304-3975(90)90047-L},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 number = {1},
 pages = {65-94},
 sha256 = {78D7BA16FB9712FB309858D1FCEB7C2EA445D8DE61AE58D690D81FA4276FBA5F},
 title = {Factorization forests of finite height},
 url = {https://www.sciencedirect.com/science/article/pii/030439759090047L},
 volume = {72},
 year = {1990}
}

1989

  1. Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation Ravikumar, Bala Ibarra, Oscar H. doi:10.1137/0218083 sha256:D45A57B81C
    BibTeX 
    @article{RAIB89,
 author = {Ravikumar, Bala and Ibarra, Oscar H.},
 doi = {10.1137/0218083},
 journal = {SIAM Journal on Computing},
 number = {6},
 pages = {1263-1282},
 sha256 = {D45A57B81C16EF3732B8524811DF613FA11FF73BCACF7F322C270F13EE493E6C},
 title = {Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation},
 url = {https://epubs.siam.org/doi/abs/10.1137/0218083},
 volume = {18},
 year = {1989}
}

1988

  1. Rational Series and Their Languages Berstel, Jean Reutenauer, Christophe sha256:A2AC7177CE
    BibTeX 
    @book{BERE88,
 author = {Berstel, Jean and Reutenauer, Christophe},
 edition = {2008 electronic},
 isbn = {9780387186269,0387186263},
 pages = {151},
 publisher = {Springer},
 series = {EATCS Monographs on Theoretical Computer Science 12},
 sha256 = {A2AC7177CE29890987F9D0E106375FEF 8A26DA3BB2B2E69FC4CC4889AB1BD5DE},
 title = {Rational Series and Their Languages},
 volume = {12},
 year = {1988}
}

1986

  1. First-order logic and star-free sets Perrin, Dominique Pin, Jean-Éric doi:10.1016/0022-0000(86)90037-1 sha256:4647F55569
    BibTeX 
    @article{PEPI86,
 author = {Perrin, Dominique and Pin, Jean-Éric},
 doi = {10.1016/0022-0000(86)90037-1},
 issn = {0022-0000},
 journal = {Journal of Computer and System Sciences},
 number = {3},
 pages = {393--406},
 publisher = {Academic Press},
 sha256 = {4647F555692014B83DDFC4A22CC5D980FEED476E24844E648F6FEB7C9F787D25},
 title = {First-order logic and star-free sets},
 url = {https://www.sciencedirect.com/science/article/pii/0022000086900371},
 volume = {32},
 year = {1986}
}
  2. Every iterated morphism yields a co-CFL Berstel, Jean doi:10.1016/0020-0190(86)90034-7
    BibTeX 
    @article{BERST86,
 address = {USA},
 author = {Berstel, Jean},
 doi = {10.1016/0020-0190(86)90034-7},
 issn = {0020-0190},
 issue_date = {January 2, 1986},
 journal = {Inf. Process. Lett.},
 month = {January},
 number = {1},
 numpages = {3},
 pages = {7–9},
 publisher = {Elsevier North-Holland, Inc.},
 title = {Every iterated morphism yields a co-CFL},
 url = {https://doi.org/10.1016/0020-0190(86)90034-7},
 volume = {22},
 year = {1986}
}

1985

  1. On total regulators generated by derivation relations Bucher, Walter Ehrenfeucht, Andrzej Haussler, David doi:https://doi.org/10.1016/0304-3975(85)90162-8 sha256:9F5A6C3D8A
    BibTeX 
    @article{BEH85,
 author = {Bucher, Walter and Ehrenfeucht, Andrzej and Haussler, David},
 doi = {https://doi.org/10.1016/0304-3975(85)90162-8},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 note = {Eleventh International Colloquium on Automata, Languages and Programming},
 pages = {131-148},
 sha256 = {9F5A6C3D8A0B34037AE62CFED40321DA858087C9A474C1E56C2C23EC7211AD5A},
 title = {On total regulators generated by derivation relations},
 url = {https://www.sciencedirect.com/science/article/pii/0304397585901628},
 volume = {40},
 year = {1985}
}

1983

  1. On regularity of context-free languages Ehrenfeucht, Andrzej Haussler, David Rozenberg, Grzegorz doi:https://doi.org/10.1016/0304-3975(82)90124-4 sha256:A2D41137E8
    BibTeX 
    @article{EHR83,
 author = {Ehrenfeucht, Andrzej and Haussler, David and Rozenberg, Grzegorz},
 doi = {https://doi.org/10.1016/0304-3975(82)90124-4},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 note = {Special Issue Ninth International Colloquium on Automata, Languages and Programming (ICALP) Aarhus, Summer 1982},
 number = {3},
 pages = {311-332},
 sha256 = {A2D41137E80F46C1B60255DA417462A26151D8D7D07A65185A4ABBD4BCE6CF7E},
 title = {On regularity of context-free languages},
 url = {https://www.sciencedirect.com/science/article/pii/0304397582901244},
 volume = {27},
 year = {1983}
}

1980

  1. Séries formelles et algèbres syntactiques Reutenauer, Christophe doi:10.1016/0021-8693(80)90097-6 sha256:dd570d81ba
    BibTeX 
    @article{REUT80,
 author = {Reutenauer, Christophe},
 doi = {10.1016/0021-8693(80)90097-6},
 issn = {0021-8693},
 journal = {Journal of Algebra},
 number = {2},
 pages = {448--483},
 sha256 = {dd570d81ba6d7d35c88df6e657355d9b3e0737e05e44daba8b8e353fff627e19},
 title = {Séries formelles et algèbres syntactiques},
 url = {https://www.sciencedirect.com/science/article/pii/0021869380900976},
 volume = {66},
 year = {1980}
}
  2. Set Theory Kunen, Kenneth doi:10.1016/s0049-237x(08)x7037-5
    BibTeX 
    @book{KUNEN80,
 author = {Kunen, Kenneth},
 doi = {10.1016/s0049-237x(08)x7037-5},
 isbn = {9780444854018},
 issn = {0049-237X},
 journal = {Studies in Logic and the Foundations of Mathematics},
 publisher = {Elsevier},
 title = {Set Theory},
 year = {1980}
}

1979

  1. Transductions and Context-Free Languages Berstel, Jean doi:10.1007/978-3-663-09367-1
    BibTeX 
    @book{BERST79,
 author = {Berstel, Jean},
 doi = {10.1007/978-3-663-09367-1},
 isbn = {9783663093671},
 publisher = {Vieweg+Teubner Verlag},
 title = {Transductions and Context-Free Languages},
 url = {http://dx.doi.org/10.1007/978-3-663-09367-1},
 year = {1979}
}

1977

  1. Remarks on commutative {N}-rational series Karhumäki, Juhani doi:10.1016/0304-3975(77)90008-1 sha256:D583D051BF
    BibTeX 
    @article{KARH77,
 author = {Karhumäki, Juhani},
 doi = {10.1016/0304-3975(77)90008-1},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 number = {2},
 pages = {211-217},
 sha256 = {D583D051BF0AD3E8FE795984C4AC6FA025BF0BAF9EF96662CE7B250574B1CC58},
 title = {Remarks on commutative {N}-rational series},
 url = {https://www.sciencedirect.com/science/article/pii/0304397577900081},
 volume = {5},
 year = {1977}
}
  2. Sur une variante des fonctions sequentielles Schützenberger, Marcel P. doi:https://doi.org/10.1016/0304-3975(77)90055-X sha256:1C0FCB38AA
    BibTeX 
    @article{SCHU77,
 author = {Schützenberger, Marcel P.},
 doi = {https://doi.org/10.1016/0304-3975(77)90055-X},
 issn = {0304-3975},
 journal = {Theoretical Computer Science},
 number = {1},
 pages = {47-57},
 sha256 = {1C0FCB38AA28DBDBA5A9101B74C9D3158A6A44672C40BB8F31DC5EBC0880F379},
 title = {Sur une variante des fonctions sequentielles},
 url = {https://www.sciencedirect.com/science/article/pii/030439757790055X},
 volume = {4},
 year = {1977}
}

1975

  1. The Monadic Theory of Order Shelah, Saharon doi:10.2307/1971037
    BibTeX 
    @article{SHELAH75,
 author = {Shelah, Saharon},
 doi = {10.2307/1971037},
 issn = {0003-486X},
 journal = {The Annals of Mathematics},
 month = {November},
 number = {3},
 pages = {379},
 publisher = {JSTOR},
 title = {The Monadic Theory of Order},
 url = {http://dx.doi.org/10.2307/1971037},
 volume = {102},
 year = {1975}
}

1974

  1. Automata, Languages, and Machines Eilenberg, Samuel doi:10.5555/540244 sha256:E94D8406C7 sha256:6DBA581F12
    BibTeX 
    @book{EILE74,
 author = {Eilenberg, Samuel},
 doi = {10.5555/540244},
 isbn = {9780122340017,0122340019,9780080873749},
 lccn = {72088333},
 publisher = {Academic Press},
 series = {Automata, Languages, and Machines},
 sha256 = {E94D8406C7219BA835C2D1F3A4A137B1FDA4AC128854E0A1DF42A5448174AF32,
6DBA581F1231300C8151758B141DFB0B30431ED58F280748F7B8376AEB3C2A4D},
 title = {Automata, Languages, and Machines},
 url = {https://books.google.pl/books?id=vVh0xgEACAAJ},
 volume = {A},
 year = {1974}
}

1973

  1. Hilbert’s Tenth Problem is Unsolvable Davis, Martin doi:10.1080/00029890.1973.11993265 sha256:C787B9CED6
    BibTeX 
    @article{DAVIS1973,
 author = {Davis, Martin},
 doi = {10.1080/00029890.1973.11993265},
 issn = {1930-0972},
 journal = {The American Mathematical Monthly},
 month = {March},
 number = {3},
 pages = {233--269},
 sha256 = {C787B9CED6ABBEF44277FC8A8CA8784F5D178530A68A517061AE1132249362E2},
 title = {Hilbert’s Tenth Problem is Unsolvable},
 url = {http://dx.doi.org/10.1080/00029890.1973.11993265},
 volume = {80},
 year = {1973}
}

1972

  1. Un bel ordre d'abritement et ses rapports avec les bornes d'une multirelation Pouzet, Maurice
    BibTeX 
    @article{POUZ72,
 author = {Pouzet, Maurice},
 journal = {CR Acad. Sci. Paris Sér. AB},
 pages = {A1677--A1680},
 title = {Un bel ordre d'abritement et ses rapports avec les bornes d'une multirelation},
 volume = {274},
 year = {1972}
}
  2. The theory of well-quasi-ordering: A frequently discovered concept Kruskal, Joseph B. doi:10.1016/0097-3165(72)90063-5 sha256:0BC24CCB91
    BibTeX 
    @article{KRU72,
 author = {Kruskal, Joseph B.},
 doi = {10.1016/0097-3165(72)90063-5},
 journal = {Journal of Combinatorial Theory, Series A},
 pages = {297--305},
 sha256 = {0BC24CCB912E8753506C1B71534B06C2F6856F1B2C788F113EBC4A020ACE9A50},
 title = {The theory of well-quasi-ordering: A frequently discovered concept},
 volume = {13},
 year = {1972}
}

1971

  1. Counter-Free Automata McNaughton, Robert Papert, Seymour A. doi:10.5555/1097043
    BibTeX 
    @book{MNPA71,
 author = {McNaughton, Robert and Papert, Seymour A.},
 doi = {10.5555/1097043},
 isbn = {978-0-262-13076-9},
 publisher = {The MIT Press},
 title = {Counter-Free Automata},
 year = {1971}
}
  2. Introduction to Axiomatic Set Theory Krivine, Jean-Louis doi:10.1007/978-94-010-3144-8
    BibTeX 
    @book{KRIVINE71,
 author = {Krivine, Jean-Louis},
 doi = {10.1007/978-94-010-3144-8},
 isbn = {9789401031448},
 publisher = {Springer Netherlands},
 title = {Introduction to Axiomatic Set Theory},
 year = {1971}
}

1970

  1. The Diophantineness of enumerable sets Matiyasevich, Yuri Vladimirovich
    BibTeX 
    @article{MATI1970,
 author = {Matiyasevich, Yuri Vladimirovich},
 issn = {0002-3264},
 journal = {Doklady Akademii Nauk SSSR},
 note = {in Russian},
 pages = {279--282},
 title = {The Diophantineness of enumerable sets},
 volume = {191},
 year = {1970}
}

1969

  1. A general theory of translation Aho, Alfred V. Hopcroft, John E. Ullman, Jeffrey D. doi:10.1007/BF01703920
    BibTeX 
    @article{AHUL69,
 author = {Aho, Alfred V. and Hopcroft, John E. and Ullman, Jeffrey D.},
 doi = {10.1007/BF01703920},
 issn = {1433-0490},
 journal = {Mathematical systems theory},
 number = {3},
 pages = {193-221},
 title = {A general theory of translation},
 url = {https://doi.org/10.1007/BF01703920},
 volume = {3},
 year = {1969}
}

1968

  1. A helpful result for proving inherent ambiguity Ogden, William doi:10.1007/bf01694004
    BibTeX 
    @article{OGDEN68,
 author = {Ogden, William},
 doi = {10.1007/bf01694004},
 issn = {1433-0490},
 journal = {Mathematical Systems Theory},
 month = {September},
 number = {3},
 pages = {191–194},
 publisher = {Springer Science and Business Media LLC},
 title = {A helpful result for proving inherent ambiguity},
 volume = {2},
 year = {1968}
}

1966

  1. On Context-Free Languages Parikh, Rohit doi:10.1145/321356.321364
    BibTeX 
    @article{PARI66,
 author = {Parikh, Rohit},
 doi = {10.1145/321356.321364},
 journal = {Journal of the {ACM}},
 number = {4},
 pages = {570--581},
 title = {On Context-Free Languages},
 url = {https://doi.org/10.1145/321356.321364},
 volume = {13},
 year = {1966}
}
  2. Finite automata and the logic of one-place predicates Trakhtenbrot, Boris A. doi:10.1090/trans2/059/02
    BibTeX 
    @article{TRAK66,
 author = {Trakhtenbrot, Boris A.},
 doi = {10.1090/trans2/059/02},
 isbn = {9780821817599},
 journal = {American Mathematical Society Translations},
 number = {2},
 pages = {23--55},
 title = {Finite automata and the logic of one-place predicates},
 volume = {59},
 year = {1966}
}

1965

  1. On finite monoids having only trivial subgroups Schützenberger, Marcel P. doi:10.1016/S0019-9958(65)90108-7 sha256:EF336CA695 sha256:83F6715504
    BibTeX 
    @article{SCHU65,
 abstract = {An alternative definition is given for a family of subsets of a free monoid that has been considered by Trahtenbrot and by McNaughton.},
 author = {Schützenberger, Marcel P.},
 doi = {10.1016/S0019-9958(65)90108-7},
 issn = {0019-9958},
 journal = {Information and Control},
 language = {en},
 number = {2},
 pages = {190--194},
 sha256 = {EF336CA6958FDEB3F3BFDCA9489598AB44838BCCBE9368EF1838D8D137C0634B,
83F67155046D484C3F09D542E0513B430F9E6572A11F3F8D6880799E5BB23287},
 title = {On finite monoids having only trivial subgroups},
 volume = {8},
 year = {1965}
}
  2. On Relations Defined by Generalized Finite Automata Elgot, Calvin C. Mezei, Jorge E. doi:10.1147/rd.91.0047 sha256:2121996B6E
    BibTeX 
    @article{ELME65,
 author = {Elgot, Calvin C. and Mezei, Jorge E.},
 doi = {10.1147/rd.91.0047},
 journal = {IBM Journal of Research and Development},
 number = {1},
 pages = {47-68},
 sha256 = {2121996B6E53EEC38DEB4BA19CFAE66DAEF034D538C893415BEF3EB8F6DCC372},
 title = {On Relations Defined by Generalized Finite Automata},
 volume = {9},
 year = {1965}
}
  3. On well-quasi-ordering transfinite sequences Nash-Williams, Crispin {\relax St}. John Alvah doi:10.1017/S0305004100038603
    BibTeX 
    @article{NASH65,
 author = {Nash-Williams, Crispin {\relax St}. John Alvah},
 doi = {10.1017/S0305004100038603},
 journal = {Mathematical Proceedings of the Cambridge Philosophical Society},
 pages = {33--39},
 title = {On well-quasi-ordering transfinite sequences},
 volume = {61},
 year = {1965}
}

1962

  1. Finite Counting Automata Schützenberger, Marcel P. doi:10.1016/S0019-9958(62)90244-9 sha256:496140D6C0
    BibTeX 
    @article{SCHU62,
 author = {Schützenberger, Marcel P.},
 doi = {10.1016/S0019-9958(62)90244-9},
 issn = {0019-9958},
 journal = {Information and control},
 number = {2},
 pages = {91--107},
 sha256 = {496140D6C050FCC5F127A8CB46842E89CE1B6F3980D44567186E57F04F4637C1},
 title = {Finite Counting Automata},
 url = {https://www.sciencedirect.com/science/article/pii/S0019995862902449},
 volume = {5},
 year = {1962}
}

1961

  1. On the definition of a family of automata Schützenberger, Marcel P. doi:10.1016/S0019-9958(61)80020-X
    BibTeX 
    @article{SCHU61,
 author = {Schützenberger, Marcel P.},
 doi = {10.1016/S0019-9958(61)80020-X},
 journal = {Information and Control},
 number = {2-3},
 pages = {245--270},
 title = {On the definition of a family of automata},
 volume = {4},
 year = {1961}
}
  2. Decision problems of finite automata design and related arithmetics Elgot, Calvin C doi:10.2307/1993511 sha256:B1B4205E1F
    BibTeX 
    @article{ELGO61,
 author = {Elgot, Calvin C},
 doi = {10.2307/1993511},
 journal = {Transactions of the American Mathematical Society},
 number = {1},
 pages = {21--51},
 publisher = {JSTOR},
 sha256 = {B1B4205E1F50DAA164F0148E4887B88AFD66EF8496E61EBAA2652ED4EC3AB957},
 title = {Decision problems of finite automata design and related arithmetics},
 volume = {98},
 year = {1961}
}

1960

  1. Weak second-order arithmetic and finite automata Büchi, J. Richard doi:10.1002/malq.19600060105 sha256:72BF436929
    BibTeX 
    @article{BUCH60,
 author = {Büchi, J. Richard},
 doi = {10.1002/malq.19600060105},
 journal = {Mathematical Logic Quarterly},
 number = {1--6},
 sha256 = {72BF43692995B3032082DA64B7B4CFCE6125F28858EE2977A242A7183446531A},
 title = {Weak second-order arithmetic and finite automata},
 url = {https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.19600060105},
 volume = {6},
 year = {1960}
}

1959

  1. Finite Automata and Their Decision Problems Rabin, M. O. Scott, D. doi:10.1147/rd.32.0114 sha256:5BF1F7B70F
    BibTeX 
    @article{RABI59,
 author = {Rabin, M. O. and Scott, D.},
 doi = {10.1147/rd.32.0114},
 journal = {IBM Journal of Research and Development},
 number = {2},
 pages = {114-125},
 sha256 = {5BF1F7B70F623F19AE1A0E11F8465E4766EFFA8C4B671284A4D092C45ECCDF38},
 title = {Finite Automata and Their Decision Problems},
 volume = {3},
 year = {1959}
}
  2. The first order properties of products of algebraic systems Feferman, Solomon Vaught, Robert doi:10.4064/fm-47-1-57-103 sha256:2C504C8990
    BibTeX 
    @article{FEVAU59,
 author = {Feferman, Solomon and Vaught, Robert},
 doi = {10.4064/fm-47-1-57-103},
 journal = {Fundamenta Mathematicae},
 pages = {57--103},
 sha256 = {2C504C89902FB91CEECDD3A12243B31AA15481B9195C894A693CD1B0A259D1A7},
 title = {The first order properties of products of algebraic systems},
 volume = {47},
 year = {1959}
}

1956

  1. Representation of events in nerve nets and finite automata Kleene, Stephen C. doi:10.1515/9781400882618-002 sha256:B01AD77C39
    BibTeX 
    @article{KLEE56,
 author = {Kleene, Stephen C.},
 doi = {10.1515/9781400882618-002},
 journal = {Automata studies},
 pages = {3--42},
 publisher = {Princeton University Press},
 sha256 = {B01AD77C39D53088D62B09DBFBD04390AE57021B113DF645603E36B05710E621},
 title = {Representation of events in nerve nets and finite automata},
 volume = {34},
 year = {1956}
}

1955

  1. A method for synthesizing sequential circuits Mealy, George H. doi:10.1002/j.1538-7305.1955.tb03788.x
    BibTeX 
    @article{MEAL55,
 author = {Mealy, George H.},
 doi = {10.1002/j.1538-7305.1955.tb03788.x},
 journal = {The Bell System Technical Journal},
 number = {5},
 pages = {1045-1079},
 title = {A method for synthesizing sequential circuits},
 volume = {34},
 year = {1955}
}

1954

  1. Partial well-ordering of sets of vectors Rado, R. doi:10.1112/S0025579300000565
    BibTeX 
    @article{RADO54,
 author = {Rado, R.},
 doi = {10.1112/S0025579300000565},
 journal = {Mathematika},
 pages = {89–95},
 publisher = {London Mathematical Society},
 title = {Partial well-ordering of sets of vectors},
 volume = {1},
 year = {1954}
}

1952

  1. Ordering by divisibility in abstract algebras Higman, Graham doi:10.1112/plms/s3-2.1.326
    BibTeX 
    @article{HIG52,
 author = {Higman, Graham},
 doi = {10.1112/plms/s3-2.1.326},
 journal = {Proceedings of the London Mathematical Society},
 pages = {326--336},
 title = {Ordering by divisibility in abstract algebras},
 volume = {3},
 year = {1952}
}

1951

  1. On the Structure of Semigroups Green, J. A. doi:10.2307/1969317
    BibTeX 
    @article{GREEN51,
 author = {Green, J. A.},
 doi = {10.2307/1969317},
 issn = {0003-486X},
 journal = {The Annals of Mathematics},
 month = {July},
 number = {1},
 pages = {163},
 publisher = {JSTOR},
 title = {On the Structure of Semigroups},
 url = {http://dx.doi.org/10.2307/1969317},
 volume = {54},
 year = {1951}
}

1915

  1. Über ganzwertige ganze {Funktionen}. Pólya, G. doi:10.1007/BF03014836 sha256:40782ED509
    BibTeX 
    @article{POLYA1915,
 author = {Pólya, G.},
 doi = {10.1007/BF03014836},
 jfm = {45.0655.02},
 journal = {Rend. Circ. Mat. Palermo},
 language = {German},
 notions = {entire function, integer-valued function},
 pages = {1--16},
 sha256 = {40782ED5090C2C9D6C44EFC8A3207F8E82688C7F5B8004B9C2B3D64077B19EA4},
 title = {Über ganzwertige ganze {Funktionen}.},
 url = {https://zbmath.org/?format=complete&q=an:45.0655.02},
 volume = {40},
 year = {1915},
 zbl = {2616914}
}

1902

  1. Mathematical problems Hilbert, David doi:10.1090/s0002-9904-1902-00923-3 sha256:E5D069AD0D
    BibTeX 
    @article{HILB1902,
 author = {Hilbert, David},
 doi = {10.1090/s0002-9904-1902-00923-3},
 issn = {1088-9485},
 journal = {Bulletin of the American Mathematical Society},
 notions = {Hilbert's 10 Problem},
 number = {10},
 pages = {437--479},
 publisher = {American Mathematical Society (AMS)},
 sha256 = {E5D069AD0D3644B2527737B67D7BF293FD2CB8ACC576F1DBE8F19E12059BD2B3},
 title = {Mathematical problems},
 url = {https://www.ams.org/journals/bull/1902-08-10/S0002-9904-1902-00923-3/},
 volume = {8},
 year = {1902}
}