default search action
Search dblp for Publications
export results for "toc:db/journals/jalc/jalc18.bht:"
@article{DBLP:journals/jalc/BarendregtCK13, author = {Henk Barendregt and Venanzio Capretta and Dexter Kozen}, title = {Reflection in the Chomsky Hierarchy}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {1}, pages = {53--60}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-053}, doi = {10.25596/JALC-2013-053}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/BarendregtCK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/Dominic13, author = {Charles Dominic}, title = {{\(\delta\)}-Neighborhood Chromatic Index of a Graph}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {2}, pages = {65--70}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-065}, doi = {10.25596/JALC-2013-065}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/Dominic13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/Harbich13, author = {S. Harbich}, title = {On the Descriptional Complexity of k-Uniformly-Limited Lindenmayer Systems}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {1}, pages = {3--25}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-003}, doi = {10.25596/JALC-2013-003}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/Harbich13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/HigginsA13, author = {Peter M. Higgins and Suhear Alwan}, title = {Languages that Require Full Scanning of Words to Determine Membership}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {2}, pages = {71--95}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-071}, doi = {10.25596/JALC-2013-071}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/HigginsA13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/Kitaev13, author = {Sergey Kitaev}, title = {On Graphs with Representation Number 3}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {2}, pages = {97--112}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-097}, doi = {10.25596/JALC-2013-097}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/Kitaev13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/LuqueMN13, author = {Jean{-}Gabriel Luque and Ludovic Mignot and Florent Nicart}, title = {Some Combinatorial Operators in Language Theory}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {1}, pages = {27--52}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-027}, doi = {10.25596/JALC-2013-027}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/LuqueMN13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jalc/Vagvolgyi13, author = {S{\'{a}}ndor V{\'{a}}gv{\"{o}}lgyi}, title = {Recognizing Relations by Tree Automata}, journal = {J. Autom. Lang. Comb.}, volume = {18}, number = {2}, pages = {113--125}, year = {2013}, url = {https://doi.org/10.25596/jalc-2013-113}, doi = {10.25596/JALC-2013-113}, timestamp = {Mon, 11 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jalc/Vagvolgyi13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.