:facetid:stream:\"streams/journals/jalc\"OK:facetid:stream:streams/journals/jalcStefan Hoffmann 0001State Complexity Bounds for the Commutative Closure of Group Languages.J. Autom. Lang. Comb.281-327-572023Journal Articlesclosedjournals/jalc/00012310.25596/JALC-2023-027https://doi.org/10.25596/jalc-2023-027https://dblp.org/rec/journals/jalc/000123URL#170276Ravid AlonOrna KupfermanMutually Accepting Capacitated Automata.J. Autom. Lang. Comb.281-35-252023Journal Articlesclosedjournals/jalc/AlonK2310.25596/JALC-2023-005https://doi.org/10.25596/jalc-2023-005https://dblp.org/rec/journals/jalc/AlonK23URL#170277Carles CardóAnti-Context-Free Languages.J. Autom. Lang. Comb.284249-2772023Journal Articlesclosedjournals/jalc/Cardo2310.25596/JALC-2023-249https://doi.org/10.25596/jalc-2023-249https://dblp.org/rec/journals/jalc/Cardo23URL#170278Jürgen DassowPareto Grammars.J. Autom. Lang. Comb.284279-2862023Journal Articlesclosedjournals/jalc/Dassow2310.25596/JALC-2023-279https://doi.org/10.25596/jalc-2023-279https://dblp.org/rec/journals/jalc/Dassow23URL#170279Clelia De FeliceFinite Maximal Codes and Factorizations of Cyclic Groups.J. Autom. Lang. Comb.284287-3382023Journal Articlesclosedjournals/jalc/Felice2310.25596/JALC-2023-287https://doi.org/10.25596/jalc-2023-287https://dblp.org/rec/journals/jalc/Felice23URL#170280Galina JiráskováGiovanni PighizziniPreface.J. Autom. Lang. Comb.281-33-42023Journal Articlesclosedjournals/jalc/JiraskovaP2310.25596/JALC-2023-003https://doi.org/10.25596/jalc-2023-003https://dblp.org/rec/journals/jalc/JiraskovaP23URL#170281Martin KutribAndreas MalcherCarlo MereghettiBeatrice PalanoIterated Uniform Finite-State Transducers: Descriptional Complexity of Nondeterminism and Two-Way Motion.J. Autom. Lang. Comb.281-359-882023Journal Articlesclosedjournals/jalc/KutribMMP2310.25596/JALC-2023-059https://doi.org/10.25596/jalc-2023-059https://dblp.org/rec/journals/jalc/KutribMMP23URL#170282Pierre MarcusIlkka TörmäWinning Sets of Regular Languages: Descriptional and Computational Complexity.J. Autom. Lang. Comb.281-389-1202023Journal Articlesclosedjournals/jalc/MarcusT2310.25596/JALC-2023-089https://doi.org/10.25596/jalc-2023-089https://dblp.org/rec/journals/jalc/MarcusT23URL#170283Alexander OkhotinElizaveta SazhnevaState Complexity of GF(2)-Inverse and GF(2)-Star on Binary Languages.J. Autom. Lang. Comb.281-3121-1412023Journal Articlesclosedjournals/jalc/OkhotinS2310.25596/JALC-2023-121https://doi.org/10.25596/jalc-2023-121https://dblp.org/rec/journals/jalc/OkhotinS23URL#170284Daniel PrusaTwo-Dimensional Rank-Reducing Grammars and Their Complexity.J. Autom. Lang. Comb.281-3143-1662023Journal Articlesclosedjournals/jalc/Prusa2310.25596/JALC-2023-143https://doi.org/10.25596/jalc-2023-143https://dblp.org/rec/journals/jalc/Prusa23URL#170285Victor L. SelivanovWadge Degrees of Classes of ω-Regular k-Partitions.J. Autom. Lang. Comb.281-3167-1992023Journal Articlesclosedjournals/jalc/Selivanov2310.25596/JALC-2023-167https://doi.org/10.25596/jalc-2023-167https://dblp.org/rec/journals/jalc/Selivanov23URL#170286Taylor J. SmithKai SalomaaRecognition and Complexity Results for Projection Languages of Two-Dimensional Automata.J. Autom. Lang. Comb.281-3201-2202023Journal Articlesclosedjournals/jalc/SmithS2310.25596/JALC-2023-201https://doi.org/10.25596/jalc-2023-201https://dblp.org/rec/journals/jalc/SmithS23URL#170287Martin VuHenning FernauInsertion-Deletion with Substitutions II: About the Role of One-Sided Context.J. Autom. Lang. Comb.281-3221-2442023Journal Articlesclosedjournals/jalc/VuF2310.25596/JALC-2023-221https://doi.org/10.25596/jalc-2023-221https://dblp.org/rec/journals/jalc/VuF23URL#170288Artiom AlhazovRudolf FreundSergiu Ivanov 0001Sergey VerlanRegulated Insertion-Deletion Systems.J. Autom. Lang. Comb.271-315-452022Journal Articlesclosedjournals/jalc/AlhazovF0V2210.25596/JALC-2022-015https://doi.org/10.25596/jalc-2022-015https://dblp.org/rec/journals/jalc/AlhazovF0V22URL#663052Holger Bock AxelsenMartin KutribAndreas MalcherReversible Shrinking Two-Pushdown Automata.J. Autom. Lang. Comb.271-347-772022Journal Articlesclosedjournals/jalc/AxelsenKM2210.25596/JALC-2022-047https://doi.org/10.25596/jalc-2022-047https://dblp.org/rec/journals/jalc/AxelsenKM22URL#663053Péter BattyányiTamás MihálydeákGyörgy VaszilRough-Set-Like Approximation Spaces for Formal Languages.J. Autom. Lang. Comb.271-379-902022Journal Articlesclosedjournals/jalc/BattyanyiMV2210.25596/JALC-2022-079https://doi.org/10.25596/jalc-2022-079https://dblp.org/rec/journals/jalc/BattyanyiMV22URL#663054Henning BordihnHelmut JürgensenMulti-Wave Soliton Automata.J. Autom. Lang. Comb.271-391-1302022Journal Articlesclosedjournals/jalc/BordihnJ2210.25596/JALC-2022-091https://doi.org/10.25596/jalc-2022-091https://dblp.org/rec/journals/jalc/BordihnJ22URL#663055P. Anusha DeviS. MonikandanDegree Associated Edge Reconstruction Parameters of Strong Double Brooms.J. Autom. Lang. Comb.274259-2692022Journal Articlesclosedjournals/jalc/DeviM2210.25596/JALC-2022-259https://doi.org/10.25596/jalc-2022-259https://dblp.org/rec/journals/jalc/DeviM22URL#663056Szilárd Zsolt FazekasRobert MercasOlívia WuComplexities for Jumps and Sweeps.J. Autom. Lang. Comb.271-3131-1492022Journal Articlesclosedjournals/jalc/FazekasMW2210.25596/JALC-2022-131https://doi.org/10.25596/jalc-2022-131https://dblp.org/rec/journals/jalc/FazekasMW22URL#663057Lila KariKalpana MahalingamPalak PandohZihao WangPrimitivity of Atom Watson-Crick Fibonacci Words.J. Autom. Lang. Comb.271-3151-1782022Journal Articlesclosedjournals/jalc/KariMPW2210.25596/JALC-2022-151https://doi.org/10.25596/jalc-2022-151https://dblp.org/rec/journals/jalc/KariMPW22URL#663058Tore KoßReverting and Combining Soliton Bursts.J. Autom. Lang. Comb.271-3179-1862022Journal Articlesclosedjournals/jalc/Koss2210.25596/JALC-2022-179https://doi.org/10.25596/jalc-2022-179https://dblp.org/rec/journals/jalc/Koss22URL#663059Dávid KószóWeighted Tree Generating Regular Systems over Strong Bimonoids with Reduction Semantics.J. Autom. Lang. Comb.274271-3072022Journal Articlesclosedjournals/jalc/Koszo2210.25596/JALC-2022-271https://doi.org/10.25596/jalc-2022-271https://dblp.org/rec/journals/jalc/Koszo22URL#663060Oliver A. S. LyonKai SalomaaNondeterministic State Complexity of Site-Directed Insertion.J. Autom. Lang. Comb.271-3187-1972022Journal Articlesclosedjournals/jalc/LyonS2210.25596/JALC-2022-187https://doi.org/10.25596/jalc-2022-187https://dblp.org/rec/journals/jalc/LyonS22URL#663061Florin ManeaBianca TruthePreface and Greeting Messages.J. Autom. Lang. Comb.271-33-132022Journal Articlesclosedjournals/jalc/ManeaT2210.25596/JALC-2022-003https://doi.org/10.25596/jalc-2022-003https://dblp.org/rec/journals/jalc/ManeaT22URL#663062Toufik MansourArmend Shaban ShabaniCounting Border Edges in Bargraphs.J. Autom. Lang. Comb.274309-3212022Journal Articlesclosedjournals/jalc/MansourS2210.25596/JALC-2022-309https://doi.org/10.25596/jalc-2022-309https://dblp.org/rec/journals/jalc/MansourS22URL#663063Frantisek MrázFriedrich OttoRecognizing Picture Languages by Reductions to String Languages.J. Autom. Lang. Comb.271-3199-2282022Journal Articlesclosedjournals/jalc/MrazO2210.25596/JALC-2022-199https://doi.org/10.25596/jalc-2022-199https://dblp.org/rec/journals/jalc/MrazO22URL#663064Giovanni PighizziniLuca PrigionieroSimon Sádovský1-Limited Automata: Witness Languages and Techniques.J. Autom. Lang. Comb.271-3229-2442022Journal Articlesclosedjournals/jalc/PighizziniPS2210.25596/JALC-2022-229https://doi.org/10.25596/jalc-2022-229https://dblp.org/rec/journals/jalc/PighizziniPS22URL#663065David Fernando Casas TorresA Characterization of Totally Compatible Automata.J. Autom. Lang. Comb.274249-2572022Journal Articlesclosedjournals/jalc/Torres2210.25596/JALC-2022-249https://doi.org/10.25596/jalc-2022-249https://dblp.org/rec/journals/jalc/Torres22URL#663066Juan Trianar-Stirling Numbers of the Second Kind Through Context-free Grammars.J. Autom. Lang. Comb.274323-3332022Journal Articlesclosedjournals/jalc/Triana2210.25596/JALC-2022-323https://doi.org/10.25596/jalc-2022-323https://dblp.org/rec/journals/jalc/Triana22URL#663067Chiara BindiMarco Pellegrini 0006Giuseppe PirilloSome Results about Maximal Primitive Sets.J. Autom. Lang. Comb.261-27-152021Journal Articlesclosedjournals/jalc/BindiPP2110.25596/JALC-2021-007https://doi.org/10.25596/jalc-2021-007https://dblp.org/rec/journals/jalc/BindiPP21URL#1137838Sabine BrodaEva MaiaNelma MoreiraRogério ReisThe Prefix Automaton.J. Autom. Lang. Comb.261-217-532021Journal Articlesclosedjournals/jalc/BrodaMMR2110.25596/JALC-2021-017https://doi.org/10.25596/jalc-2021-017https://dblp.org/rec/journals/jalc/BrodaMMR21URL#1137839David CallanToufik MansourJosé Luis RamírezStatistics on Bargraphs of Catalan Words.J. Autom. Lang. Comb.263-4177-1962021Journal Articlesclosedjournals/jalc/CallanMR2110.25596/JALC-2021-177https://doi.org/10.25596/jalc-2021-177https://dblp.org/rec/journals/jalc/CallanMR21URL#1137840Sigrid EwertJoy IdahosaOgden's Lemma for Subclasses of Random Context Galleries.J. Autom. Lang. Comb.263-4197-2202021Journal Articlesclosedjournals/jalc/EwertI2110.25596/JALC-2021-197https://doi.org/10.25596/jalc-2021-197https://dblp.org/rec/journals/jalc/EwertI21URL#1137841Szilárd Zsolt FazekasPreface.J. Autom. Lang. Comb.261-23-52021Journal Articlesclosedjournals/jalc/Fazekas2110.25596/JALC-2021-003https://doi.org/10.25596/jalc-2021-003https://dblp.org/rec/journals/jalc/Fazekas21URL#1137842Lukas FleischerJeffrey O. ShallitAutomata, Palindromes, and Reversed Subwords.J. Autom. Lang. Comb.263-4221-2532021Journal Articlesclosedjournals/jalc/FleischerS2110.25596/JALC-2021-221https://doi.org/10.25596/jalc-2021-221https://dblp.org/rec/journals/jalc/FleischerS21URL#1137843Carolin HannuschGéza HorváthProperties of Hash Functions based on Gluškov Product of Automata.J. Autom. Lang. Comb.261-255-652021Journal Articlesclosedjournals/jalc/HannuschH2110.25596/JALC-2021-055https://doi.org/10.25596/jalc-2021-055https://dblp.org/rec/journals/jalc/HannuschH21URL#1137844Lila KariManasi S. KulkarniKalpana MahalingamZihao WangInvolutive Fibonacci Words.J. Autom. Lang. Comb.263-4255-2802021Journal Articlesclosedjournals/jalc/KariKMW2110.25596/JALC-2021-255https://doi.org/10.25596/jalc-2021-255https://dblp.org/rec/journals/jalc/KariKMW21URL#1137845Olga KarpovaArseny M. ShurWords Separation and Positive Identities in Symmetric Groups.J. Autom. Lang. Comb.261-267-892021Journal Articlesclosedjournals/jalc/KarpovaS2110.25596/JALC-2021-067https://doi.org/10.25596/jalc-2021-067https://dblp.org/rec/journals/jalc/KarpovaS21URL#1137846Peter LeupoldOn the Unavoidability of Primitive Words and other Languages.J. Autom. Lang. Comb.261-291-1072021Journal Articlesclosedjournals/jalc/Leupold2110.25596/JALC-2021-091https://doi.org/10.25596/jalc-2021-091https://dblp.org/rec/journals/jalc/Leupold21URL#1137847Stoyan MihovKlaus U. SchulzF-Transducers for Contextual Text Rewriting.J. Autom. Lang. Comb.263-4281-3322021Journal Articlesclosedjournals/jalc/MihovS2110.25596/JALC-2021-281https://doi.org/10.25596/jalc-2021-281https://dblp.org/rec/journals/jalc/MihovS21URL#1137848Victor MitranaAndrei PaunMihaela PaunJosé Ángel Sánchez MartínNon-preserving Accepting Splicing Systems.J. Autom. Lang. Comb.261-2109-1242021Journal Articlesclosedjournals/jalc/MitranaPPM2110.25596/JALC-2021-109https://doi.org/10.25596/jalc-2021-109https://dblp.org/rec/journals/jalc/MitranaPPM21URL#1137849Kenichi MoritaConstructing Reversible Turing Machines in a Reversible and Conservative Elementary Triangular Cellular Automaton.J. Autom. Lang. Comb.261-2125-1442021Journal Articlesclosedjournals/jalc/Morita2110.25596/JALC-2021-125https://doi.org/10.25596/jalc-2021-125https://dblp.org/rec/journals/jalc/Morita21URL#1137850Frantisek MrázFriedrich OttoDana PardubskáMartin PlátekLexicalized Syntactic Analysis by Two-Way Restarting Automata.J. Autom. Lang. Comb.261-2145-1712021Journal Articlesclosedjournals/jalc/MrazOPP2110.25596/JALC-2021-145https://doi.org/10.25596/jalc-2021-145https://dblp.org/rec/journals/jalc/MrazOPP21URL#1137851Markus Holzer 0001Martin KutribAutomata That May Change Their Mind.J. Autom. Lang. Comb.252-3115-1402020Journal Articlesclosedjournals/jalc/0001K2010.25596/JALC-2020-115https://doi.org/10.25596/jalc-2020-115https://dblp.org/rec/journals/jalc/0001K20URL#1595594Ondrej Klíma 0001Libor PolákForbidden Patterns for Ordered Automata.J. Autom. Lang. Comb.252-3141-1692020Journal Articlesclosedjournals/jalc/0001P2010.25596/JALC-2020-141https://doi.org/10.25596/jalc-2020-141https://dblp.org/rec/journals/jalc/0001P20URL#1595595Aubrey BlecherCharlotte A. C. BrennanArnold KnopfmacherToufik MansourMark ShattuckCounting Permutations by the Number of Vertical Edges in Their Bargraphs.J. Autom. Lang. Comb.254279-2902020Journal Articlesclosedjournals/jalc/BlecherBKMS2010.25596/JALC-2020-279https://doi.org/10.25596/jalc-2020-279https://dblp.org/rec/journals/jalc/BlecherBKMS20URL#1595596Pascal CaronJean-Gabriel LuqueBruno PatrouA Combinatorial Approach for the State Complexity of the Shuffle Product.J. Autom. Lang. Comb.254291-3202020Journal Articlesclosedjournals/jalc/CaronLP2010.25596/JALC-2020-291https://doi.org/10.25596/jalc-2020-291https://dblp.org/rec/journals/jalc/CaronLP20URL#1595597Jürgen DassowLindenmayer Systems with Control by Ideals and Codes.J. Autom. Lang. Comb.2513-202020Journal Articlesclosedjournals/jalc/Dassow2010.25596/JALC-2020-003https://doi.org/10.25596/jalc-2020-003https://dblp.org/rec/journals/jalc/Dassow20URL#1595598Jürgen DassowBianca TrutheGenerating Networks of Evolutionary Processors with Resources Restricted and Structure Limited Filters.J. Autom. Lang. Comb.252-383-1132020Journal Articlesclosedjournals/jalc/DassowT2010.25596/JALC-2020-083https://doi.org/10.25596/jalc-2020-083https://dblp.org/rec/journals/jalc/DassowT20URL#1595599Sigrid EwertDaria Sergeevna TkachovaNecessary Conditions for Subclasses of Random Context Galleries.J. Autom. Lang. Comb.25121-352020Journal Articlesclosedjournals/jalc/EwertT2010.25596/JALC-2020-021https://doi.org/10.25596/jalc-2020-021https://dblp.org/rec/journals/jalc/EwertT20URL#1595600Michal HospodárGalina JiráskováGiovanni PighizziniPreface.J. Autom. Lang. Comb.252-381-822020Journal Articlesclosedjournals/jalc/HospodarJP2010.25596/JALC-2020-081https://doi.org/10.25596/jalc-2020-081https://dblp.org/rec/journals/jalc/HospodarJP20URL#1595601Radim KocmanZbynek KrivkaAlexander MedunaGeneral CD Grammar Systems and Their Simplification.J. Autom. Lang. Comb.25137-542020Journal Articlesclosedjournals/jalc/KocmanKM2010.25596/JALC-2020-037https://doi.org/10.25596/jalc-2020-037https://dblp.org/rec/journals/jalc/KocmanKM20URL#1595602Stavros KonstantinidisEvery Regular Bifix Code is a Finite Union of Regular Infix Codes.J. Autom. Lang. Comb.25155-592020Journal Articlesclosedjournals/jalc/Konstantinidis2010.25596/JALC-2020-055https://doi.org/10.25596/jalc-2020-055https://dblp.org/rec/journals/jalc/Konstantinidis20URL#1595603Martin KutribFriedrich OttoOn Two-Sided Locally Testable Languages.J. Autom. Lang. Comb.252-3171-1992020Journal Articlesclosedjournals/jalc/KutribO2010.25596/JALC-2020-171https://doi.org/10.25596/jalc-2020-171https://dblp.org/rec/journals/jalc/KutribO20URL#1595604Kalpana MahalingamPrithwineel PaulOn Szilard Languages of InsDel Systems.J. Autom. Lang. Comb.254321-3482020Journal Articlesclosedjournals/jalc/MahalingamP2010.25596/JALC-2020-321https://doi.org/10.25596/jalc-2020-321https://dblp.org/rec/journals/jalc/MahalingamP20URL#1595605Toufik MansourMatthias SchorkArmend Shaban ShabaniRestricted Lego Towers.J. Autom. Lang. Comb.25161-762020Journal Articlesclosedjournals/jalc/MansourSS2010.25596/JALC-2020-061https://doi.org/10.25596/jalc-2020-061https://dblp.org/rec/journals/jalc/MansourSS20URL#1595606Martin PlátekFriedrich OttoFrantisek MrázOn h-Lexicalized Restarting List Automata.J. Autom. Lang. Comb.252-3201-2342020Journal Articlesclosedjournals/jalc/PlatekOM2010.25596/JALC-2020-201https://doi.org/10.25596/jalc-2020-201https://dblp.org/rec/journals/jalc/PlatekOM20URL#1595607Tomoyuki YamakamiOne-Way Topological Automata and the Tantalizing Effects of Their Topological Features.J. Autom. Lang. Comb.252-3235-2732020Journal Articlesclosedjournals/jalc/Yamakami2010.25596/JALC-2020-235https://doi.org/10.25596/jalc-2020-235https://dblp.org/rec/journals/jalc/Yamakami20URL#1595608Niklas ZechnerDerivatives of Regular Expressions with Cuts.J. Autom. Lang. Comb.254349-3552020Journal Articlesclosedjournals/jalc/Zechner2010.25596/JALC-2020-349https://doi.org/10.25596/jalc-2020-349https://dblp.org/rec/journals/jalc/Zechner20URL#1595609Pavel AgeevImplementation of the Algorithm for Testing an Automaton for Synchronization in Linear Expected Time.J. Autom. Lang. Comb.242-4139-1522019Journal Articlesclosedjournals/jalc/Ageev1910.25596/JALC-2019-139https://doi.org/10.25596/jalc-2019-139https://dblp.org/rec/journals/jalc/Ageev19URL#2024509Dmitry S. AnanichevVojtech VorelA new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink.J. Autom. Lang. Comb.242-4153-1642019Journal Articlesclosedjournals/jalc/AnanichevV1910.25596/JALC-2019-153https://doi.org/10.25596/jalc-2019-153https://dblp.org/rec/journals/jalc/AnanichevV19URL#2024510Bas BroereHans ZantemaThe k-Dimensional Cube is k-Representable.J. Autom. Lang. Comb.2413-122019Journal Articlesclosedjournals/jalc/BroereZ1910.25596/JALC-2019-003https://doi.org/10.25596/jalc-2019-003https://dblp.org/rec/journals/jalc/BroereZ19URL#2024511Pascal CaronMarianne FlouretLudovic Mignot(k,l)-Unambiguity and Quasi-Deterministic Structures.J. Autom. Lang. Comb.24113-492019Journal Articlesclosedjournals/jalc/CaronFM1910.25596/JALC-2019-013https://doi.org/10.25596/jalc-2019-013https://dblp.org/rec/journals/jalc/CaronFM19URL#2024512Arturo CarpiFlavio D'AlessandroLocally Strongly Transitive Automata in the Černý Conjecture and Related Problems.J. Autom. Lang. Comb.242-4165-1842019Journal Articlesclosedjournals/jalc/CarpiD1910.25596/JALC-2019-165https://doi.org/10.25596/jalc-2019-165https://dblp.org/rec/journals/jalc/CarpiD19URL#2024513Costanza CatalanoRaphaël M. JungersOn Random Primitive Sets, Directable NFAs and the Generation of Slowly Synchronizing DFAs.J. Autom. Lang. Comb.242-4185-2172019Journal Articlesclosedjournals/jalc/CatalanoJ1910.25596/JALC-2019-185https://doi.org/10.25596/jalc-2019-185https://dblp.org/rec/journals/jalc/CatalanoJ19URL#2024514Ján CernýA Note on Homogeneous Experiments with Finite Automata.J. Autom. Lang. Comb.242-4123-1322019Journal Articlesclosedjournals/jalc/Cerny1910.25596/JALC-2019-123https://doi.org/10.25596/jalc-2019-123https://dblp.org/rec/journals/jalc/Cerny19URL#2024515Dmitry Chistikov 0001Pavel MartyuginMahsa ShirmohammadiSynchronizing Automata over Nested Words.J. Autom. Lang. Comb.242-4219-2512019Journal Articlesclosedjournals/jalc/ChistikovMS1910.25596/JALC-2019-219https://doi.org/10.25596/jalc-2019-219https://dblp.org/rec/journals/jalc/ChistikovMS19URL#2024516Henk DonHans ZantemaCounting Symbol Switches in Synchronizing Automata.J. Autom. Lang. Comb.242-4253-2862019Journal Articlesclosedjournals/jalc/DonZ1910.25596/JALC-2019-253https://doi.org/10.25596/jalc-2019-253https://dblp.org/rec/journals/jalc/DonZ19URL#2024517Hossein Teimoori FaalA Multiset Analogue of Cofactors.J. Autom. Lang. Comb.24165-872019Journal Articlesclosedjournals/jalc/Faal1910.25596/JALC-2019-065https://doi.org/10.25596/jalc-2019-065https://dblp.org/rec/journals/jalc/Faal19URL#2024518Henning FernauStefan Hoffmann 0001Extensions to Minimal Synchronizing Words.J. Autom. Lang. Comb.242-4287-3072019Journal Articlesclosedjournals/jalc/Fernau01910.25596/JALC-2019-287https://doi.org/10.25596/jalc-2019-287https://dblp.org/rec/journals/jalc/Fernau019URL#2024519Achille FrigeriEmanuele RodaroMissing Factors of Ideals and Synchronizing Automata.J. Autom. Lang. Comb.242-4309-3202019Journal Articlesclosedjournals/jalc/FrigeriR1910.25596/JALC-2019-309https://doi.org/10.25596/jalc-2019-309https://dblp.org/rec/journals/jalc/FrigeriR19URL#2024520François GonzeRaphaël M. JungersHardly Reachable Subsets and Completely Reachable Automata with 1-Deficient Words.J. Autom. Lang. Comb.242-4321-3422019Journal Articlesclosedjournals/jalc/GonzeJ1910.25596/JALC-2019-321https://doi.org/10.25596/jalc-2019-321https://dblp.org/rec/journals/jalc/GonzeJ19URL#2024521Toufik MansourArmend Shaban ShabaniDaniel YaqubiCell Patterns in Integer Partitions.J. Autom. Lang. Comb.24151-632019Journal Articlesclosedjournals/jalc/MansourSY1910.25596/JALC-2019-051https://doi.org/10.25596/jalc-2019-051https://dblp.org/rec/journals/jalc/MansourSY19URL#2024522Cyril NicaudThe Černý Conjecture Holds with High Probability.J. Autom. Lang. Comb.242-4343-3652019Journal Articlesclosedjournals/jalc/Nicaud1910.25596/JALC-2019-343https://doi.org/10.25596/jalc-2019-343https://dblp.org/rec/journals/jalc/Nicaud19URL#2024523Yaroslav ShitovAn Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata.J. Autom. Lang. Comb.242-4367-3732019Journal Articlesclosedjournals/jalc/Shitov1910.25596/JALC-2019-367https://doi.org/10.25596/jalc-2019-367https://dblp.org/rec/journals/jalc/Shitov19URL#2024524Peter H. StarkeA Remark About Homogeneous Experiments.J. Autom. Lang. Comb.242-4133-1372019Journal Articlesclosedjournals/jalc/Starke1910.25596/JALC-2019-133https://doi.org/10.25596/jalc-2019-133https://dblp.org/rec/journals/jalc/Starke19URL#2024525Mikhail V. Volkov 0001Preface.J. Autom. Lang. Comb.242-4119-1212019Journal Articlesclosedjournals/jalc/Volkov1910.25596/JALC-2019-119https://doi.org/10.25596/jalc-2019-119https://dblp.org/rec/journals/jalc/Volkov19URL#2024526Mikhail V. Volkov 0001Slowly Synchronizing Automata with Idempotent Letters of Low Rank.J. Autom. Lang. Comb.242-4375-3862019Journal Articlesclosedjournals/jalc/Volkov19a10.25596/JALC-2019-375https://doi.org/10.25596/jalc-2019-375https://dblp.org/rec/journals/jalc/Volkov19aURL#2024527Markus A. WhitelandAsymptotic Abelian Complexities of Certain Morphic Binary Words.J. Autom. Lang. Comb.24189-1142019Journal Articlesclosedjournals/jalc/Whiteland1910.25596/JALC-2019-089https://doi.org/10.25596/jalc-2019-089https://dblp.org/rec/journals/jalc/Whiteland19URL#2024528Dávid AngyalBenedek NagyGyörgy VaszilOn the Complexity of a Mildly Context-Sensitive Language Class.J. Autom. Lang. Comb.231-35-182018Journal Articlesclosedjournals/jalc/AngyalNV1810.25596/JALC-2018-005https://doi.org/10.25596/jalc-2018-005https://dblp.org/rec/journals/jalc/AngyalNV18URL#2430704Suna BenschHenning BordihnInformation, Codes, and Languages - Preface.J. Autom. Lang. Comb.231-33-42018Journal Articlesclosedjournals/jalc/BenschB1810.25596/JALC-2018-003https://doi.org/10.25596/jalc-2018-003https://dblp.org/rec/journals/jalc/BenschB18URL#2430705Martin BerglundFrank DrewesBrink van der MerweThe Output Size Problem for String-to-Tree Transducers.J. Autom. Lang. Comb.231-319-382018Journal Articlesclosedjournals/jalc/BerglundDM1810.25596/JALC-2018-019https://doi.org/10.25596/jalc-2018-019https://dblp.org/rec/journals/jalc/BerglundDM18URL#2430706Sabine BrodaAntónio MachiaveloNelma MoreiraRogério ReisPosition Automata for Semi-extended Expressions.J. Autom. Lang. Comb.231-339-652018Journal Articlesclosedjournals/jalc/BrodaMMR1810.25596/JALC-2018-039https://doi.org/10.25596/jalc-2018-039https://dblp.org/rec/journals/jalc/BrodaMMR18URL#2430707Janusz A. BrzozowskiTowards a Theory of Complexity of Regular Languages.J. Autom. Lang. Comb.231-367-1012018Journal Articlesclosedjournals/jalc/Brzozowski1810.25596/JALC-2018-067https://doi.org/10.25596/jalc-2018-067https://dblp.org/rec/journals/jalc/Brzozowski18URL#2430708Cristian S. CaludeLudwig StaigerA Simple Construction of Absolutely Disjunctive Liouville Numbers.J. Autom. Lang. Comb.231-3103-1092018Journal Articlesclosedjournals/jalc/CaludeS1810.25596/JALC-2018-103https://doi.org/10.25596/jalc-2018-103https://dblp.org/rec/journals/jalc/CaludeS18URL#2430709Cezar CâmpeanuWhat is a Complex Regular Language?J. Autom. Lang. Comb.231-3111-1262018Journal Articlesclosedjournals/jalc/Campeanu1810.25596/JALC-2018-111https://doi.org/10.25596/jalc-2018-111https://dblp.org/rec/journals/jalc/Campeanu18URL#2430710Mark DaleyMark G. EramianChristopher PowerIan McQuillanFrom Helmut Jürgensen's Former Students: The Game of Informatics Research.J. Autom. Lang. Comb.231-3127-1412018Journal Articlesclosedjournals/jalc/DaleyEPM1810.25596/JALC-2018-127https://doi.org/10.25596/jalc-2018-127https://dblp.org/rec/journals/jalc/DaleyEPM18URL#2430711Jürgen DassowGrammars with Control by Ideals and Codes.J. Autom. Lang. Comb.231-3143-1642018Journal Articlesclosedjournals/jalc/Dassow1810.25596/JALC-2018-143https://doi.org/10.25596/jalc-2018-143https://dblp.org/rec/journals/jalc/Dassow18URL#2430712Henk DonHans ZantemaSynchronizing Non-Deterministic Finite Automata.J. Autom. Lang. Comb.234307-3282018Journal Articlesclosedjournals/jalc/DonZ1810.25596/JALC-2018-307https://doi.org/10.25596/jalc-2018-307https://dblp.org/rec/journals/jalc/DonZ18URL#2430713Henning FernauLakshmanan KuppusamyIndhumathi RamanProperties of Language Classes Between Linear and Context-Free.J. Autom. Lang. Comb.234329-3602018Journal Articlesclosedjournals/jalc/FernauKR1810.25596/JALC-2018-329https://doi.org/10.25596/jalc-2018-329https://dblp.org/rec/journals/jalc/FernauKR18URL#2430714Maia HoeberechtsComputational Requirements Hidden Behind Encodings.J. Autom. Lang. Comb.231-3165-1882018Journal Articlesclosedjournals/jalc/Hoeberechts1810.25596/JALC-2018-165https://doi.org/10.25596/jalc-2018-165https://dblp.org/rec/journals/jalc/Hoeberechts18URL#2430715Oscar H. IbarraIan McQuillanOn the Density of Languages Accepted by Turing Machines and Other Machine Models.J. Autom. Lang. Comb.231-3189-1992018Journal Articlesclosedjournals/jalc/IbarraM1810.25596/JALC-2018-189https://doi.org/10.25596/jalc-2018-189https://dblp.org/rec/journals/jalc/IbarraM18URL#2430716Lila KariManasi S. KulkarniKalpana MahalingamRelative Watson-Crick Primitivity of Words.J. Autom. Lang. Comb.231-3201-2172018Journal Articlesclosedjournals/jalc/KariKM1810.25596/JALC-2018-201https://doi.org/10.25596/jalc-2018-201https://dblp.org/rec/journals/jalc/KariKM18URL#2430717Wiebke KöhlmannFrancis ZinkeUlrike LuckeElnaz MazandaraniMarlene KarlappUser Interface Filters for Tactile Braille Displays.J. Autom. Lang. Comb.231-3219-2412018Journal Articlesclosedjournals/jalc/KohlmannZLMK1810.25596/JALC-2018-219https://doi.org/10.25596/jalc-2018-219https://dblp.org/rec/journals/jalc/KohlmannZLMK18URL#2430718Stavros KonstantinidisCasey MeijerNelma MoreiraRogério ReisSymbolic Manipulation of Code Properties.J. Autom. Lang. Comb.231-3243-2692018Journal Articlesclosedjournals/jalc/KonstantinidisM1810.25596/JALC-2018-243https://doi.org/10.25596/jalc-2018-243https://dblp.org/rec/journals/jalc/KonstantinidisM18URL#2430719Matthew McDevittA Class of Rational Relations Generalising the Subword Order.J. Autom. Lang. Comb.234361-3862018Journal Articlesclosedjournals/jalc/McDevitt1810.25596/JALC-2018-361https://doi.org/10.25596/jalc-2018-361https://dblp.org/rec/journals/jalc/McDevitt18URL#2430720Frantisek MrázFriedrich OttoOn Deleting Deterministic Restarting Automata That Have Two Windows.J. Autom. Lang. Comb.234387-4172018Journal Articlesclosedjournals/jalc/MrazO1810.25596/JALC-2018-387https://doi.org/10.25596/jalc-2018-387https://dblp.org/rec/journals/jalc/MrazO18URL#2430721Paul-Patrick NordmannMichael GösselRegular LPDC Codes with Guaranteed Minimal Hamming Distance.J. Autom. Lang. Comb.231-3271-2802018Journal Articlesclosedjournals/jalc/NordmannG1810.25596/JALC-2018-271https://doi.org/10.25596/jalc-2018-271https://dblp.org/rec/journals/jalc/NordmannG18URL#2430722Alexandros PalioudakisYo-Sub HanKai SalomaaGrowth Rate of Minimum Branching.J. Autom. Lang. Comb.231-3281-2922018Journal Articlesclosedjournals/jalc/PalioudakisHS1810.25596/JALC-2018-281https://doi.org/10.25596/jalc-2018-281https://dblp.org/rec/journals/jalc/PalioudakisHS18URL#2430723Arto SalomaaFrom Infinite to Finite by Identifying Variables in Many-Valued Logic.J. Autom. Lang. Comb.231-3293-3012018Journal Articlesclosedjournals/jalc/Salomaa1810.25596/JALC-2018-293https://doi.org/10.25596/jalc-2018-293https://dblp.org/rec/journals/jalc/Salomaa18URL#2430724Timothy Ng 0001David RappaportKai SalomaaState Complexity of Prefix Distance of Subregular Languages.J. Autom. Lang. Comb.221-3169-1882017Journal Articlesclosedjournals/jalc/0001RS1710.25596/JALC-2017-169https://doi.org/10.25596/jalc-2017-169https://dblp.org/rec/journals/jalc/0001RS17URL#2797937Rafaela BastosSabine BrodaAntónio MachiaveloNelma MoreiraRogério ReisOn the Average Complexity of Partial Derivative Automata for Semi-extended Expressions.J. Autom. Lang. Comb.221-35-282017Journal Articlesclosedjournals/jalc/BastosBMMR1710.25596/JALC-2017-005https://doi.org/10.25596/jalc-2017-005https://dblp.org/rec/journals/jalc/BastosBMMR17URL#2797938Kevin BlackFrancine Blanchet-SadriIan ColeyBrent WoodhouseAndrew ZemkePattern Avoidance in Partial Words Dense with Holes.J. Autom. Lang. Comb.224209-2412017Journal Articlesclosedjournals/jalc/BlackBCWZ1710.25596/JALC-2017-209https://doi.org/10.25596/jalc-2017-209https://dblp.org/rec/journals/jalc/BlackBCWZ17URL#2797939Janusz A. BrzozowskiCorwin SinnamonUnrestricted State Complexity of Binary Operations on Regular and Ideal Languages.J. Autom. Lang. Comb.221-329-592017Journal Articlesclosedjournals/jalc/BrzozowskiS1710.25596/JALC-2017-029https://doi.org/10.25596/jalc-2017-029https://dblp.org/rec/journals/jalc/BrzozowskiS17URL#2797940Cezar CâmpeanuFlorin ManeaGiovanni PighizziniJeffrey O. ShallitPreface.J. Autom. Lang. Comb.221-33-42017Journal Articlesclosedjournals/jalc/CampeanuMPS1710.25596/JALC-2017-003https://doi.org/10.25596/jalc-2017-003https://dblp.org/rec/journals/jalc/CampeanuMPS17URL#2797941Jean-Marc ChamparnaudLudovic MignotNadia Ouali SebtiDjelloul ZiadiBottom-Up Quotients for Tree Languages.J. Autom. Lang. Comb.224243-2692017Journal Articlesclosedjournals/jalc/ChamparnaudMSZ1710.25596/JALC-2017-243https://doi.org/10.25596/jalc-2017-243https://dblp.org/rec/journals/jalc/ChamparnaudMSZ17URL#2797942Henning FernauLakshmanan KuppusamyIndhumathi RamanOn the Generative Power of Graph-Controlled Insertion-Deletion Systems with Small Sizes.J. Autom. Lang. Comb.221-361-922017Journal Articlesclosedjournals/jalc/FernauKR1710.25596/JALC-2017-061https://doi.org/10.25596/jalc-2017-061https://dblp.org/rec/journals/jalc/FernauKR17URL#2797943Yuan Gao 0001Nelma MoreiraRogério ReisSheng Yu 0001A Survey on Operational State Complexity.J. Autom. Lang. Comb.214251-3102017Journal Articlesclosedjournals/jalc/GaoMRY1710.25596/JALC-2016-251https://doi.org/10.25596/jalc-2016-251https://dblp.org/rec/journals/jalc/GaoMRY17URL#2797944Andrea Herrmann 0002Martin KutribAndreas MalcherMatthias WendlandtDescriptional Complexity of Bounded Regular Languages.J. Autom. Lang. Comb.221-393-1212017Journal Articlesclosedjournals/jalc/HerrmannKMW1710.25596/JALC-2017-093https://doi.org/10.25596/jalc-2017-093https://dblp.org/rec/journals/jalc/HerrmannKMW17URL#2797945Galina JiráskováAlexander SzabariJuraj SebejThe Complexity of Languages Resulting from the Concatenation Operation.J. Autom. Lang. Comb.221-3123-1432017Journal Articlesclosedjournals/jalc/JiraskovaSS1710.25596/JALC-2017-123https://doi.org/10.25596/jalc-2017-123https://dblp.org/rec/journals/jalc/JiraskovaSS17URL#2797946Sandrine JuliaArnaud MalapertJulien ProvillardA Synergic Approach to the Minimal Uncompletable Words Problem.J. Autom. Lang. Comb.224271-2862017Journal Articlesclosedjournals/jalc/JuliaMP1710.25596/JALC-2017-271https://doi.org/10.25596/jalc-2017-271https://dblp.org/rec/journals/jalc/JuliaMP17URL#2797947Stavros KonstantinidisMitja MastnakEmbedding Rationally Independent Languages into Maximal Ones.J. Autom. Lang. Comb.214311-3382017Journal Articlesclosedjournals/jalc/KonstantinidisM1710.25596/JALC-2016-311https://doi.org/10.25596/jalc-2016-311https://dblp.org/rec/journals/jalc/KonstantinidisM17URL#2797948Giovanna J. LavadoGiovanni PighizziniLuca PrigionieroMinimal and Reduced Reversible Automata.J. Autom. Lang. Comb.221-3145-1682017Journal Articlesclosedjournals/jalc/LavadoPP1710.25596/JALC-2017-145https://doi.org/10.25596/jalc-2017-145https://dblp.org/rec/journals/jalc/LavadoPP17URL#2797949Shi-Mei MaToufik MansourHaina WangThe Descent Statistic on Signed Simsun Permutations.J. Autom. Lang. Comb.224287-3022017Journal Articlesclosedjournals/jalc/MaMW1710.25596/JALC-2017-287https://doi.org/10.25596/jalc-2017-287https://dblp.org/rec/journals/jalc/MaMW17URL#2797950John M. MachacekDeleting Powers in Words.J. Autom. Lang. Comb.214339-3492017Journal Articlesclosedjournals/jalc/Machacek1710.25596/JALC-2016-339https://doi.org/10.25596/jalc-2016-339https://dblp.org/rec/journals/jalc/Machacek17URL#2797951Vojtech VorelTwo Results on Discontinuous Input Processing.J. Autom. Lang. Comb.221-3189-2032017Journal Articlesclosedjournals/jalc/Vorel1710.25596/JALC-2017-189https://doi.org/10.25596/jalc-2017-189https://dblp.org/rec/journals/jalc/Vorel17URL#2797952Markus Holzer 0001Martin KutribBianca TrutheEditorial.J. Autom. Lang. Comb.211-23-42016Journal Articlesclosedjournals/jalc/0001KT1610.25596/JALC-2016-003https://doi.org/10.25596/jalc-2016-003https://dblp.org/rec/journals/jalc/0001KT16URL#3133356Markus Holzer 0001Martin KutribBianca TruthePreface.J. Autom. Lang. Comb.211-25-62016Journal Articlesclosedjournals/jalc/0001KT16a10.25596/JALC-2016-005https://doi.org/10.25596/jalc-2016-005https://dblp.org/rec/journals/jalc/0001KT16aURL#3133357Ali AlatabbiAbu Sayed Md. Sohidull IslamMohammad Sohel RahmanJamie SimpsonW. F. SmythEnhanced Covers of Regular and Indeterminate Strings Using Prefix Tables.J. Autom. Lang. Comb.213131-1472016Journal Articlesclosedjournals/jalc/AlatabbiIRSS1610.25596/JALC-2016-131https://doi.org/10.25596/jalc-2016-131https://dblp.org/rec/journals/jalc/AlatabbiIRSS16URL#3133358Artiom AlhazovSergiu Ivanov 0001Elisabeth PelzSergey VerlanSmall Universal Deterministic Petri Nets with Inhibitor Arcs.J. Autom. Lang. Comb.211-27-262016Journal Articlesclosedjournals/jalc/Alhazov0PV1610.25596/JALC-2016-007https://doi.org/10.25596/jalc-2016-007https://dblp.org/rec/journals/jalc/Alhazov0PV16URL#3133359Francine Blanchet-SadriAleksandar ChakarovBob ChenLucas ManuelliSinziana MunteanuJarett SchwartzSlater StichRecurrent Partial Words and Representable Sets.J. Autom. Lang. Comb.213149-1812016Journal Articlesclosedjournals/jalc/Blanchet-SadriC1610.25596/JALC-2016-149https://doi.org/10.25596/jalc-2016-149https://dblp.org/rec/journals/jalc/Blanchet-SadriC16URL#3133360Henning BordihnGyörgy VaszilOn Lindenmayer Systems with Dynamic Control of Parallelism.J. Autom. Lang. Comb.211-227-402016Journal Articlesclosedjournals/jalc/BordihnV1610.25596/JALC-2016-027https://doi.org/10.25596/jalc-2016-027https://dblp.org/rec/journals/jalc/BordihnV16URL#3133361Erzsébet Csuhaj-VarjúKatalin Anna LázárString Assembly in Networks of Evolutionary Processors.J. Autom. Lang. Comb.211-241-542016Journal Articlesclosedjournals/jalc/Csuhaj-VarjuL1610.25596/JALC-2016-041https://doi.org/10.25596/jalc-2016-041https://dblp.org/rec/journals/jalc/Csuhaj-VarjuL16URL#3133362Jürgen DassowEditorial.J. Autom. Lang. Comb.2013-42016Journal Articlesclosedjournals/jalc/Dassow1610.25596/JALC-2015-003https://doi.org/10.25596/jalc-2015-003https://dblp.org/rec/journals/jalc/Dassow16URL#3133363Jürgen DassowOn the Number of Accepting States of Finite Automata.J. Autom. Lang. Comb.211-255-672016Journal Articlesclosedjournals/jalc/Dassow16a10.25596/JALC-2016-055https://doi.org/10.25596/jalc-2016-055https://dblp.org/rec/journals/jalc/Dassow16aURL#3133364Steffen EgerOn the Number of Many-to-Many Alignments of Multiple Sequences.J. Autom. Lang. Comb.20153-652016Journal Articlesclosedjournals/jalc/Eger1610.25596/JALC-2015-053https://doi.org/10.25596/jalc-2015-053https://dblp.org/rec/journals/jalc/Eger16URL#3133365Henning FernauAn Essay on General Grammars.J. Autom. Lang. Comb.211-269-922016Journal Articlesclosedjournals/jalc/Fernau1610.25596/JALC-2016-069https://doi.org/10.25596/jalc-2016-069https://dblp.org/rec/journals/jalc/Fernau16URL#3133366R. D. GiriOn the Recognizability of Right Complete Codes.J. Autom. Lang. Comb.20145-512016Journal Articlesclosedjournals/jalc/Giri1610.25596/JALC-2015-045https://doi.org/10.25596/jalc-2015-045https://dblp.org/rec/journals/jalc/Giri16URL#3133367Alexander KartzowThe Field of the Reals and the Random Graph are not Finite-Word Ordinal-Automatic.J. Autom. Lang. Comb.20127-432016Journal Articlesclosedjournals/jalc/Kartzow1610.25596/JALC-2015-027https://doi.org/10.25596/jalc-2015-027https://dblp.org/rec/journals/jalc/Kartzow16URL#3133368Werner KuichManfred DrosteZoltán Ésik (1951 - 2016) - In Memoriam.J. Autom. Lang. Comb.213129-1302016Journal Articlesclosedjournals/jalc/KuichD1610.25596/JALC-2016-129https://doi.org/10.25596/jalc-2016-129https://dblp.org/rec/journals/jalc/KuichD16URL#3133369Toufik MansourArmend Shaban ShabaniCounting Occurrences of a Pattern of Length Three with at most two Distinct Letters in a k-ary Word.J. Autom. Lang. Comb.213183-2012016Journal Articlesclosedjournals/jalc/MansourS1610.25596/JALC-2016-183https://doi.org/10.25596/jalc-2016-183https://dblp.org/rec/journals/jalc/MansourS16URL#3133370J. Andres MontoyaOpen Problems Related to Palindrome Recognition: Are There Open Problems Related to Palindrome Recognition?J. Autom. Lang. Comb.2015-252016Journal Articlesclosedjournals/jalc/Montoya1610.25596/JALC-2015-005https://doi.org/10.25596/jalc-2015-005https://dblp.org/rec/journals/jalc/Montoya16URL#3133371Mark-Jan NederhofMarkus TeichmannHeiko VoglerNon-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages.J. Autom. Lang. Comb.213203-2462016Journal Articlesclosedjournals/jalc/NederhofTV1610.25596/JALC-2016-203https://doi.org/10.25596/jalc-2016-203https://dblp.org/rec/journals/jalc/NederhofTV16URL#3133372Ronney PolleyLudwig StaigerQuasiperiods, Subword Complexity and the Smallest Pisot Number.J. Autom. Lang. Comb.211-293-1062016Journal Articlesclosedjournals/jalc/PolleyS1610.25596/JALC-2016-093https://doi.org/10.25596/jalc-2016-093https://dblp.org/rec/journals/jalc/PolleyS16URL#3133373Luis Valencia-CabreraDavid Orellana-MartínMiguel A. Martínez-del-AmorAgustin Riscos-NúñezMario J. Pérez-JiménezPolarizationless P Systems with Active Membranes: Computational Complexity Aspects.J. Autom. Lang. Comb.211-2107-1232016Journal Articlesclosedjournals/jalc/Valencia-Cabrera1610.25596/JALC-2016-107https://doi.org/10.25596/jalc-2016-107https://dblp.org/rec/journals/jalc/Valencia-Cabrera16URL#3133374Sergiu Ivanov 0001Yurii RogozhinSergey VerlanSmall Universal Networks of Evolutionary Processors.J. Autom. Lang. Comb.191-4133-1442014Journal Articlesclosedjournals/jalc/0001RV1410.25596/JALC-2014-133https://doi.org/10.25596/jalc-2014-133https://dblp.org/rec/journals/jalc/0001RV14URL#3747321Artiom AlhazovGemma Bel EnguixYurii RogozhinSmallest Filters in Complete Obligatory Hybrid Networks of Evolutionary Processors.J. Autom. Lang. Comb.191-45-162014Journal Articlesclosedjournals/jalc/AlhazovER1410.25596/JALC-2014-005https://doi.org/10.25596/jalc-2014-005https://dblp.org/rec/journals/jalc/AlhazovER14URL#3747322Maurice H. ter BeekJetty KleijnOn Distributed Cooperation and Synchronised Collaboration.J. Autom. Lang. Comb.191-417-322014Journal Articlesclosedjournals/jalc/BeekK1410.25596/JALC-2014-017https://doi.org/10.25596/jalc-2014-017https://dblp.org/rec/journals/jalc/BeekK14URL#3747323Henning BordihnMartin KutribMatthias WendlandtNonterminal Controlled String Assembling Systems.J. Autom. Lang. Comb.191-433-442014Journal Articlesclosedjournals/jalc/BordihnKW1410.25596/JALC-2014-033https://doi.org/10.25596/jalc-2014-033https://dblp.org/rec/journals/jalc/BordihnKW14URL#3747324Sandra Gómez CanavalVictor MitranaSantiago Alonso VillaverdeTransducers Based on Networks of Evolutionary Processors.J. Autom. Lang. Comb.191-493-1052014Journal Articlesclosedjournals/jalc/CanavalMV1410.25596/JALC-2014-093https://doi.org/10.25596/jalc-2014-093https://dblp.org/rec/journals/jalc/CanavalMV14URL#3747325Gabriel CiobanuG. Michele PinnaDragos SburlanPower of Causal Dependencies in Rule-Based Systems.J. Autom. Lang. Comb.191-445-562014Journal Articlesclosedjournals/jalc/CiobanuPS1410.25596/JALC-2014-045https://doi.org/10.25596/jalc-2014-045https://dblp.org/rec/journals/jalc/CiobanuPS14URL#3747326Jürgen DassowJozef KelemenGheorghe PaunEditorial.J. Autom. Lang. Comb.191-43-42014Journal Articlesclosedjournals/jalc/DassowKP1410.25596/JALC-2014-003https://doi.org/10.25596/jalc-2014-003https://dblp.org/rec/journals/jalc/DassowKP14URL#3747327Zoltán ÉsikTamás HajgatóOn the Structure of Free Iteration Semirings.J. Autom. Lang. Comb.191-457-662014Journal Articlesclosedjournals/jalc/EsikH1410.25596/JALC-2014-057https://doi.org/10.25596/jalc-2014-057https://dblp.org/rec/journals/jalc/EsikH14URL#3747328Rudolf FreundMarion OswaldArray Grammars and Automata on Cayley Grids.J. Autom. Lang. Comb.191-467-802014Journal Articlesclosedjournals/jalc/FreundO1410.25596/JALC-2014-067https://doi.org/10.25596/jalc-2014-067https://dblp.org/rec/journals/jalc/FreundO14URL#3747329Zsolt GazdagRemarks on some Simple Variants of Random Context Grammars.J. Autom. Lang. Comb.191-481-922014Journal Articlesclosedjournals/jalc/Gazdag1410.25596/JALC-2014-081https://doi.org/10.25596/jalc-2014-081https://dblp.org/rec/journals/jalc/Gazdag14URL#3747330Markus Holzer 0001Martin KutribSelf-Assembling Pushdown Automata.J. Autom. Lang. Comb.191-4107-1182014Journal Articlesclosedjournals/jalc/HolzerK1410.25596/JALC-2014-107https://doi.org/10.25596/jalc-2014-107https://dblp.org/rec/journals/jalc/HolzerK14URL#3747331Oscar H. IbarraNicholas Q. TrânWeak Synchronization and Synchronizability of Multi-tape Pushdown Automata and Turing Machines.J. Autom. Lang. Comb.191-4119-1322014Journal Articlesclosedjournals/jalc/IbarraT1410.25596/JALC-2014-119https://doi.org/10.25596/jalc-2014-119https://dblp.org/rec/journals/jalc/IbarraT14URL#3747332Kristóf KántorGyörgy VaszilGeneralized P Colony Automata.J. Autom. Lang. Comb.191-4145-1562014Journal Articlesclosedjournals/jalc/KantorV1410.25596/JALC-2014-145https://doi.org/10.25596/jalc-2014-145https://dblp.org/rec/journals/jalc/KantorV14URL#3747333Lila KariManasi S. KulkarniGenerating the Pseudo-Powers of a Word.J. Autom. Lang. Comb.191-4157-1712014Journal Articlesclosedjournals/jalc/KariK1410.25596/JALC-2014-157https://doi.org/10.25596/jalc-2014-157https://dblp.org/rec/journals/jalc/KariK14URL#3747334Alberto LeporatiGiancarlo MauriAntonio E. PorrecaClaudio ZandronP Systems with Active Membranes Working in Logarithmic Space.J. Autom. Lang. Comb.191-4173-1842014Journal Articlesclosedjournals/jalc/LeporatiMPZ1410.25596/JALC-2014-173https://doi.org/10.25596/jalc-2014-173https://dblp.org/rec/journals/jalc/LeporatiMPZ14URL#3747335Luis F. Macías-RamosMiguel A. Martínez-del-AmorMario de J. Pérez-JiménezAgustin Riscos-NúñezLuis Valencia-CabreraThe Role of the Direction in Tissue P Systems with Cell Separation.J. Autom. Lang. Comb.191-4185-1992014Journal Articlesclosedjournals/jalc/Macias-RamosMPRV1410.25596/JALC-2014-185https://doi.org/10.25596/jalc-2014-185https://dblp.org/rec/journals/jalc/Macias-RamosMPRV14URL#3747336Maurice MargensternPentagrid and Heptagrid: the Fibonacci Technique and Group Theory.J. Autom. Lang. Comb.191-4201-2122014Journal Articlesclosedjournals/jalc/Margenstern1410.25596/JALC-2014-201https://doi.org/10.25596/jalc-2014-201https://dblp.org/rec/journals/jalc/Margenstern14URL#3747337Venkata Padmavati MettaAlica KelemenováSmaller Universal Spiking Neural P Systems with Anti-Spikes.J. Autom. Lang. Comb.191-4213-2262014Journal Articlesclosedjournals/jalc/MettaK1410.25596/JALC-2014-213https://doi.org/10.25596/jalc-2014-213https://dblp.org/rec/journals/jalc/MettaK14URL#3747338Tamás MihálydeákZoltán Erno CsajbókOn the Membrane Computations in the Presence of Membrane Boundaries.J. Autom. Lang. Comb.191-4227-2382014Journal Articlesclosedjournals/jalc/MihalydeakC1410.25596/JALC-2014-227https://doi.org/10.25596/jalc-2014-227https://dblp.org/rec/journals/jalc/MihalydeakC14URL#3747339Ionut-Mihai NiculescuMarian Gheorghe 0001Florentin IpateAlin StefanescuFrom Kernel P Systems to X-Machines and FLAME.J. Autom. Lang. Comb.191-4239-2502014Journal Articlesclosedjournals/jalc/NiculescuGIS1410.25596/JALC-2014-239https://doi.org/10.25596/jalc-2014-239https://dblp.org/rec/journals/jalc/NiculescuGIS14URL#3747340Alexandros PalioudakisKai SalomaaSelim G. AklLower Bound for Converting an NFA with Finite Nondeterminism into an MDFA.J. Autom. Lang. Comb.191-4251-2642014Journal Articlesclosedjournals/jalc/PalioudakisSA1410.25596/JALC-2014-251https://doi.org/10.25596/jalc-2014-251https://dblp.org/rec/journals/jalc/PalioudakisSA14URL#3747341I. PetraV. RogojinDependency Relations Between Elementary Intramolecular Operations in Gene Assembly in Ciliates.J. Autom. Lang. Comb.191-4265-2772014Journal Articlesclosedjournals/jalc/PetraR1410.25596/JALC-2014-265https://doi.org/10.25596/jalc-2014-265https://dblp.org/rec/journals/jalc/PetraR14URL#3747342Arto SalomaaCompositions of Reaction Systems.J. Autom. Lang. Comb.191-4279-2902014Journal Articlesclosedjournals/jalc/Salomaa1410.25596/JALC-2014-279https://doi.org/10.25596/jalc-2014-279https://dblp.org/rec/journals/jalc/Salomaa14URL#3747343Petr SosíkPSPACE Limits the Power of P Systems with Active Membranes.J. Autom. Lang. Comb.191-4291-3042014Journal Articlesclosedjournals/jalc/Sosik1410.25596/JALC-2014-291https://doi.org/10.25596/jalc-2014-291https://dblp.org/rec/journals/jalc/Sosik14URL#3747344Henk BarendregtVenanzio CaprettaDexter KozenReflection in the Chomsky Hierarchy.J. Autom. Lang. Comb.18153-602013Journal Articlesclosedjournals/jalc/BarendregtCK1310.25596/JALC-2013-053https://doi.org/10.25596/jalc-2013-053https://dblp.org/rec/journals/jalc/BarendregtCK13URL#4037610Charles Dominicδ-Neighborhood Chromatic Index of a Graph.J. Autom. Lang. Comb.18265-702013Journal Articlesclosedjournals/jalc/Dominic1310.25596/JALC-2013-065https://doi.org/10.25596/jalc-2013-065https://dblp.org/rec/journals/jalc/Dominic13URL#4037611S. HarbichOn the Descriptional Complexity of k-Uniformly-Limited Lindenmayer Systems.J. Autom. Lang. Comb.1813-252013Journal Articlesclosedjournals/jalc/Harbich1310.25596/JALC-2013-003https://doi.org/10.25596/jalc-2013-003https://dblp.org/rec/journals/jalc/Harbich13URL#4037612Peter M. HigginsSuhear AlwanLanguages that Require Full Scanning of Words to Determine Membership.J. Autom. Lang. Comb.18271-952013Journal Articlesclosedjournals/jalc/HigginsA1310.25596/JALC-2013-071https://doi.org/10.25596/jalc-2013-071https://dblp.org/rec/journals/jalc/HigginsA13URL#4037613Sergey KitaevOn Graphs with Representation Number 3.J. Autom. Lang. Comb.18297-1122013Journal Articlesclosedjournals/jalc/Kitaev1310.25596/JALC-2013-097https://doi.org/10.25596/jalc-2013-097https://dblp.org/rec/journals/jalc/Kitaev13URL#4037614Jean-Gabriel LuqueLudovic MignotFlorent NicartSome Combinatorial Operators in Language Theory.J. Autom. Lang. Comb.18127-522013Journal Articlesclosedjournals/jalc/LuqueMN1310.25596/JALC-2013-027https://doi.org/10.25596/jalc-2013-027https://dblp.org/rec/journals/jalc/LuqueMN13URL#4037615Sándor VágvölgyiRecognizing Relations by Tree Automata.J. Autom. Lang. Comb.182113-1252013Journal Articlesclosedjournals/jalc/Vagvolgyi1310.25596/JALC-2013-113https://doi.org/10.25596/jalc-2013-113https://dblp.org/rec/journals/jalc/Vagvolgyi13URL#4037616Maria Paola BianchiMarkus Holzer 0001Sebastian JakobiCarlo MereghettiBeatrice PalanoGiovanni PighizziniOn Inverse Operations and Their Descriptional Complexity.J. Autom. Lang. Comb.172-461-812012Journal Articlesclosedjournals/jalc/BianchiHJMPP1210.25596/JALC-2012-061https://doi.org/10.25596/jalc-2012-061https://dblp.org/rec/journals/jalc/BianchiHJMPP12URL#4316596Ulrike BrandtHermann K.-G. WalterOn Testing Output Faults in the McCluskey Fault Model.J. Autom. Lang. Comb.1713-162012Journal Articlesclosedjournals/jalc/BrandtW1210.25596/JALC-2012-003https://doi.org/10.25596/jalc-2012-003https://dblp.org/rec/journals/jalc/BrandtW12URL#4316597Janusz A. BrzozowskiBaiyu LiDavid Liu 0003Syntactic Complexities of Six Classes of Star-Free Languages.J. Autom. Lang. Comb.172-483-1052012Journal Articlesclosedjournals/jalc/BrzozowskiLL1210.25596/JALC-2012-083https://doi.org/10.25596/jalc-2012-083https://dblp.org/rec/journals/jalc/BrzozowskiLL12URL#4316598Cezar CâmpeanuRandomness in Blum Universal Static Complexity Spaces.J. Autom. Lang. Comb.172-4107-1222012Journal Articlesclosedjournals/jalc/Campeanu1210.25596/JALC-2012-107https://doi.org/10.25596/jalc-2012-107https://dblp.org/rec/journals/jalc/Campeanu12URL#4316599Jürgen DassowRonny HarbichDescriptional Complexity of Union and Star on Context-Free Languages.J. Autom. Lang. Comb.172-4123-1432012Journal Articlesclosedjournals/jalc/DassowH1210.25596/JALC-2012-123https://doi.org/10.25596/jalc-2012-123https://dblp.org/rec/journals/jalc/DassowH12URL#4316600Jürgen DassowMartin KutribNelma MoreiraRogério ReisEditorial.J. Autom. Lang. Comb.172-459-602012Journal Articlesclosedjournals/jalc/DassowKMR1210.25596/JALC-2012-059https://doi.org/10.25596/jalc-2012-059https://dblp.org/rec/journals/jalc/DassowKMR12URL#4316601Jürgen DassowFlorin ManeaBianca TrutheOn Subregular Selection Languages in Internal Contextual Grammars.J. Autom. Lang. Comb.172-4145-1642012Journal Articlesclosedjournals/jalc/DassowMT1210.25596/JALC-2012-145https://doi.org/10.25596/jalc-2012-145https://dblp.org/rec/journals/jalc/DassowMT12URL#4316602Ronny HarbichBianca TrutheA Comparison of the Descriptional Complexity of Classes of Limited Lindenmayer Systems.J. Autom. Lang. Comb.17117-562012Journal Articlesclosedjournals/jalc/HarbichT1210.25596/JALC-2012-017https://doi.org/10.25596/jalc-2012-017https://dblp.org/rec/journals/jalc/HarbichT12URL#4316603Markus Holzer 0001Sebastian JakobiDescriptional Complexity of Chop Operations on Unary and Finite Languages.J. Autom. Lang. Comb.172-4165-1832012Journal Articlesclosedjournals/jalc/HolzerJ1210.25596/JALC-2012-165https://doi.org/10.25596/jalc-2012-165https://dblp.org/rec/journals/jalc/HolzerJ12URL#4316604Jean-Baptiste JeanninDexter KozenComputing with Capsules.J. Autom. Lang. Comb.172-4185-2042012Journal Articlesclosedjournals/jalc/JeanninK1210.25596/JALC-2012-185https://doi.org/10.25596/jalc-2012-185https://dblp.org/rec/journals/jalc/JeanninK12URL#4316605Christos A. KapoutsisMinicomplexity.J. Autom. Lang. Comb.172-4205-2242012Journal Articlesclosedjournals/jalc/Kapoutsis1210.25596/JALC-2012-205https://doi.org/10.25596/jalc-2012-205https://dblp.org/rec/journals/jalc/Kapoutsis12URL#4316606Andreas MalcherKatja MeckelCarlo MereghettiBeatrice PalanoDescriptional Complexity of Pushdown Store Languages.J. Autom. Lang. Comb.172-4225-2442012Journal Articlesclosedjournals/jalc/MalcherMMP1210.25596/JALC-2012-225https://doi.org/10.25596/jalc-2012-225https://dblp.org/rec/journals/jalc/MalcherMMP12URL#4316607Alexandros PalioudakisKai SalomaaSelim G. AklState Complexity of Finite Tree Width NFAs.J. Autom. Lang. Comb.172-4245-2642012Journal Articlesclosedjournals/jalc/PalioudakisSA1210.25596/JALC-2012-245https://doi.org/10.25596/jalc-2012-245https://dblp.org/rec/journals/jalc/PalioudakisSA12URL#4316608André PlatzerLogical Analysis of Hybrid Systems: A Answer to a Complexity Challenge.J. Autom. Lang. Comb.172-4265-2752012Journal Articlesclosedjournals/jalc/Platzer1210.25596/JALC-2012-265https://doi.org/10.25596/jalc-2012-265https://dblp.org/rec/journals/jalc/Platzer12URL#4316609Pedro V. SilvaGroups and Automata: a Perfect Match.J. Autom. Lang. Comb.172-4277-2922012Journal Articlesclosedjournals/jalc/Silva1210.25596/JALC-2012-277https://doi.org/10.25596/jalc-2012-277https://dblp.org/rec/journals/jalc/Silva12URL#4316610Klaus SutnerKevin LewiIterating Inverse Binary Transducers.J. Autom. Lang. Comb.172-4293-3132012Journal Articlesclosedjournals/jalc/SutnerL1210.25596/JALC-2012-293https://doi.org/10.25596/jalc-2012-293https://dblp.org/rec/journals/jalc/SutnerL12URL#4316611Siva AnantharamanPaliath NarendranMichaël RusinowitchString Rewriting and Security Analysis: An Extension of a Result of Book and Otto.J. Autom. Lang. Comb.162-475-902011Journal Articlesclosedjournals/jalc/AnantharamanNR1110.25596/JALC-2011-075https://doi.org/10.25596/jalc-2011-075https://dblp.org/rec/journals/jalc/AnantharamanNR11URL#4578155Sergey V. AvgustinovichSergey KitaevArtem V. PyatkinAlexandr ValyuzhenichOn Square-Free Permutations.J. Autom. Lang. Comb.1613-102011Journal Articlesclosedjournals/jalc/AvgustinovichKPV1110.25596/JALC-2011-003https://doi.org/10.25596/jalc-2011-003https://dblp.org/rec/journals/jalc/AvgustinovichKPV11URL#4578156Henning BordihnJürgen DassowMartin KutribBianca TrutheSelected Papers Dedicated to Friedrich Otto on the Occasion of his 60th Birthday - Editorial.J. Autom. Lang. Comb.162-471-742011Journal Articlesclosedjournals/jalc/BordihnDKT1110.25596/JALC-2011-071https://doi.org/10.25596/jalc-2011-071https://dblp.org/rec/journals/jalc/BordihnDKT11URL#4578157Henning BordihnMarkus Holzer 0001Martin KutribHairpin Finite Automata.J. Autom. Lang. Comb.162-491-1072011Journal Articlesclosedjournals/jalc/BordihnHK1110.25596/JALC-2011-091https://doi.org/10.25596/jalc-2011-091https://dblp.org/rec/journals/jalc/BordihnHK11URL#4578158Pascal CaronJean-Marc ChamparnaudLudovic MignotMulti-Bar and Multi-Tilde Regular Operators.J. Autom. Lang. Comb.16111-362011Journal Articlesclosedjournals/jalc/CaronCM1110.25596/JALC-2011-011https://doi.org/10.25596/jalc-2011-011https://dblp.org/rec/journals/jalc/CaronCM11URL#4578159Serdar ErbaturAndrew M. MarshallDeepak KapurPaliath NarendranUnification over Distributive Exponentiation (Sub)Theories.J. Autom. Lang. Comb.162-4109-1402011Journal Articlesclosedjournals/jalc/ErbaturMKN1110.25596/JALC-2011-109https://doi.org/10.25596/jalc-2011-109https://dblp.org/rec/journals/jalc/ErbaturMKN11URL#4578160Artur JezTomasz JurdzinskiLength-reducing Automata (almost) without Auxiliary Symbols.J. Autom. Lang. Comb.162-4141-1642011Journal Articlesclosedjournals/jalc/JezJ1110.25596/JALC-2011-141https://doi.org/10.25596/jalc-2011-141https://dblp.org/rec/journals/jalc/JezJ11URL#4578161Hartmut MesserschmidtMartin StommelChurch-Rosser Picture Languages and Their Applications in Picture Recognition.J. Autom. Lang. Comb.162-4165-1942011Journal Articlesclosedjournals/jalc/MesserschmidtS1110.25596/JALC-2011-165https://doi.org/10.25596/jalc-2011-165https://dblp.org/rec/journals/jalc/MesserschmidtS11URL#4578162Benedek NagyOn CD-Systems of Stateless Deterministic R(2)-Automata.J. Autom. Lang. Comb.162-4195-2132011Journal Articlesclosedjournals/jalc/Nagy1110.25596/JALC-2011-195https://doi.org/10.25596/jalc-2011-195https://dblp.org/rec/journals/jalc/Nagy11URL#4578163Dana PardubskáFrantisek MrázMartin PlátekTranslations by Regulated Parallel Communicating Grammar Systems.J. Autom. Lang. Comb.162-4215-2512011Journal Articlesclosedjournals/jalc/PardubskaMP1110.25596/JALC-2011-215https://doi.org/10.25596/jalc-2011-215https://dblp.org/rec/journals/jalc/PardubskaMP11URL#4578164Michael SoltysFeasible Proofs of Szpilrajn's Theorem - A Proof-Complexity Framework for Concurrent Automata.J. Autom. Lang. Comb.16137-482011Journal Articlesclosedjournals/jalc/Soltys1110.25596/JALC-2011-037https://doi.org/10.25596/jalc-2011-037https://dblp.org/rec/journals/jalc/Soltys11URL#4578165Ariel StulmanGenerating Optimal Distinguishing Sequences for Testing Timed Protocols.J. Autom. Lang. Comb.16149-652011Journal Articlesclosedjournals/jalc/Stulman1110.25596/JALC-2011-049https://doi.org/10.25596/jalc-2011-049https://dblp.org/rec/journals/jalc/Stulman11URL#4578166Marco AlmeidaNelma MoreiraRogério ReisTesting the Equivalence of Regular Languages.J. Autom. Lang. Comb.151/27-252010Journal Articlesclosedjournals/jalc/AlmeidaMR1010.25596/JALC-2010-007https://doi.org/10.25596/jalc-2010-007https://dblp.org/rec/journals/jalc/AlmeidaMR10URL#4826466Pierre-Yves AngrandSylvain LombardyJacques SakarovitchOn the Number of Broken Derived Terms of a Rational Expression.J. Autom. Lang. Comb.151/227-512010Journal Articlesclosedjournals/jalc/AngrandLS1010.25596/JALC-2010-027https://doi.org/10.25596/jalc-2010-027https://dblp.org/rec/journals/jalc/AngrandLS10URL#4826467Franziska BieglerMark DaleyIan McQuillanOn the Shuffle Automaton Size for Words.J. Autom. Lang. Comb.151/253-702010Journal Articlesclosedjournals/jalc/BieglerDM1010.25596/JALC-2010-053https://doi.org/10.25596/jalc-2010-053https://dblp.org/rec/journals/jalc/BieglerDM10URL#4826468Francine Blanchet-SadriMihai CucuringuCounting Primitive Partial Words.J. Autom. Lang. Comb.153/4199-2272010Journal Articlesclosedjournals/jalc/Blanchet-SadriC1010.25596/JALC-2010-199https://doi.org/10.25596/jalc-2010-199https://dblp.org/rec/journals/jalc/Blanchet-SadriC10URL#4826469Janusz A. BrzozowskiQuotient Complexity of Regular Languages.J. Autom. Lang. Comb.151/271-892010Journal Articlesclosedjournals/jalc/Brzozowski1010.25596/JALC-2010-071https://doi.org/10.25596/jalc-2010-071https://dblp.org/rec/journals/jalc/Brzozowski10URL#4826470Matthias BüchseJonathan MayHeiko VoglerDeterminization of Weighted Tree Automata Using Factorizations.J. Autom. Lang. Comb.153/4229-2542010Journal Articlesclosedjournals/jalc/BuchseMV1010.25596/JALC-2010-229https://doi.org/10.25596/jalc-2010-229https://dblp.org/rec/journals/jalc/BuchseMV10URL#4826471Erzsébet Csuhaj-VarjúGyörgy VaszilOn the Descriptional Complexity of Context-Free Non-returning PC Grammar Systems.J. Autom. Lang. Comb.151/291-1052010Journal Articlesclosedjournals/jalc/Csuhaj-VarjuV1010.25596/JALC-2010-091https://doi.org/10.25596/jalc-2010-091https://dblp.org/rec/journals/jalc/Csuhaj-VarjuV10URL#4826472Jürgen DassowGiovanni PighizziniBianca TrutheEditorial.J. Autom. Lang. Comb.151/252010Journal Articlesclosedjournals/jalc/DassowPT1010.25596/JALC-2010-005https://doi.org/10.25596/jalc-2010-005https://dblp.org/rec/journals/jalc/DassowPT10URL#4826473Hermann GruberMarkus Holzer 0001Martin KutribOn Measuring Non-recursive Trade-Offs.J. Autom. Lang. Comb.151/2107-1202010Journal Articlesclosedjournals/jalc/GruberHK1010.25596/JALC-2010-107https://doi.org/10.25596/jalc-2010-107https://dblp.org/rec/journals/jalc/GruberHK10URL#4826474Juha HonkalaUltimately Periodic Languages.J. Autom. Lang. Comb.153/4255-2612010Journal Articlesclosedjournals/jalc/Honkala1010.25596/JALC-2010-255https://doi.org/10.25596/jalc-2010-255https://dblp.org/rec/journals/jalc/Honkala10URL#4826475Sándor HorváthManfred KudlekA Complete Density Range of Continuum-Many Non-Context-Free Languages Fulfilling Strong Iteration Properties.J. Autom. Lang. Comb.153/4263-2682010Journal Articlesclosedjournals/jalc/HorvathK1010.25596/JALC-2010-263https://doi.org/10.25596/jalc-2010-263https://dblp.org/rec/journals/jalc/HorvathK10URL#4826476Galina JiráskováAlexander OkhotinNondeterministic State Complexity of Positional Addition.J. Autom. Lang. Comb.151/2121-1332010Journal Articlesclosedjournals/jalc/JiraskovaO1010.25596/JALC-2010-121https://doi.org/10.25596/jalc-2010-121https://dblp.org/rec/journals/jalc/JiraskovaO10URL#4826477Stavros KonstantinidisJoshua Youngf-Words and Binary Solid Codes.J. Autom. Lang. Comb.153/4269-2832010Journal Articlesclosedjournals/jalc/KonstantinidisY1010.25596/JALC-2010-269https://doi.org/10.25596/jalc-2010-269https://dblp.org/rec/journals/jalc/KonstantinidisY10URL#4826478Martin KutribAndreas MalcherOne-Way Cellular Automata, Bounded Languages, and Minimal Communication.J. Autom. Lang. Comb.151/2135-1532010Journal Articlesclosedjournals/jalc/KutribM1010.25596/JALC-2010-135https://doi.org/10.25596/jalc-2010-135https://dblp.org/rec/journals/jalc/KutribM10URL#4826479Remco LoosFlorin ManeaVictor MitranaSmall Universal Accepting Networks of Evolutionary Processors with Filtered Connections.J. Autom. Lang. Comb.151/2155-1742010Journal Articlesclosedjournals/jalc/LoosMM1010.25596/JALC-2010-155https://doi.org/10.25596/jalc-2010-155https://dblp.org/rec/journals/jalc/LoosMM10URL#4826480Emil Daniel SchwabOn Fibonacci and Thue-Morse Words.J. Autom. Lang. Comb.153/4285-2952010Journal Articlesclosedjournals/jalc/Schwab1010.25596/JALC-2010-285https://doi.org/10.25596/jalc-2010-285https://dblp.org/rec/journals/jalc/Schwab10URL#4826481Ralf StiebeSherzod TuraevCapacity-Bounded Grammars.J. Autom. Lang. Comb.151/2175-1942010Journal Articlesclosedjournals/jalc/StiebeT1010.25596/JALC-2010-175https://doi.org/10.25596/jalc-2010-175https://dblp.org/rec/journals/jalc/StiebeT10URL#4826482Antonio BerniniLuca Ferrari 0001Renzo PinzaniEnumeration of Some Classes of Words Avoiding Two Generalized Patterns of Length Three.J. Autom. Lang. Comb.142129-1472009Journal Articlesclosedjournals/jalc/BerniniFP0910.25596/JALC-2009-129https://doi.org/10.25596/jalc-2009-129https://dblp.org/rec/journals/jalc/BerniniFP09URL#5054208Henning BordihnBettina SunckelDescriptional Complexity of Restricted CD Grammar Systems.J. Autom. Lang. Comb.1417-222009Journal Articlesclosedjournals/jalc/BordihnS0910.25596/JALC-2009-007https://doi.org/10.25596/jalc-2009-007https://dblp.org/rec/journals/jalc/BordihnS09URL#5054209Olivier CartonJean-Éric PinXaro Soler-EscrivàLanguages Recognized by Finite Supersoluble Groups.J. Autom. Lang. Comb.142149-1612009Journal Articlesclosedjournals/jalc/CartonPS0910.25596/JALC-2009-149https://doi.org/10.25596/jalc-2009-149https://dblp.org/rec/journals/jalc/CartonPS09URL#5054210Anton CernýOn Fair Words.J. Autom. Lang. Comb.142163-1742009Journal Articlesclosedjournals/jalc/Cerny0910.25596/JALC-2009-163https://doi.org/10.25596/jalc-2009-163https://dblp.org/rec/journals/jalc/Cerny09URL#5054211Jürgen DassowAndreas MalcherEditorial.J. Autom. Lang. Comb.1415-62009Journal Articlesclosedjournals/jalc/DassowM0910.25596/JALC-2009-005https://doi.org/10.25596/jalc-2009-005https://dblp.org/rec/journals/jalc/DassowM09URL#5054212Juraj HromkovicGeorg SchnitgerLower Bounds on the Size of Sweeping Automata.J. Autom. Lang. Comb.14123-312009Journal Articlesclosedjournals/jalc/HromkovicS0910.25596/JALC-2009-023https://doi.org/10.25596/jalc-2009-023https://dblp.org/rec/journals/jalc/HromkovicS09URL#5054213Mari HuovaA Note on Defect Theorems for 2-Dimensional Words and Trees.J. Autom. Lang. Comb.143/4203-2092009Journal Articlesclosedjournals/jalc/Huova0910.25596/JALC-2009-203https://doi.org/10.25596/jalc-2009-203https://dblp.org/rec/journals/jalc/Huova09URL#5054214Helmut JürgensenMarkers and Deterministic Acceptors for Non-Deterministic Languages.J. Autom. Lang. Comb.14133-622009Journal Articlesclosedjournals/jalc/Jurgensen0910.25596/JALC-2009-033https://doi.org/10.25596/jalc-2009-033https://dblp.org/rec/journals/jalc/Jurgensen09URL#5054215Chandra M. R. KintalaSoftware Rejuvenation in Embedded Systems.J. Autom. Lang. Comb.14163-732009Journal Articlesclosedjournals/jalc/Kintala0910.25596/JALC-2009-063https://doi.org/10.25596/jalc-2009-063https://dblp.org/rec/journals/jalc/Kintala09URL#5054216Andreas Klein 0001Martin KutribSelf-Assembling Finite Automata.J. Autom. Lang. Comb.14175-922009Journal Articlesclosedjournals/jalc/KleinK0910.25596/JALC-2009-075https://doi.org/10.25596/jalc-2009-075https://dblp.org/rec/journals/jalc/KleinK09URL#5054217Hing LeungA Technique for Proving Lower Bounds on the Size of Sweeping Automata.J. Autom. Lang. Comb.14193-1052009Journal Articlesclosedjournals/jalc/Leung0910.25596/JALC-2009-093https://doi.org/10.25596/jalc-2009-093https://dblp.org/rec/journals/jalc/Leung09URL#5054218Nutan LimayeMeena MahajanAntoine MeyerOn the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata.J. Autom. Lang. Comb.143/4211-2352009Journal Articlesclosedjournals/jalc/LimayeMM0910.25596/JALC-2009-211https://doi.org/10.25596/jalc-2009-211https://dblp.org/rec/journals/jalc/LimayeMM09URL#5054219Toufik MansourAugustine O. MunagiEnumeration of Gap-Bounded Set Partitions.J. Autom. Lang. Comb.143/4237-2452009Journal Articlesclosedjournals/jalc/MansourM0910.25596/JALC-2009-237https://doi.org/10.25596/jalc-2009-237https://dblp.org/rec/journals/jalc/MansourM09URL#5054220Benedek NagyLanguages Generated by Context-Free Grammars Extended by Type AB → BA Rules.J. Autom. Lang. Comb.142175-1862009Journal Articlesclosedjournals/jalc/Nagy0910.25596/JALC-2009-175https://doi.org/10.25596/jalc-2009-175https://dblp.org/rec/journals/jalc/Nagy09URL#5054221Taishin Y. NishidaAn Efficient Derivation Method for DT0L Systems and a Measure of Derivation Complexity.J. Autom. Lang. Comb.142187-1982009Journal Articlesclosedjournals/jalc/Nishida0910.25596/JALC-2009-187https://doi.org/10.25596/jalc-2009-187https://dblp.org/rec/journals/jalc/Nishida09URL#5054222Giovanni PighizziniNondeterministic One-Tape Off-Line Turing Machines and Their Time Complexity.J. Autom. Lang. Comb.141107-1242009Journal Articlesclosedjournals/jalc/Pighizzini0910.25596/JALC-2009-107https://doi.org/10.25596/jalc-2009-107https://dblp.org/rec/journals/jalc/Pighizzini09URL#5054223Keijo RuohonenEquivalence of Set- and Bag-Valued Orbits.J. Autom. Lang. Comb.143/4247-2532009Journal Articlesclosedjournals/jalc/Ruohonen0910.25596/JALC-2009-247https://doi.org/10.25596/jalc-2009-247https://dblp.org/rec/journals/jalc/Ruohonen09URL#5054224Aleksi SaarelaUltimately Constant Abelian Complexity of Infinite Words.J. Autom. Lang. Comb.143/4255-2582009Journal Articlesclosedjournals/jalc/Saarela0910.25596/JALC-2009-255https://doi.org/10.25596/jalc-2009-255https://dblp.org/rec/journals/jalc/Saarela09URL#5054225Zhixi WangFeixiang LiangYong HeDi YangSemiring Structures of some Classes of Hypercodes.J. Autom. Lang. Comb.143/4259-2722009Journal Articlesclosedjournals/jalc/WangLHY0910.25596/JALC-2009-259https://doi.org/10.25596/jalc-2009-259https://dblp.org/rec/journals/jalc/WangLHY09URL#5054226Dietmar WätjenMulti-limited Simple Eco-Grammar Systems with Prescribed Teams.J. Autom. Lang. Comb.143/4273-2962009Journal Articlesclosedjournals/jalc/Watjen0910.25596/JALC-2009-273https://doi.org/10.25596/jalc-2009-273https://dblp.org/rec/journals/jalc/Watjen09URL#5054227M. Sakthi BalanComplexity Measures for Binding-Blocking Automata.J. Autom. Lang. Comb.132105-1232008Journal Articlesclosedjournals/jalc/Balan0810.25596/JALC-2008-105https://doi.org/10.25596/jalc-2008-105https://dblp.org/rec/journals/jalc/Balan08URL#5273476Bernd BorchertFormal Language Characterizations of P, NP, and PSPACE.J. Autom. Lang. Comb.133/4161-1832008Journal Articlesclosedjournals/jalc/Borchert0810.25596/JALC-2008-161https://doi.org/10.25596/jalc-2008-161https://dblp.org/rec/journals/jalc/Borchert08URL#5273477Flavio D'AlessandroStefano VarricchioOn the Growth of Context-Free Languages.J. Autom. Lang. Comb.13295-1042008Journal Articlesclosedjournals/jalc/DAlessandroV0810.25596/JALC-2008-095https://doi.org/10.25596/jalc-2008-095https://dblp.org/rec/journals/jalc/DAlessandroV08URL#5273478Mark DaleyMark G. EramianIan McQuillanThe Bag Automaton: A Model of Nondeterministic Storage.J. Autom. Lang. Comb.133/4185-2062008Journal Articlesclosedjournals/jalc/DaleyEM0810.25596/JALC-2008-185https://doi.org/10.25596/jalc-2008-185https://dblp.org/rec/journals/jalc/DaleyEM08URL#5273479Szilárd Zsolt FazekasBenedek NagyScattered Subword Complexity of non-Primitive Words.J. Autom. Lang. Comb.133/4233-2472008Journal Articlesclosedjournals/jalc/FazekasN0810.25596/JALC-2008-233https://doi.org/10.25596/jalc-2008-233https://dblp.org/rec/journals/jalc/FazekasN08URL#5273480Zoltán Fülöp 0001Lorand MuzamelCircularity, Composition, and Decomposition Results for Pebble Macro Tree Transducers.J. Autom. Lang. Comb.1313-442008Journal Articlesclosedjournals/jalc/FulopM0810.25596/JALC-2008-003https://doi.org/10.25596/jalc-2008-003https://dblp.org/rec/journals/jalc/FulopM08URL#5273481Mark KambitesFriedrich OttoChurch-Rosser Groups and Growing Context-Sensitive Groups.J. Autom. Lang. Comb.133/4249-2672008Journal Articlesclosedjournals/jalc/KambitesO0810.25596/JALC-2008-249https://doi.org/10.25596/jalc-2008-249https://dblp.org/rec/journals/jalc/KambitesO08URL#5273482Sergey KitaevArtem V. PyatkinOn Representable Graphs.J. Autom. Lang. Comb.13145-542008Journal Articlesclosedjournals/jalc/KitaevP0810.25596/JALC-2008-045https://doi.org/10.25596/jalc-2008-045https://dblp.org/rec/journals/jalc/KitaevP08URL#5273483Stavros KonstantinidisPedro V. SilvaMaximal Error-Detecting Capabilities of Formal Languages.J. Autom. Lang. Comb.13155-712008Journal Articlesclosedjournals/jalc/KonstantinidisS0810.25596/JALC-2008-055https://doi.org/10.25596/jalc-2008-055https://dblp.org/rec/journals/jalc/KonstantinidisS08URL#5273484Zheng-Zhu LiHuei-Jan ShyrYen-Shung TsaiAutomata Accepting Bifix Codes.J. Autom. Lang. Comb.133/4269-2972008Journal Articlesclosedjournals/jalc/LiST0810.25596/JALC-2008-269https://doi.org/10.25596/jalc-2008-269https://dblp.org/rec/journals/jalc/LiST08URL#5273485Vadim V. LozinGraph Representation Functions Computable by Finite Automata.J. Autom. Lang. Comb.13173-902008Journal Articlesclosedjournals/jalc/Lozin0810.25596/JALC-2008-073https://doi.org/10.25596/jalc-2008-073https://dblp.org/rec/journals/jalc/Lozin08URL#5273486Alexander OkhotinHomomorphisms Preserving Linear Conjunctive Languages.J. Autom. Lang. Comb.133/4299-3052008Journal Articlesclosedjournals/jalc/Okhotin0810.25596/JALC-2008-299https://doi.org/10.25596/jalc-2008-299https://dblp.org/rec/journals/jalc/Okhotin08URL#5273487M. V. Panduranga RaoV. VinayQuantum Finite Automata and Weighted Automata.J. Autom. Lang. Comb.132125-1392008Journal Articlesclosedjournals/jalc/RaoV0810.25596/JALC-2008-125https://doi.org/10.25596/jalc-2008-125https://dblp.org/rec/journals/jalc/RaoV08URL#5273488Adam RomanA Note on Černý Conjecture for Automata over 3-Letter Alphabet.J. Autom. Lang. Comb.132141-1432008Journal Articlesclosedjournals/jalc/Roman0810.25596/JALC-2008-141https://doi.org/10.25596/jalc-2008-141https://dblp.org/rec/journals/jalc/Roman08URL#5273489Rodrigo de SouzaNami KobayashiA Combinatorial Study of k-Valued Rational Relations.J. Autom. Lang. Comb.133/4207-2312008Journal Articlesclosedjournals/jalc/SouzaK0810.25596/JALC-2008-207https://doi.org/10.25596/jalc-2008-207https://dblp.org/rec/journals/jalc/SouzaK08URL#5273490Ioan TomescuThreshold Properties of Some Periodic Factors of Words over a Finite Alphabet.J. Autom. Lang. Comb.132145-1562008Journal Articlesclosedjournals/jalc/Tomescu0810.25596/JALC-2008-145https://doi.org/10.25596/jalc-2008-145https://dblp.org/rec/journals/jalc/Tomescu08URL#5273491Franziska BieglerSynchronization Functions of Synchronized Context-Free Grammars and Languages.J. Autom. Lang. Comb.121-27-242007Journal Articlesclosedjournals/jalc/Biegler0710.25596/JALC-2007-007https://doi.org/10.25596/jalc-2007-007https://dblp.org/rec/journals/jalc/Biegler07URL#5474869Henning BordihnHenning FernauThe Degree of Parallelism.J. Autom. Lang. Comb.121-225-472007Journal Articlesclosedjournals/jalc/BordihnF0710.25596/JALC-2007-025https://doi.org/10.25596/jalc-2007-025https://dblp.org/rec/journals/jalc/BordihnF07URL#5474870Henning BordihnBettina SunckelOn Active Symbols in CD Grammar Systems.J. Autom. Lang. Comb.121-249-672007Journal Articlesclosedjournals/jalc/BordihnS0710.25596/JALC-2007-049https://doi.org/10.25596/jalc-2007-049https://dblp.org/rec/journals/jalc/BordihnS07URL#5474871Cezar CâmpeanuNicolae SanteanSheng Yu 0001A Family of NFAs Free of State Reductions.J. Autom. Lang. Comb.121-269-782007Journal Articlesclosedjournals/jalc/CampeanuSY0710.25596/JALC-2007-069https://doi.org/10.25596/jalc-2007-069https://dblp.org/rec/journals/jalc/CampeanuSY07URL#5474872Michael DomaratzkiAlexander OkhotinJeffrey O. ShallitEnumeration of Context-Free Languages and Related Structures.J. Autom. Lang. Comb.121-279-952007Journal Articlesclosedjournals/jalc/DomaratzkiOS0710.25596/JALC-2007-079https://doi.org/10.25596/jalc-2007-079https://dblp.org/rec/journals/jalc/DomaratzkiOS07URL#5474873Frank DrewesHeiko VoglerLearning Deterministically Recognizable Tree Series.J. Autom. Lang. Comb.123332-3542007Journal Articlesclosedjournals/jalc/DrewesV0710.25596/JALC-2007-333https://doi.org/10.25596/jalc-2007-333https://dblp.org/rec/journals/jalc/DrewesV07URL#5474874Manfred DrosteHeiko VoglerEditorial.J. Autom. Lang. Comb.1244332007Journal Articlesclosedjournals/jalc/DrosteV0710.25596/JALC-2007-433https://doi.org/10.25596/jalc-2007-433https://dblp.org/rec/journals/jalc/DrosteV07URL#5474875Berke DurakTwo-Way Finite Automata with a Write-Once Track.J. Autom. Lang. Comb.121-297-1152007Journal Articlesclosedjournals/jalc/Durak0710.25596/JALC-2007-097https://doi.org/10.25596/jalc-2007-097https://dblp.org/rec/journals/jalc/Durak07URL#5474876Zoltán ÉsikWerner KuichA Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series.J. Autom. Lang. Comb.124435-4542007Journal Articlesclosedjournals/jalc/EsikK0710.25596/JALC-2007-435https://doi.org/10.25596/jalc-2007-435https://dblp.org/rec/journals/jalc/EsikK07URL#5474877Henning FernauRudolf FreundMarion OswaldKlaus ReinhardtRefining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars.J. Autom. Lang. Comb.121-2117-1382007Journal Articlesclosedjournals/jalc/FernauFOR0710.25596/JALC-2007-117https://doi.org/10.25596/jalc-2007-117https://dblp.org/rec/journals/jalc/FernauFOR07URL#5474878Viliam GeffertState Hierarchy for One-Way Finite Automata.J. Autom. Lang. Comb.121-2139-1452007Journal Articlesclosedjournals/jalc/Geffert0710.25596/JALC-2007-139https://doi.org/10.25596/jalc-2007-139https://dblp.org/rec/journals/jalc/Geffert07URL#5474879Gregor GramlichRalf HerrmannLearning Unary Automata.J. Autom. Lang. Comb.121-2147-1652007Journal Articlesclosedjournals/jalc/GramlichH0710.25596/JALC-2007-147https://doi.org/10.25596/jalc-2007-147https://dblp.org/rec/journals/jalc/GramlichH07URL#5474880Miguel A. Gutiérrez-NaranjoMario J. Pérez-JiménezAgustin Riscos-NúñezMulti-dimensional Descriptional Complexity of P Systems.J. Autom. Lang. Comb.121-2167-1792007Journal Articlesclosedjournals/jalc/Gutierrez-NaranjoPR0710.25596/JALC-2007-167https://doi.org/10.25596/jalc-2007-167https://dblp.org/rec/journals/jalc/Gutierrez-NaranjoPR07URL#5474881Yo-Sub HanGerhard TrippenDerick WoodSimple-Regular Expressions and Languages.J. Autom. Lang. Comb.121-2181-1942007Journal Articlesclosedjournals/jalc/HanTW0710.25596/JALC-2007-181https://doi.org/10.25596/jalc-2007-181https://dblp.org/rec/journals/jalc/HanTW07URL#5474882Markus Holzer 0001Martin KutribJens ReimannNon-Recursive Trade-Offs for Deterministic Restarting Automata.J. Autom. Lang. Comb.121-2195-2132007Journal Articlesclosedjournals/jalc/HolzerKR0710.25596/JALC-2007-195https://doi.org/10.25596/jalc-2007-195https://dblp.org/rec/journals/jalc/HolzerKR07URL#5474883Petr JancarFrantisek MrázMartin PlátekJörg Vogel 0001Monotonicity of Restarting Automata.J. Autom. Lang. Comb.123355-3712007Journal Articlesclosedjournals/jalc/JancarMPV0710.25596/JALC-2007-355https://doi.org/10.25596/jalc-2007-355https://dblp.org/rec/journals/jalc/JancarMPV07URL#5474884Christos A. KapoutsisDeterministic Moles Cannot Solve Liveness.J. Autom. Lang. Comb.121-2215-2352007Journal Articlesclosedjournals/jalc/Kapoutsis0710.25596/JALC-2007-215https://doi.org/10.25596/jalc-2007-215https://dblp.org/rec/journals/jalc/Kapoutsis07URL#5474885Miklós KrészGraph Decomposition and Descriptional Complexity of Soliton Automata.J. Autom. Lang. Comb.121-2237-2632007Journal Articlesclosedjournals/jalc/Kresz0710.25596/JALC-2007-237https://doi.org/10.25596/jalc-2007-237https://dblp.org/rec/journals/jalc/Kresz07URL#5474886Ruggero LanotteExpressive Power of Hybrid Systems with Real Variables, Integer Variables and Arrays.J. Autom. Lang. Comb.123373-4052007Journal Articlesclosedjournals/jalc/Lanotte0710.25596/JALC-2007-373https://doi.org/10.25596/jalc-2007-373https://dblp.org/rec/journals/jalc/Lanotte07URL#5474887Andreas MalcherOn Recursive and Non-recursive Trade-Offs between Finite-Turn Pushdown Automata.J. Autom. Lang. Comb.121-2265-2772007Journal Articlesclosedjournals/jalc/Malcher0710.25596/JALC-2007-265https://doi.org/10.25596/jalc-2007-265https://dblp.org/rec/journals/jalc/Malcher07URL#5474888Giovanni PighizziniDetlef WotschkeEditorial.J. Autom. Lang. Comb.121-252007Journal Articlesclosedjournals/jalc/PighizziniW0710.25596/JALC-2007-005https://doi.org/10.25596/jalc-2007-005https://dblp.org/rec/journals/jalc/PighizziniW07URL#5474889Libor PolákRemarks on Multiple Entry Deterministic Finite Automata.J. Autom. Lang. Comb.121-2279-2882007Journal Articlesclosedjournals/jalc/Polak0710.25596/JALC-2007-279https://doi.org/10.25596/jalc-2007-279https://dblp.org/rec/journals/jalc/Polak07URL#5474890George RahonisWeighted Muller Tree Automata and Weighted Logics.J. Autom. Lang. Comb.124455-4832007Journal Articlesclosedjournals/jalc/Rahonis0710.25596/JALC-2007-455https://doi.org/10.25596/jalc-2007-455https://dblp.org/rec/journals/jalc/Rahonis07URL#5474891Daniel ReidenbachAn Examination of Ohlebusch and Ukkonen's Conjecture on the Equivalence Problem for E-Pattern Languages.J. Autom. Lang. Comb.123407-4262007Journal Articlesclosedjournals/jalc/Reidenbach0710.25596/JALC-2007-407https://doi.org/10.25596/jalc-2007-407https://dblp.org/rec/journals/jalc/Reidenbach07URL#5474892Sibylle SchwarzLukasiewicz Logic and Weighted Logics over MV-Semirings.J. Autom. Lang. Comb.124485-4992007Journal Articlesclosedjournals/jalc/Schwarz0710.25596/JALC-2007-485https://doi.org/10.25596/jalc-2007-485https://dblp.org/rec/journals/jalc/Schwarz07URL#5474893Bettina SunckelOn the Descriptional Complexity of CD Grammar Systems of Finite Index.J. Autom. Lang. Comb.121-2289-3062007Journal Articlesclosedjournals/jalc/Sunckel0710.25596/JALC-2007-289https://doi.org/10.25596/jalc-2007-289https://dblp.org/rec/journals/jalc/Sunckel07URL#5474894Catalin Ionut TîrnaucaCristina TîrnaucaLearning Regular Tree Languages from Correction and Equivalence Queries.J. Autom. Lang. Comb.124501-5242007Journal Articlesclosedjournals/jalc/TirnaucaT0710.25596/JALC-2007-501https://doi.org/10.25596/jalc-2007-501https://dblp.org/rec/journals/jalc/TirnaucaT07URL#5474895German TischlerOn Computability and some Decision Problems of Parametric Weighted Finite Automata.J. Autom. Lang. Comb.124525-5442007Journal Articlesclosedjournals/jalc/Tischler0710.25596/JALC-2007-525https://doi.org/10.25596/jalc-2007-525https://dblp.org/rec/journals/jalc/Tischler07URL#5474896György VaszilNon-returning PC Grammar Systems Generate any Recursively Enumerable Language with Eight Context-Free Components.J. Autom. Lang. Comb.121-2307-3152007Journal Articlesclosedjournals/jalc/Vaszil0710.25596/JALC-2007-307https://doi.org/10.25596/jalc-2007-307https://dblp.org/rec/journals/jalc/Vaszil07URL#5474897Sergey VerlanOn Minimal Context-Free Insertion-Deletion Systems.J. Autom. Lang. Comb.121-2317-3282007Journal Articlesclosedjournals/jalc/Verlan0710.25596/JALC-2007-317https://doi.org/10.25596/jalc-2007-317https://dblp.org/rec/journals/jalc/Verlan07URL#5474898Johannes WaldmannWeighted Automata for Proving Termination of String Rewriting.J. Autom. Lang. Comb.124545-5702007Journal Articlesclosedjournals/jalc/Waldmann0710.25596/JALC-2007-545https://doi.org/10.25596/jalc-2007-545https://dblp.org/rec/journals/jalc/Waldmann07URL#5474899Siva AnantharamanPaul GastinGaétan HainsJohn MullinsMichaël RusinowitchEditorial.J. Autom. Lang. Comb.1115-62006Journal Articlesclosedjournals/jalc/AnantharamanGHM0610.25596/JALC-2006-005https://doi.org/10.25596/jalc-2006-005https://dblp.org/rec/journals/jalc/AnantharamanGHM06URL#5660738Peter R. J. AsveldGenerating all Circular Shifts by Context-Free Grammars in Chomsky Normal Form.J. Autom. Lang. Comb.112147-1592006Journal Articlesclosedjournals/jalc/Asveld0610.25596/JALC-2006-147https://doi.org/10.25596/jalc-2006-147https://dblp.org/rec/journals/jalc/Asveld06URL#5660739Mathieu BaudetRandom Polynomial-Time Attacks and Dolev-Yao Models.J. Autom. Lang. Comb.1117-212006Journal Articlesclosedjournals/jalc/Baudet0610.25596/JALC-2006-007https://doi.org/10.25596/jalc-2006-007https://dblp.org/rec/journals/jalc/Baudet06URL#5660740Maurice H. ter BeekGabriele LenziniMarinella PetrocchiA Team Automaton Scenario for the Analysis of Security Properties of Communication Protocols.J. Autom. Lang. Comb.114345-3742006Journal Articlesclosedjournals/jalc/BeekLP0610.25596/JALC-2006-345https://doi.org/10.25596/jalc-2006-345https://dblp.org/rec/journals/jalc/BeekLP06URL#5660741Robert BrijderMatteo CavaliereAgustin Riscos-NúñezGrzegorz RozenbergDragos SburlanCommunication Membrane Systems with Active Symports.J. Autom. Lang. Comb.113241-2612006Journal Articlesclosedjournals/jalc/BrijderCRRS0610.25596/JALC-2006-241https://doi.org/10.25596/jalc-2006-241https://dblp.org/rec/journals/jalc/BrijderCRRS06URL#5660742Matteo CavaliereRudolf FreundAlexander LeitschGheorghe PaunEvent-Related Outputs of Computations in P Systems.J. Autom. Lang. Comb.113263-2782006Journal Articlesclosedjournals/jalc/CavaliereFLP0610.25596/JALC-2006-263https://doi.org/10.25596/jalc-2006-263https://dblp.org/rec/journals/jalc/CavaliereFLP06URL#5660743Jing ChenTimed Extensions of π Calculus.J. Autom. Lang. Comb.11123-582006Journal Articlesclosedjournals/jalc/Chen0610.25596/JALC-2006-023https://doi.org/10.25596/jalc-2006-023https://dblp.org/rec/journals/jalc/Chen06URL#5660744Zhe DangOscar H. IbarraCheng LiGaoyan XieOn the Decidability of Model-Checking for P Systems.J. Autom. Lang. Comb.113279-2982006Journal Articlesclosedjournals/jalc/DangILX0610.25596/JALC-2006-279https://doi.org/10.25596/jalc-2006-279https://dblp.org/rec/journals/jalc/DangILX06URL#5660745Ferenc GécsegBalázs ImrehOn Asynchronous Tree Automata.J. Autom. Lang. Comb.112161-1682006Journal Articlesclosedjournals/jalc/GecsegI0610.25596/JALC-2006-161https://doi.org/10.25596/jalc-2006-161https://dblp.org/rec/journals/jalc/GecsegI06URL#5660746Daniela GenovaNatasa JonoskaTopological Properties of Forbidding-Enforcing Systems.J. Autom. Lang. Comb.114375-3972006Journal Articlesclosedjournals/jalc/GenovaJ0610.25596/JALC-2006-375https://doi.org/10.25596/jalc-2006-375https://dblp.org/rec/journals/jalc/GenovaJ06URL#5660747Hervé GrallA Confinement Criterion for Securely Executing Mobile Code.J. Autom. Lang. Comb.11159-1062006Journal Articlesclosedjournals/jalc/Grall0610.25596/JALC-2006-059https://doi.org/10.25596/jalc-2006-059https://dblp.org/rec/journals/jalc/Grall06URL#5660748Lucien HaddadDietlinde LauIvo G. RosenbergIntervals of Partial Clones Containing Maximal Clones.J. Autom. Lang. Comb.114399-4212006Journal Articlesclosedjournals/jalc/HaddadLR0610.25596/JALC-2006-399https://doi.org/10.25596/jalc-2006-399https://dblp.org/rec/journals/jalc/HaddadLR06URL#5660749Oscar H. IbarraBala RavikumarCagdas Evren GeredeQuality-Aware Service Delegation in Automated Web Service Composition: An Automata-Theoretic Approach.J. Autom. Lang. Comb.112169-1882006Journal Articlesclosedjournals/jalc/IbarraRG0610.25596/JALC-2006-169https://doi.org/10.25596/jalc-2006-169https://dblp.org/rec/journals/jalc/IbarraRG06URL#5660750Tseren-Onolt IshdorjPower and Efficiency of Minimal Parallelism in Polarizationless P Systems.J. Autom. Lang. Comb.113299-3202006Journal Articlesclosedjournals/jalc/Ishdorj0610.25596/JALC-2006-299https://doi.org/10.25596/jalc-2006-299https://dblp.org/rec/journals/jalc/Ishdorj06URL#5660751Jetty KleijnMaciej KoutnyGrzegorz RozenbergProcess Semantics for Membrane Systems.J. Autom. Lang. Comb.113321-3402006Journal Articlesclosedjournals/jalc/KleijnKR0610.25596/JALC-2006-321https://doi.org/10.25596/jalc-2006-321https://dblp.org/rec/journals/jalc/KleijnKR06URL#5660752Andrei A. KrokhinIvo G. RosenbergA Monoidal Interval of Clones of Selfdual Functions.J. Autom. Lang. Comb.112189-2082006Journal Articlesclosedjournals/jalc/KrokhinR0610.25596/JALC-2006-189https://doi.org/10.25596/jalc-2006-189https://dblp.org/rec/journals/jalc/KrokhinR06URL#5660753Sébastien LimetGernot SalzerBasic Rewriting via Logic Programming, with an Application to the Reachability Problem.J. Autom. Lang. Comb.111107-1422006Journal Articlesclosedjournals/jalc/LimetS0610.25596/JALC-2006-107https://doi.org/10.25596/jalc-2006-107https://dblp.org/rec/journals/jalc/LimetS06URL#5660754Gheorghe PaunMario J. Pérez-JiménezEditorial.J. Autom. Lang. Comb.1132392006Journal Articlesclosedjournals/jalc/PaunP0610.25596/JALC-2006-239https://doi.org/10.25596/jalc-2006-239https://dblp.org/rec/journals/jalc/PaunP06URL#5660755Mario J. Pérez-JiménezÁlvaro Romero JiménezFernando Sancho-CaparriniA Polynomial Complexity Class in P Systems Using Membrane Division.J. Autom. Lang. Comb.114423-4342006Journal Articlesclosedjournals/jalc/Perez-JimenezJS0610.25596/JALC-2006-423https://doi.org/10.25596/jalc-2006-423https://dblp.org/rec/journals/jalc/Perez-JimenezJS06URL#5660756Bettina SunckelOn the Descriptional Complexity of External Hybrid Cooperating Distributed Grammar Systems.J. Autom. Lang. Comb.114435-4472006Journal Articlesclosedjournals/jalc/Sunckel0610.25596/JALC-2006-435https://doi.org/10.25596/jalc-2006-435https://dblp.org/rec/journals/jalc/Sunckel06URL#5660757Dietmar WätjenLimited Simple Eco-Grammar Systems with Prescribed Teams.J. Autom. Lang. Comb.112209-2312006Journal Articlesclosedjournals/jalc/Watjen0610.25596/JALC-2006-209https://doi.org/10.25596/jalc-2006-209https://dblp.org/rec/journals/jalc/Watjen06URL#5660758Marcella AnselmoMaria MadoniaA Language-Theoretic Approach to Covering Problems.J. Autom. Lang. Comb.1013-242005Journal Articlesclosedjournals/jalc/AnselmoM0510.25596/JALC-2005-003https://doi.org/10.25596/jalc-2005-003https://dblp.org/rec/journals/jalc/AnselmoM05URL#5833522Magdi H. ArmaniousCubic and Semi-Cubic SQS-Skeins.J. Autom. Lang. Comb.10125-352005Journal Articlesclosedjournals/jalc/Armanious0510.25596/JALC-2005-025https://doi.org/10.25596/jalc-2005-025https://dblp.org/rec/journals/jalc/Armanious05URL#5833523Behshad BehzadiJean-Marc SteyaertThe Transformation Distance Problem Revisited.J. Autom. Lang. Comb.105/6577-5872005Journal Articlesclosedjournals/jalc/BehzadiS0510.25596/JALC-2005-577https://doi.org/10.25596/jalc-2005-577https://dblp.org/rec/journals/jalc/BehzadiS05URL#5833524Björn BorchardtZoltán Fülöp 0001Zsolt GazdagAndreas MalettiBounds for Tree Automata with Polynomial Costs.J. Autom. Lang. Comb.102/3107-1572005Journal Articlesclosedjournals/jalc/BorchardtFGM0510.25596/JALC-2005-107https://doi.org/10.25596/jalc-2005-107https://dblp.org/rec/journals/jalc/BorchardtFGM05URL#5833525Patricia BouyerFabrice ChevalierOn Conciseness of Extensions of Timed Automata.J. Autom. Lang. Comb.104393-4052005Journal Articlesclosedjournals/jalc/BouyerC0510.25596/JALC-2005-393https://doi.org/10.25596/jalc-2005-393https://dblp.org/rec/journals/jalc/BouyerC05URL#5833526Symeon BozapalidisOn the Closure of Recognizable Tree Series Under Tree Homomorphisms.J. Autom. Lang. Comb.102/3185-2022005Journal Articlesclosedjournals/jalc/Bozapalidis0510.25596/JALC-2005-185https://doi.org/10.25596/jalc-2005-185https://dblp.org/rec/journals/jalc/Bozapalidis05URL#5833527Symeon BozapalidisArchontia GrammatikopoulouRecognizable Picture Series.J. Autom. Lang. Comb.102/3159-1832005Journal Articlesclosedjournals/jalc/BozapalidisG0510.25596/JALC-2005-159https://doi.org/10.25596/jalc-2005-159https://dblp.org/rec/journals/jalc/BozapalidisG05URL#5833528Domenico CantoneSimone FaroFast-Search Algorithms: New Efficient Variants of the Boyer-Moore Pattern-Matching Algorithm.J. Autom. Lang. Comb.105/6589-6082005Journal Articlesclosedjournals/jalc/CantoneF0510.25596/JALC-2005-589https://doi.org/10.25596/jalc-2005-589https://dblp.org/rec/journals/jalc/CantoneF05URL#5833529Manolis ChristodoulakisCostas S. IliopoulosKunsoo ParkJeong Seop SimApproximate Seeds of Strings.J. Autom. Lang. Comb.105/6609-6262005Journal Articlesclosedjournals/jalc/ChristodoulakisIPS0510.25596/JALC-2005-609https://doi.org/10.25596/jalc-2005-609https://dblp.org/rec/journals/jalc/ChristodoulakisIPS05URL#5833530Loek G. CleophasGerard ZwaanBruce W. WatsonConstructing Factor Oracles.J. Autom. Lang. Comb.105/6627-6402005Journal Articlesclosedjournals/jalc/CleophasZW0510.25596/JALC-2005-627https://doi.org/10.25596/jalc-2005-627https://dblp.org/rec/journals/jalc/CleophasZW05URL#5833531Richard Cole 0001Costas S. IliopoulosManal Mohamed 0001William F. SmythLu YangThe Complexity of the Minimum k-Cover Problem.J. Autom. Lang. Comb.105/6641-6532005Journal Articlesclosedjournals/jalc/ColeIMSY0510.25596/JALC-2005-641https://doi.org/10.25596/jalc-2005-641https://dblp.org/rec/journals/jalc/ColeIMSY05URL#5833532Jurek CzyzowiczWojciech FraczakAndrzej PelcTransducers with Set Output.J. Autom. Lang. Comb.10137-492005Journal Articlesclosedjournals/jalc/CzyzowiczFP0510.25596/JALC-2005-037https://doi.org/10.25596/jalc-2005-037https://dblp.org/rec/journals/jalc/CzyzowiczFP05URL#5833533Manfred DrosteHeiko VoglerEditorial.J. Autom. Lang. Comb.102/31052005Journal Articlesclosedjournals/jalc/DrosteV0510.25596/JALC-2005-105https://doi.org/10.25596/jalc-2005-105https://dblp.org/rec/journals/jalc/DrosteV05URL#5833534Jean-Pierre DuvalThierry LecroqArnaud LefebvreBorder Array on Bounded Alphabet.J. Autom. Lang. Comb.10151-602005Journal Articlesclosedjournals/jalc/DuvalLL0510.25596/JALC-2005-051https://doi.org/10.25596/jalc-2005-051https://dblp.org/rec/journals/jalc/DuvalLL05URL#5833535Keith EllulBryan KrawetzJeffrey O. ShallitMing-wei WangRegular Expressions: New Results and Open Problems.J. Autom. Lang. Comb.104407-4372005Journal Articlesclosedjournals/jalc/EllulKSW0510.25596/JALC-2005-407https://doi.org/10.25596/jalc-2005-407https://dblp.org/rec/journals/jalc/EllulKSW05URL#5833536Zoltán ÉsikWerner KuichA Semiring-Semimodule Generalization of ω-Regular Languages I.J. Autom. Lang. Comb.102/3203-2422005Journal Articlesclosedjournals/jalc/EsikK0510.25596/JALC-2005-203https://doi.org/10.25596/jalc-2005-203https://dblp.org/rec/journals/jalc/EsikK05URL#5833537Zoltán ÉsikWerner KuichA Semiring-Semimodule Generalization of ω-Regular Languages II.J. Autom. Lang. Comb.102/3243-2642005Journal Articlesclosedjournals/jalc/EsikK05a10.25596/JALC-2005-243https://doi.org/10.25596/jalc-2005-243https://dblp.org/rec/journals/jalc/EsikK05aURL#5833538Abolfazl FatholahzadehLearning the Morphological Features of a Large Set of Words.J. Autom. Lang. Comb.105/6655-6692005Journal Articlesclosedjournals/jalc/Fatholahzadeh0510.25596/JALC-2005-655https://doi.org/10.25596/jalc-2005-655https://dblp.org/rec/journals/jalc/Fatholahzadeh05URL#5833539Olivier FinkelOn the Length of the Wadge Hierarchy of ω-Context Free Languages.J. Autom. Lang. Comb.104439-4642005Journal Articlesclosedjournals/jalc/Finkel0510.25596/JALC-2005-439https://doi.org/10.25596/jalc-2005-439https://dblp.org/rec/journals/jalc/Finkel05URL#5833540Christiane FrougnyLaurent VuillonCoding of Two-Dimensional Constraints of Finite Type by Substitutions.J. Autom. Lang. Comb.104465-4822005Journal Articlesclosedjournals/jalc/FrougnyV0510.25596/JALC-2005-465https://doi.org/10.25596/jalc-2005-465https://dblp.org/rec/journals/jalc/FrougnyV05URL#5833541Zsolt GazdagShape Preserving Bottom-Up Tree Transducers.J. Autom. Lang. Comb.104483-5342005Journal Articlesclosedjournals/jalc/Gazdag0510.25596/JALC-2005-483https://doi.org/10.25596/jalc-2005-483https://dblp.org/rec/journals/jalc/Gazdag05URL#5833542Mathieu GiraudDominique LavenierDealing with Hardware Space Limits when Removing Epsilon-Transitions in a Genomic Weighted Finite Automaton.J. Autom. Lang. Comb.102/3265-2852005Journal Articlesclosedjournals/jalc/GiraudL0510.25596/JALC-2005-265https://doi.org/10.25596/jalc-2005-265https://dblp.org/rec/journals/jalc/GiraudL05URL#5833543Richard GroultMartine LéonardLaurent MouchardA Linear Algorithm for the Detection of Evolutive Tandem Repeats.J. Autom. Lang. Comb.105/6671-6852005Journal Articlesclosedjournals/jalc/GroultLM0510.25596/JALC-2005-671https://doi.org/10.25596/jalc-2005-671https://dblp.org/rec/journals/jalc/GroultLM05URL#5833544Jan Holub 0001Editorial.J. Autom. Lang. Comb.105/65752005Journal Articlesclosedjournals/jalc/Holub0510.25596/JALC-2005-575https://doi.org/10.25596/jalc-2005-575https://dblp.org/rec/journals/jalc/Holub05URL#5833545Costas S. IliopoulosLaurent MouchardKaterina PerdikuriAthanasios K. TsakalidisComputing the Repetitions in a Biological Weighted Sequence.J. Autom. Lang. Comb.105/6687-6962005Journal Articlesclosedjournals/jalc/IliopoulosMPT0510.25596/JALC-2005-687https://doi.org/10.25596/jalc-2005-687https://dblp.org/rec/journals/jalc/IliopoulosMPT05URL#5833546Daniel KirstenIna MäurerOn the Determinization of Weighted Automata.J. Autom. Lang. Comb.102/3287-3122005Journal Articlesclosedjournals/jalc/KirstenM0510.25596/JALC-2005-287https://doi.org/10.25596/jalc-2005-287https://dblp.org/rec/journals/jalc/KirstenM05URL#5833547Andreas MalettiHeiko VoglerIncomparability Results for Classes of Polynomial Tree Series Transformations.J. Autom. Lang. Comb.104535-5682005Journal Articlesclosedjournals/jalc/MalettiV0510.25596/JALC-2005-535https://doi.org/10.25596/jalc-2005-535https://dblp.org/rec/journals/jalc/MalettiV05URL#5833548Ingmar MeineckeThe Hadamard Product of Sequential-Parallel Series.J. Autom. Lang. Comb.102/3313-3462005Journal Articlesclosedjournals/jalc/Meinecke0510.25596/JALC-2005-313https://doi.org/10.25596/jalc-2005-313https://dblp.org/rec/journals/jalc/Meinecke05URL#5833549Tetsuya NakatohKensuke BabaDaisuke IkedaYasuhiro YamadaSachio HirokawaAn Efficient Mapping for Computing the Score of String Matching.J. Autom. Lang. Comb.105/6697-7042005Journal Articlesclosedjournals/jalc/NakatohBIYH0510.25596/JALC-2005-697https://doi.org/10.25596/jalc-2005-697https://dblp.org/rec/journals/jalc/NakatohBIYH05URL#5833550Taishin Y. NishidaSome New Aspects of Word-Length Controlled DT0L Systems.J. Autom. Lang. Comb.10161-772005Journal Articlesclosedjournals/jalc/Nishida0510.25596/JALC-2005-061https://doi.org/10.25596/jalc-2005-061https://dblp.org/rec/journals/jalc/Nishida05URL#5833551Alois PanholzerGröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function.J. Autom. Lang. Comb.10179-972005Journal Articlesclosedjournals/jalc/Panholzer0510.25596/JALC-2005-079https://doi.org/10.25596/jalc-2005-079https://dblp.org/rec/journals/jalc/Panholzer05URL#5833552German TischlerProperties and Applications of Parametric Weighted Finite Automata.J. Autom. Lang. Comb.102/3347-3652005Journal Articlesclosedjournals/jalc/Tischler0510.25596/JALC-2005-347https://doi.org/10.25596/jalc-2005-347https://dblp.org/rec/journals/jalc/Tischler05URL#5833553Andreas ZollmannKhalil Sima'anA Consistent and Efficient Estimator for Data-Oriented Parsing.J. Autom. Lang. Comb.102/3367-3882005Journal Articlesclosedjournals/jalc/ZollmannS0510.25596/JALC-2005-367https://doi.org/10.25596/jalc-2005-367https://dblp.org/rec/journals/jalc/ZollmannS05URL#5833554Henning BordihnMarkus Holzer 0001Martin KutribEconomy of Description for Basic Constructions on Rational Transductions.J. Autom. Lang. Comb.92/3175-1882004Journal Articlesclosedjournals/jalc/BordihnHK0410.25596/JALC-2004-175https://doi.org/10.25596/jalc-2004-175https://dblp.org/rec/journals/jalc/BordihnHK04URL#5987734Cezar CâmpeanuWing Hong HoThe Maximum State Complexity for Finite Languages.J. Autom. Lang. Comb.92/3189-2022004Journal Articlesclosedjournals/jalc/CampeanuH0410.25596/JALC-2004-189https://doi.org/10.25596/jalc-2004-189https://dblp.org/rec/journals/jalc/CampeanuH04URL#5987735Jean-Marc ChamparnaudGeorges HanselThomas ParanthoënDjelloul ZiadiRandom Generation Models for NFAs.J. Autom. Lang. Comb.92/3203-2162004Journal Articlesclosedjournals/jalc/ChamparnaudHPZ0410.25596/JALC-2004-203https://doi.org/10.25596/jalc-2004-203https://dblp.org/rec/journals/jalc/ChamparnaudHPZ04URL#5987736Jürgen DassowHelmut JürgensenDetlef WotschkeEditorial.J. Autom. Lang. Comb.92/31732004Journal Articlesclosedjournals/jalc/DassowJW0410.25596/JALC-2004-173https://doi.org/10.25596/jalc-2004-173https://dblp.org/rec/journals/jalc/DassowJW04URL#5987737Michael DomaratzkiKai SalomaaState Complexity of Shuffle on Trajectories.J. Autom. Lang. Comb.92/3217-2322004Journal Articlesclosedjournals/jalc/DomaratzkiS0410.25596/JALC-2004-217https://doi.org/10.25596/jalc-2004-217https://dblp.org/rec/journals/jalc/DomaratzkiS04URL#5987738Zoltán ÉsikZoltán L. NémethHigher Dimensional Automata.J. Autom. Lang. Comb.913-292004Journal Articlesclosedjournals/jalc/EikN0410.25596/JALC-2004-003https://doi.org/10.25596/jalc-2004-003https://dblp.org/rec/journals/jalc/EikN04URL#5987739Keith EllulBryan KrawetzJeffrey O. ShallitMing-wei WangRegular Expressions: New Results and Open Problems.J. Autom. Lang. Comb.92/3233-2562004Journal Articlesclosedjournals/jalc/EllulKSW0410.25596/JALC-2004-233https://doi.org/10.25596/jalc-2004-233https://dblp.org/rec/journals/jalc/EllulKSW04URL#5987740Mark G. EramianEfficient Simulation of Nondeterministic Weighted Finite Automata.J. Autom. Lang. Comb.92/3257-2672004Journal Articlesclosedjournals/jalc/Eramian0410.25596/JALC-2004-257https://doi.org/10.25596/jalc-2004-257https://dblp.org/rec/journals/jalc/Eramian04URL#5987741Rudolf FreundMarion OswaldP Systems with Conditional Communication Rules Assigned to Membranes.J. Autom. Lang. Comb.94387-3972004Journal Articlesclosedjournals/jalc/FreundO0410.25596/JALC-2004-387https://doi.org/10.25596/jalc-2004-387https://dblp.org/rec/journals/jalc/FreundO04URL#5987742Zoltán Fülöp 0001Heiko VoglerWeighted Tree Transducers.J. Autom. Lang. Comb.9131-542004Journal Articlesclosedjournals/jalc/FulopV0410.25596/JALC-2004-031https://doi.org/10.25596/jalc-2004-031https://dblp.org/rec/journals/jalc/FulopV04URL#5987743Ferenc GécsegBalázs ImrehOn Definite and Nilpotent DR Tree Languages.J. Autom. Lang. Comb.9155-602004Journal Articlesclosedjournals/jalc/GecsegI0410.25596/JALC-2004-055https://doi.org/10.25596/jalc-2004-055https://dblp.org/rec/journals/jalc/GecsegI04URL#5987744Cristian GrozeaNP Predicates Computable in the Weakest Level of the Grzegorczyck Hierarchy.J. Autom. Lang. Comb.92/3269-2792004Journal Articlesclosedjournals/jalc/Grozea0410.25596/JALC-2004-269https://doi.org/10.25596/jalc-2004-269https://dblp.org/rec/journals/jalc/Grozea04URL#5987745Giovanna GuaianaAntonio RestivoSergio SalemiOn the Trace Product and some Families of Languages Closed under Partial Commutations.J. Autom. Lang. Comb.9161-792004Journal Articlesclosedjournals/jalc/GuaianaRS0410.25596/JALC-2004-061https://doi.org/10.25596/jalc-2004-061https://dblp.org/rec/journals/jalc/GuaianaRS04URL#5987746Helmut JürgensenStavros KonstantinidisNguyen Huong LamAsymptotically Optimal Low-Cost Solid Codes.J. Autom. Lang. Comb.9181-1022004Journal Articlesclosedjournals/jalc/JurgensenKL0410.25596/JALC-2004-081https://doi.org/10.25596/jalc-2004-081https://dblp.org/rec/journals/jalc/JurgensenKL04URL#5987747Martin KappesChandra M. R. KintalaTradeoffs Between Reliability and Conciseness of Deterministic Finite Automata.J. Autom. Lang. Comb.92/3281-2922004Journal Articlesclosedjournals/jalc/KappesK0410.25596/JALC-2004-281https://doi.org/10.25596/jalc-2004-281https://dblp.org/rec/journals/jalc/KappesK04URL#5987748Lila KariStavros KonstantinidisDescriptional Complexity of Error/Edit Systems.J. Autom. Lang. Comb.92/3293-3092004Journal Articlesclosedjournals/jalc/KariK0410.25596/JALC-2004-293https://doi.org/10.25596/jalc-2004-293https://dblp.org/rec/journals/jalc/KariK04URL#5987749Sergey KitaevToufik MansourPatrice SééboldGenerating the Peano Curve and Counting Occurrences of some Patterns.J. Autom. Lang. Comb.94439-4552004Journal Articlesclosedjournals/jalc/KitaevMS0410.25596/JALC-2004-439https://doi.org/10.25596/jalc-2004-439https://dblp.org/rec/journals/jalc/KitaevMS04URL#5987750Vesa HalavaTero HarjuHendrik Jan HoogeboomMichel LatteuxValence Languages Generated by Equality Sets.J. Autom. Lang. Comb.94399-4062004Journal Articlesclosedjournals/jalc/Latteux0410.25596/JALC-2004-399https://doi.org/10.25596/jalc-2004-399https://dblp.org/rec/journals/jalc/Latteux04URL#5987751Ian McQuillanDescriptional Complexity of Block-Synchronization Context-Free Grammars.J. Autom. Lang. Comb.92/3317-3322004Journal Articlesclosedjournals/jalc/McQuillan0410.25596/JALC-2004-317https://doi.org/10.25596/jalc-2004-317https://dblp.org/rec/journals/jalc/McQuillan04URL#5987752Charlotte MillerContext Derivation Sets and Context-Free Normal Forms.J. Autom. Lang. Comb.92/3333-3452004Journal Articlesclosedjournals/jalc/Miller0410.25596/JALC-2004-333https://doi.org/10.25596/jalc-2004-333https://dblp.org/rec/journals/jalc/Miller04URL#5987753Madhu MutyamDescriptional Complexity of Rewriting P Systems.J. Autom. Lang. Comb.92/3311-3162004Journal Articlesclosedjournals/jalc/Mutyam0410.25596/JALC-2004-311https://doi.org/10.25596/jalc-2004-311https://dblp.org/rec/journals/jalc/Mutyam04URL#5987754Madhu MutyamKamala KrithivasanLength Synchronization Context-Free Grammars.J. Autom. Lang. Comb.94457-4642004Journal Articlesclosedjournals/jalc/MutyamK0410.25596/JALC-2004-457https://doi.org/10.25596/jalc-2004-457https://dblp.org/rec/journals/jalc/MutyamK04URL#5987755Jean NéraudCarla SelmiA Characterization of Complete Finite Prefix Codes in an Arbitrary Submonoid of A*.J. Autom. Lang. Comb.91103-1102004Journal Articlesclosedjournals/jalc/NeraudS0410.25596/JALC-2004-103https://doi.org/10.25596/jalc-2004-103https://dblp.org/rec/journals/jalc/NeraudS04URL#5987756Frank NießnerBüchi Automata and Their Degrees of Nondeterminism and Ambiguity.J. Autom. Lang. Comb.92/3347-3632004Journal Articlesclosedjournals/jalc/Niessner0410.25596/JALC-2004-347https://doi.org/10.25596/jalc-2004-347https://dblp.org/rec/journals/jalc/Niessner04URL#5987757Alexander OkhotinState Complexity of Linear Conjunctive Languages.J. Autom. Lang. Comb.92/3365-3812004Journal Articlesclosedjournals/jalc/Okhotin0410.25596/JALC-2004-365https://doi.org/10.25596/jalc-2004-365https://dblp.org/rec/journals/jalc/Okhotin04URL#5987758Tomasz JurdzinskiKrzysztof LorysGundula NiemannFriedrich OttoSome Results on RWW- and RRWW-Automata and their Relation to the Class of Growing Context-Sensitive Languages.J. Autom. Lang. Comb.94407-4372004Journal Articlesclosedjournals/jalc/Otto0410.25596/JALC-2004-407https://doi.org/10.25596/jalc-2004-407https://dblp.org/rec/journals/jalc/Otto04URL#5987759Yasubumi SakakibaraHiroshi ImaiA DNA-Based Computational Model Using a Specific Type of Restriction Enzymes.J. Autom. Lang. Comb.91111-1192004Journal Articlesclosedjournals/jalc/SakakibaraI0410.25596/JALC-2004-111https://doi.org/10.25596/jalc-2004-111https://dblp.org/rec/journals/jalc/SakakibaraI04URL#5987760Nicolae SanteanBimachines and Structurally-Reversed Automata.J. Autom. Lang. Comb.91121-1462004Journal Articlesclosedjournals/jalc/Santean0410.25596/JALC-2004-121https://doi.org/10.25596/jalc-2004-121https://dblp.org/rec/journals/jalc/Santean04URL#5987761Pascal WeilOn the Logical Definability of Certain Graph and Poset Languages.J. Autom. Lang. Comb.91147-1652004Journal Articlesclosedjournals/jalc/Weil0410.25596/JALC-2004-147https://doi.org/10.25596/jalc-2004-147https://dblp.org/rec/journals/jalc/Weil04URL#5987762Cyril AllauzenMehryar MohriEfficient Algorithms for Testing the Twins Property.J. Autom. Lang. Comb.82117-1442003Journal Articlesclosedjournals/jalc/AllauzenM0310.25596/JALC-2003-117https://doi.org/10.25596/jalc-2003-117https://dblp.org/rec/journals/jalc/AllauzenM03URL#6120805M. Sakthi BalanKamala KrithivasanMadhu MutyamSome Variants in Communication of Parallel Communicating Pushdown Automata.J. Autom. Lang. Comb.83401-4162003Journal Articlesclosedjournals/jalc/BalanKM0310.25596/JALC-2003-401https://doi.org/10.25596/jalc-2003-401https://dblp.org/rec/journals/jalc/BalanKM03URL#6120806Sergey BeregAndrei V. KelarevAn Algorithm for Analysis of Images in Spatial Information Systems.J. Autom. Lang. Comb.84557-5652003Journal Articlesclosedjournals/jalc/BeregK0310.25596/JALC-2003-557https://doi.org/10.25596/jalc-2003-557https://dblp.org/rec/journals/jalc/BeregK03URL#6120807Stephen L. BloomZoltán ÉsikAn Extension Theorem with an Application to Formal Tree Series.J. Autom. Lang. Comb.82145-1852003Journal Articlesclosedjournals/jalc/BloomE0310.25596/JALC-2003-145https://doi.org/10.25596/jalc-2003-145https://dblp.org/rec/journals/jalc/BloomE03URL#6120808Björn BorchardtHeiko VoglerDeterminization of Finite State Weighted Tree Automata.J. Autom. Lang. Comb.83417-4632003Journal Articlesclosedjournals/jalc/BorchardtV0310.25596/JALC-2003-417https://doi.org/10.25596/jalc-2003-417https://dblp.org/rec/journals/jalc/BorchardtV03URL#6120809Peter Buchholz 0001Peter KemperWeak Bisimulation for (max/+) Automata and Related Models.J. Autom. Lang. Comb.82187-2182003Journal Articlesclosedjournals/jalc/BuchholzK0310.25596/JALC-2003-187https://doi.org/10.25596/jalc-2003-187https://dblp.org/rec/journals/jalc/BuchholzK03URL#6120810Nicholas J. CavenaghLatin Trade Algorithms and the Smallest Critical Set in a Latin Square.J. Autom. Lang. Comb.84567-5782003Journal Articlesclosedjournals/jalc/Cavenagh0310.25596/JALC-2003-567https://doi.org/10.25596/jalc-2003-567https://dblp.org/rec/journals/jalc/Cavenagh03URL#6120811Flavio D'AlessandroOn the Complexity of Simon Automata over the Dyck Language.J. Autom. Lang. Comb.83465-4762003Journal Articlesclosedjournals/jalc/DAlessandro0310.25596/JALC-2003-465https://doi.org/10.25596/jalc-2003-465https://dblp.org/rec/journals/jalc/DAlessandro03URL#6120812Mark DaleyOscar H. IbarraLila KariIan McQuillanKoji NakanoThe LD and DLAD Bio-Operations on Formal Languages.J. Autom. Lang. Comb.83477-4982003Journal Articlesclosedjournals/jalc/DaleyIKMN0310.25596/JALC-2003-477https://doi.org/10.25596/jalc-2003-477https://dblp.org/rec/journals/jalc/DaleyIKMN03URL#6120813Jürgen DassowEditorial.J. Autom. Lang. Comb.813-42003Journal Articlesclosedjournals/jalc/Dassow0310.25596/JALC-2003-003https://doi.org/10.25596/jalc-2003-003https://dblp.org/rec/journals/jalc/Dassow03URL#6120814Diane M. DonovanCostas S. IliopoulosMirka MillerEditorial.J. Autom. Lang. Comb.845552003Journal Articlesclosedjournals/jalc/DonovanIM0310.25596/JALC-2003-555https://doi.org/10.25596/jalc-2003-555https://dblp.org/rec/journals/jalc/DonovanIM03URL#6120815Frank DrewesSigrid EwertRenate Klempien-HinrichsHans-Jörg KreowskiComputing Raster Images from Grid Picture Grammars.J. Autom. Lang. Comb.83499-5192003Journal Articlesclosedjournals/jalc/DrewesEKK0310.25596/JALC-2003-499https://doi.org/10.25596/jalc-2003-499https://dblp.org/rec/journals/jalc/DrewesEKK03URL#6120816Frank DrewesRenate Klempien-HinrichsHans-Jörg KreowskiTable-Driven and Context-Sensitive Collage Languages.J. Autom. Lang. Comb.815-242003Journal Articlesclosedjournals/jalc/DrewesKK0310.25596/JALC-2003-005https://doi.org/10.25596/jalc-2003-005https://dblp.org/rec/journals/jalc/DrewesKK03URL#6120817Manfred DrosteHeiko VoglerEditorial.J. Autom. Lang. Comb.821152003Journal Articlesclosedjournals/jalc/DrosteV0310.25596/JALC-2003-115https://doi.org/10.25596/jalc-2003-115https://dblp.org/rec/journals/jalc/DrosteV03URL#6120818Dirk ErmelDietmar WätjenLimited IL Systems.J. Autom. Lang. Comb.8125-422003Journal Articlesclosedjournals/jalc/ErmelW0310.25596/JALC-2003-025https://doi.org/10.25596/jalc-2003-025https://dblp.org/rec/journals/jalc/ErmelW03URL#6120819Zoltán ÉsikWerner KuichFormal Tree Series.J. Autom. Lang. Comb.82219-2852003Journal Articlesclosedjournals/jalc/EsikK0310.25596/JALC-2003-219https://doi.org/10.25596/jalc-2003-219https://dblp.org/rec/journals/jalc/EsikK03URL#6120820Chen-Ming FanHuei-Jan ShyrLanguages Related to the Properties of Disjunctivity and Code.J. Autom. Lang. Comb.83521-5382003Journal Articlesclosedjournals/jalc/FanS0310.25596/JALC-2003-521https://doi.org/10.25596/jalc-2003-521https://dblp.org/rec/journals/jalc/FanS03URL#6120821Frantisek FranekJan Holub 0001William F. SmythXiangdong XiaoComputing Quasi Suffix Arrays.J. Autom. Lang. Comb.84593-6062003Journal Articlesclosedjournals/jalc/FranekHSX0310.25596/JALC-2003-593https://doi.org/10.25596/jalc-2003-593https://dblp.org/rec/journals/jalc/FranekHSX03URL#6120822Frantisek FranekWilliam F. SmythYudong TangComputing all Repeats Using Suffix Arrays.J. Autom. Lang. Comb.84579-5912003Journal Articlesclosedjournals/jalc/FranekST0310.25596/JALC-2003-579https://doi.org/10.25596/jalc-2003-579https://dblp.org/rec/journals/jalc/FranekST03URL#6120823Balázs ImrehCsanád ImrehMasami ItoOn Monotonic Directable Nondeterministic Automata.J. Autom. Lang. Comb.83539-5472003Journal Articlesclosedjournals/jalc/ImrehII0310.25596/JALC-2003-539https://doi.org/10.25596/jalc-2003-539https://dblp.org/rec/journals/jalc/ImrehII03URL#6120824Bakhadyr KhoussainovSasha RubinAutomatic Structures: Overview and Future Directions.J. Autom. Lang. Comb.82287-3012003Journal Articlesclosedjournals/jalc/KhoussainovR0310.25596/JALC-2003-287https://doi.org/10.25596/jalc-2003-287https://dblp.org/rec/journals/jalc/KhoussainovR03URL#6120825Sergey KitaevThere are no Iterated Morphisms that Define the Arshon Sequence and the σ-Sequence.J. Autom. Lang. Comb.8143-502003Journal Articlesclosedjournals/jalc/Kitaev0310.25596/JALC-2003-043https://doi.org/10.25596/jalc-2003-043https://dblp.org/rec/journals/jalc/Kitaev03URL#6120826George LagogiannisChristos MakrisYannis PanagisSpyros SioutasKostas TsichlasNew Dynamic Balanced Search Trees with Worst-Case Constant Update Time.J. Autom. Lang. Comb.84607-6322003Journal Articlesclosedjournals/jalc/LagogiannisMPST0310.25596/JALC-2003-607https://doi.org/10.25596/jalc-2003-607https://dblp.org/rec/journals/jalc/LagogiannisMPST03URL#6120827George LagogiannisChristos MakrisYannis PanagisSpyros SioutasKostas TsichlasRectangle Enclosure Reporting in Linear Space Revisited.J. Autom. Lang. Comb.84633-6452003Journal Articlesclosedjournals/jalc/LagogiannisMPST03a10.25596/JALC-2003-633https://doi.org/10.25596/jalc-2003-633https://dblp.org/rec/journals/jalc/LagogiannisMPST03aURL#6120828Arnaud LefebvreThierry LecroqJoël AlexandreAn Improved Algorithm for Finding Longest Repeats with a Modified Factor Oracle.J. Autom. Lang. Comb.84647-6572003Journal Articlesclosedjournals/jalc/LefebvreLA0310.25596/JALC-2003-647https://doi.org/10.25596/jalc-2003-647https://dblp.org/rec/journals/jalc/LefebvreLA03URL#6120829Jens LiebehenschelOn the Connection Between Lexicographical Generation and Ranking.J. Autom. Lang. Comb.8151-572003Journal Articlesclosedjournals/jalc/Liebehenschel0310.25596/JALC-2003-051https://doi.org/10.25596/jalc-2003-051https://dblp.org/rec/journals/jalc/Liebehenschel03URL#6120830Charles Curtis LindnerA Small Embedding for Partial 4-Cycle Systems when the Leave is Small.J. Autom. Lang. Comb.84659-6622003Journal Articlesclosedjournals/jalc/Lindner0310.25596/JALC-2003-659https://doi.org/10.25596/jalc-2003-659https://dblp.org/rec/journals/jalc/Lindner03URL#6120831Prabhu ManyemRhonda L. SaltMarc Simon VisserApproximation Lower Bounds in Online LIB Bin Packing and Covering.J. Autom. Lang. Comb.84663-6742003Journal Articlesclosedjournals/jalc/ManyemSV0310.25596/JALC-2003-663https://doi.org/10.25596/jalc-2003-663https://dblp.org/rec/journals/jalc/ManyemSV03URL#6120832Carlos Martín-VideVictor MitranaRalf StiebeWeighted Grammars and Automata with Threshold Interpretation.J. Autom. Lang. Comb.82303-3182003Journal Articlesclosedjournals/jalc/Martin-VideMS0310.25596/JALC-2003-303https://doi.org/10.25596/jalc-2003-303https://dblp.org/rec/journals/jalc/Martin-VideMS03URL#6120833Elena PetreWatson-Crick ω-Automata.J. Autom. Lang. Comb.8159-702003Journal Articlesclosedjournals/jalc/Petre0310.25596/JALC-2003-059https://doi.org/10.25596/jalc-2003-059https://dblp.org/rec/journals/jalc/Petre03URL#6120834Olexandr RavskyA New Measure of Asymmetry of Binary Words.J. Autom. Lang. Comb.8171-742003Journal Articlesclosedjournals/jalc/Ravsky0310.25596/JALC-2003-071https://doi.org/10.25596/jalc-2003-071https://dblp.org/rec/journals/jalc/Ravsky03URL#6120835Olexandr RavskyOn the Palindromic Decomposition of Binary Words.J. Autom. Lang. Comb.8175-832003Journal Articlesclosedjournals/jalc/Ravsky03a10.25596/JALC-2003-075https://doi.org/10.25596/jalc-2003-075https://dblp.org/rec/journals/jalc/Ravsky03aURL#6120836Jan J. M. M. RuttenCoinductive Counting with Weighted Automata.J. Autom. Lang. Comb.82319-3522003Journal Articlesclosedjournals/jalc/Rutten0310.25596/JALC-2003-319https://doi.org/10.25596/jalc-2003-319https://dblp.org/rec/journals/jalc/Rutten03URL#6120837A. N. M. SalmanHajo BroersmaEdy Tri BaskoroSpanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs.J. Autom. Lang. Comb.84675-6812003Journal Articlesclosedjournals/jalc/SalmanBB0310.25596/JALC-2003-675https://doi.org/10.25596/jalc-2003-675https://dblp.org/rec/journals/jalc/SalmanBB03URL#6120838Ludwig StaigerWeighted Finite Automata and Metrics in Cantor Space.J. Autom. Lang. Comb.82353-3602003Journal Articlesclosedjournals/jalc/Staiger0310.25596/JALC-2003-353https://doi.org/10.25596/jalc-2003-353https://dblp.org/rec/journals/jalc/Staiger03URL#6120839Eugene W. StarkOn Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation.J. Autom. Lang. Comb.82361-3952003Journal Articlesclosedjournals/jalc/Stark0310.25596/JALC-2003-361https://doi.org/10.25596/jalc-2003-361https://dblp.org/rec/journals/jalc/Stark03URL#6120840Dietmar WätjenRemarks on Simple Eco-Grammar Systems with Prescribed Teams.J. Autom. Lang. Comb.8185-1082003Journal Articlesclosedjournals/jalc/Watjen0310.25596/JALC-2003-085https://doi.org/10.25596/jalc-2003-085https://dblp.org/rec/journals/jalc/Watjen03URL#6120841Henry N. Adorna3-Party Message Complexity is Better than 2-Party Ones for Proving Lower Bounds on the Size of Minimal Nondeterministic Finite Automata.J. Autom. Lang. Comb.74419-4322002Journal Articlesclosedjournals/jalc/Adorna0210.25596/JALC-2002-419https://doi.org/10.25596/jalc-2002-419https://dblp.org/rec/journals/jalc/Adorna02URL#6234205Talal Ali Al-HawaryCharacterizations of Certain Matroids via Flats.J. Autom. Lang. Comb.73295-3012002Journal Articlesclosedjournals/jalc/Al-Hawary0210.25596/JALC-2002-295https://doi.org/10.25596/jalc-2002-295https://dblp.org/rec/journals/jalc/Al-Hawary02URL#6234206K. ArthiKamala KrithivasanErzsébet Csuhaj-VarjúOn Rule-Number Complexity of Components of Probabilistic Cooperating Distributed Grammar Systems.J. Autom. Lang. Comb.74433-4462002Journal Articlesclosedjournals/jalc/ArthiKC0210.25596/JALC-2002-433https://doi.org/10.25596/jalc-2002-433https://dblp.org/rec/journals/jalc/ArthiKC02URL#6234207Sergey V. AvgustinovichAnna E. FridWords Avoiding Abelian Inclusions.J. Autom. Lang. Comb.713-92002Journal Articlesclosedjournals/jalc/AvgustinovichF0210.25596/JALC-2002-003https://doi.org/10.25596/jalc-2002-003https://dblp.org/rec/journals/jalc/AvgustinovichF02URL#6234208Henning BordihnBernd ReichelOn Descriptions of Context-Free Languages by CD Grammar Systems.J. Autom. Lang. Comb.74447-4542002Journal Articlesclosedjournals/jalc/BordihnR0210.25596/JALC-2002-447https://doi.org/10.25596/jalc-2002-447https://dblp.org/rec/journals/jalc/BordihnR02URL#6234209Patricia BouyerAntoine Petit 0001A Kleene/Büchi-like Theorem for Clock Languages.J. Autom. Lang. Comb.72167-1862002Journal Articlesclosedjournals/jalc/BouyerP0210.25596/JALC-2002-167https://doi.org/10.25596/jalc-2002-167https://dblp.org/rec/journals/jalc/BouyerP02URL#6234210Cezar CâmpeanuKai SalomaaSheng Yu 0001Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.J. Autom. Lang. Comb.73303-3102002Journal Articlesclosedjournals/jalc/CampeanuSY0210.25596/JALC-2002-303https://doi.org/10.25596/jalc-2002-303https://dblp.org/rec/journals/jalc/CampeanuSY02URL#6234211Jürgen DassowDetlef WotschkeBernd ReichelEditorial.J. Autom. Lang. Comb.744172002Journal Articlesclosedjournals/jalc/DassowWR0210.25596/JALC-2002-417https://doi.org/10.25596/jalc-2002-417https://dblp.org/rec/journals/jalc/DassowWR02URL#6234212Michael DomaratzkiState Complexity of Proportional Removals.J. Autom. Lang. Comb.74455-4682002Journal Articlesclosedjournals/jalc/Domaratzki0210.25596/JALC-2002-455https://doi.org/10.25596/jalc-2002-455https://dblp.org/rec/journals/jalc/Domaratzki02URL#6234213Michael DomaratzkiDerek KismanJeffrey O. ShallitOn the Number of Distinct Languages Accepted by Finite Automata with n States.J. Autom. Lang. Comb.74469-4862002Journal Articlesclosedjournals/jalc/DomaratzkiKS0210.25596/JALC-2002-469https://doi.org/10.25596/jalc-2002-469https://dblp.org/rec/journals/jalc/DomaratzkiKS02URL#6234214Manfred DrostePaul GastinEditorial.J. Autom. Lang. Comb.721652002Journal Articlesclosedjournals/jalc/DrosteG0210.25596/JALC-2002-165https://doi.org/10.25596/jalc-2002-165https://dblp.org/rec/journals/jalc/DrosteG02URL#6234215Joost EngelfrietZoltán Fülöp 0001Heiko VoglerBottom-Up and Top-Down Tree Series Transformations.J. Autom. Lang. Comb.7111-702002Journal Articlesclosedjournals/jalc/EngelfrietFV0210.25596/JALC-2002-011https://doi.org/10.25596/jalc-2002-011https://dblp.org/rec/journals/jalc/EngelfrietFV02URL#6234216Henning FernauMarkus Holzer 0001Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.J. Autom. Lang. Comb.74487-5032002Journal Articlesclosedjournals/jalc/FernauH0210.25596/JALC-2002-487https://doi.org/10.25596/jalc-2002-487https://dblp.org/rec/journals/jalc/FernauH02URL#6234217Ferenc GécsegBalázs ImrehOn Monotone Automata and Monotone Languages.J. Autom. Lang. Comb.7171-822002Journal Articlesclosedjournals/jalc/GecsegI0210.25596/JALC-2002-071https://doi.org/10.25596/jalc-2002-071https://dblp.org/rec/journals/jalc/GecsegI02URL#6234218Christian GermainJean Marcel PalloLinear Languages with a Nonassociative Concatenation.J. Autom. Lang. Comb.73311-3202002Journal Articlesclosedjournals/jalc/GermainP0210.25596/JALC-2002-311https://doi.org/10.25596/jalc-2002-311https://dblp.org/rec/journals/jalc/GermainP02URL#6234219Lucien HaddadHajime MachidaIvo G. RosenbergMaximal and Minimal Partial Clones.J. Autom. Lang. Comb.7183-932002Journal Articlesclosedjournals/jalc/HaddadMR0210.25596/JALC-2002-083https://doi.org/10.25596/jalc-2002-083https://dblp.org/rec/journals/jalc/HaddadMR02URL#6234220Kosaburo HashiguchiTakahiro KunaiShuji JimboFinite Codes over Free Binoids.J. Autom. Lang. Comb.74505-5182002Journal Articlesclosedjournals/jalc/HashiguchiKJ0210.25596/JALC-2002-505https://doi.org/10.25596/jalc-2002-505https://dblp.org/rec/journals/jalc/HashiguchiKJ02URL#6234221Juraj HromkovicDescriptional Complexity of Finite Automata: Concepts and Open Problems.J. Autom. Lang. Comb.74519-5312002Journal Articlesclosedjournals/jalc/Hromkovi0210.25596/JALC-2002-519https://doi.org/10.25596/jalc-2002-519https://dblp.org/rec/journals/jalc/Hromkovi02URL#6234222Dietrich KuskeRémi MorinPomsets for Local Trace Languages.J. Autom. Lang. Comb.72187-2242002Journal Articlesclosedjournals/jalc/KuskeM0210.25596/JALC-2002-187https://doi.org/10.25596/jalc-2002-187https://dblp.org/rec/journals/jalc/KuskeM02URL#6234223Martin KutribRefining Nondeterminism Below Linear Time.J. Autom. Lang. Comb.74533-5472002Journal Articlesclosedjournals/jalc/Kutrib0210.25596/JALC-2002-533https://doi.org/10.25596/jalc-2002-533https://dblp.org/rec/journals/jalc/Kutrib02URL#6234224Andreas MalcherDescriptional Complexity of Cellular Automata and Decidability Questions.J. Autom. Lang. Comb.74549-5602002Journal Articlesclosedjournals/jalc/Malcher0210.25596/JALC-2002-549https://doi.org/10.25596/jalc-2002-549https://dblp.org/rec/journals/jalc/Malcher02URL#6234225Carlos Martín-VideVictor MitranaGrammars with Bounded-Life Resources.J. Autom. Lang. Comb.74561-5702002Journal Articlesclosedjournals/jalc/Martin-VideM0210.25596/JALC-2002-561https://doi.org/10.25596/jalc-2002-561https://dblp.org/rec/journals/jalc/Martin-VideM02URL#6234226Alexander MedunaDescriptional Complexity of Scattered Rewriting and Multirewriting: An Overview.J. Autom. Lang. Comb.74571-5772002Journal Articlesclosedjournals/jalc/Meduna0210.25596/JALC-2002-571https://doi.org/10.25596/jalc-2002-571https://dblp.org/rec/journals/jalc/Meduna02URL#6234227Carlo MereghettiBeatrice PalanoThe Parallel Complexity of Deterministic and Probabilistic Automata.J. Autom. Lang. Comb.7195-1082002Journal Articlesclosedjournals/jalc/MereghettiP0210.25596/JALC-2002-095https://doi.org/10.25596/jalc-2002-095https://dblp.org/rec/journals/jalc/MereghettiP02URL#6234228Albert R. MeyerAlexander RabinovichValid Identity Problem for Shuffle Regular Expressions.J. Autom. Lang. Comb.71109-1252002Journal Articlesclosedjournals/jalc/MeyerR0210.25596/JALC-2002-109https://doi.org/10.25596/jalc-2002-109https://dblp.org/rec/journals/jalc/MeyerR02URL#6234229Mehryar MohriSemiring Frameworks and Algorithms for Shortest-Distance Problems.J. Autom. Lang. Comb.73321-3502002Journal Articlesclosedjournals/jalc/Mohri0210.25596/JALC-2002-321https://doi.org/10.25596/jalc-2002-321https://dblp.org/rec/journals/jalc/Mohri02URL#6234230Doron A. PeledMoshe Y. VardiMihalis YannakakisBlack Box Checking.J. Autom. Lang. Comb.72225-2462002Journal Articlesclosedjournals/jalc/PeledVY0210.25596/JALC-2002-225https://doi.org/10.25596/jalc-2002-225https://dblp.org/rec/journals/jalc/PeledVY02URL#6234231Eileen PelusoJonathan GoldstineShashi PhohaNormal Processes for Modeling the Desired Behavior of Distributed Autonomous Discrete Event Systems.J. Autom. Lang. Comb.71127-1422002Journal Articlesclosedjournals/jalc/PelusoGP0210.25596/JALC-2002-127https://doi.org/10.25596/jalc-2002-127https://dblp.org/rec/journals/jalc/PelusoGP02URL#6234232Michel RigoArnaud MaesMore on Generalized Automatic Sequences.J. Autom. Lang. Comb.73351-3762002Journal Articlesclosedjournals/jalc/RigoM0210.25596/JALC-2002-351https://doi.org/10.25596/jalc-2002-351https://dblp.org/rec/journals/jalc/RigoM02URL#6234233Patrice SééboldAbout some Overlap-Free Morphisms on a n-Letter Alphabet.J. Autom. Lang. Comb.74579-5972002Journal Articlesclosedjournals/jalc/Seebold0210.25596/JALC-2002-579https://doi.org/10.25596/jalc-2002-579https://dblp.org/rec/journals/jalc/Seebold02URL#6234234Huei-Jan ShyrRegular Nests.J. Autom. Lang. Comb.71143-1572002Journal Articlesclosedjournals/jalc/Shyr0210.25596/JALC-2002-143https://doi.org/10.25596/jalc-2002-143https://dblp.org/rec/journals/jalc/Shyr02URL#6234235Pascal TessonDenis ThérienThe Computing Power of Programs over Finite Monoids.J. Autom. Lang. Comb.72247-2582002Journal Articlesclosedjournals/jalc/TessonT0210.25596/JALC-2002-247https://doi.org/10.25596/jalc-2002-247https://dblp.org/rec/journals/jalc/TessonT02URL#6234236Ferucio Laurentiu TipleaErkki MäkinenOn the Complexity of a Problem on Monadic String Rewriting Systems.J. Autom. Lang. Comb.74599-6092002Journal Articlesclosedjournals/jalc/TipleaM0210.25596/JALC-2002-599https://doi.org/10.25596/jalc-2002-599https://dblp.org/rec/journals/jalc/TipleaM02URL#6234237Daniel-Claudian VoinescuOn the Combinatorial Alphabets of a Language.J. Autom. Lang. Comb.73377-3942002Journal Articlesclosedjournals/jalc/Voinescu0210.25596/JALC-2002-377https://doi.org/10.25596/jalc-2002-377https://dblp.org/rec/journals/jalc/Voinescu02URL#6234238Igor WalukiewiczLocal Logics for Traces.J. Autom. Lang. Comb.72259-2902002Journal Articlesclosedjournals/jalc/Walukiewicz0210.25596/JALC-2002-259https://doi.org/10.25596/jalc-2002-259https://dblp.org/rec/journals/jalc/Walukiewicz02URL#6234239Lan ZhangKatsushi InoueAkira ItoYue Wang 0002A Leaf-Size Hierarchy of Alternating Rebound Turing Machines.J. Autom. Lang. Comb.73395-4102002Journal Articlesclosedjournals/jalc/ZhangIIW0210.25596/JALC-2002-395https://doi.org/10.25596/jalc-2002-395https://dblp.org/rec/journals/jalc/ZhangIIW02URL#6234240Mouhamed Kadrie AhmadXavier AugrosSome Results on Codes for Generalized Factorizations.J. Autom. Lang. Comb.63239-2512001Journal Articlesclosedjournals/jalc/AhmadA0110.25596/JALC-2001-239https://doi.org/10.25596/jalc-2001-239https://dblp.org/rec/journals/jalc/AhmadA01URL#6330544Suna AydinHelmut JürgensenLynda E. RobbinsDialogues as Co-Operating Grammars.J. Autom. Lang. Comb.64395-4102001Journal Articlesclosedjournals/jalc/AydinJR0110.25596/JALC-2001-395https://doi.org/10.25596/jalc-2001-395https://dblp.org/rec/journals/jalc/AydinJR01URL#6330545Valérie BerthéLaurent VuillonPalindromes and Two-Dimensional Sturmian Sequences.J. Autom. Lang. Comb.62121-1382001Journal Articlesclosedjournals/jalc/BertheV0110.25596/JALC-2001-121https://doi.org/10.25596/jalc-2001-121https://dblp.org/rec/journals/jalc/BertheV01URL#6330546Henning BordihnMarkus Holzer 0001On the Number of Active Symbols in L and CD Grammar Systems.J. Autom. Lang. Comb.64411-4262001Journal Articlesclosedjournals/jalc/BordihnH0110.25596/JALC-2001-411https://doi.org/10.25596/jalc-2001-411https://dblp.org/rec/journals/jalc/BordihnH01URL#6330547Douglas S. BridgesAyan MahalanobisIncreasing, Nondecreasing, and Virtually Continuous Functions.J. Autom. Lang. Comb.62139-1432001Journal Articlesclosedjournals/jalc/BridgesM0110.25596/JALC-2001-139https://doi.org/10.25596/jalc-2001-139https://dblp.org/rec/journals/jalc/BridgesM01URL#6330548Klaus DeneckeJörg KoppitzSlavcho ShtrakovThe Depth of a Hypersubstitution.J. Autom. Lang. Comb.63253-2622001Journal Articlesclosedjournals/jalc/DeneckeKS0110.25596/JALC-2001-253https://doi.org/10.25596/jalc-2001-253https://dblp.org/rec/journals/jalc/DeneckeKS01URL#6330549Catalin DimaReal-Time Automata.J. Autom. Lang. Comb.613-232001Journal Articlesclosedjournals/jalc/Dima0110.25596/JALC-2001-003https://doi.org/10.25596/jalc-2001-003https://dblp.org/rec/journals/jalc/Dima01URL#6330550Pál DömösiZoltán ÉsikHomomorphic Simulation and Letichevsky's Criterion.J. Autom. Lang. Comb.64427-4362001Journal Articlesclosedjournals/jalc/DomosiE0110.25596/JALC-2001-427https://doi.org/10.25596/jalc-2001-427https://dblp.org/rec/journals/jalc/DomosiE01URL#6330551Zoltán Fülöp 0001Characterizing Important Subclasses of Attributed Tree Transformations by Macro Tree Transducers.J. Autom. Lang. Comb.62145-1892001Journal Articlesclosedjournals/jalc/Fulop0110.25596/JALC-2001-145https://doi.org/10.25596/jalc-2001-145https://dblp.org/rec/journals/jalc/Fulop01URL#6330552Christian GlaßerHeinz SchmitzThe Boolean Structure of Dot-Depth One.J. Autom. Lang. Comb.64437-4522001Journal Articlesclosedjournals/jalc/GlasserS0110.25596/JALC-2001-437https://doi.org/10.25596/jalc-2001-437https://dblp.org/rec/journals/jalc/GlasserS01URL#6330553Yannick GuesnetOn Maximal Dense Bifix Codes.J. Autom. Lang. Comb.63263-2732001Journal Articlesclosedjournals/jalc/Guesnet0110.25596/JALC-2001-263https://doi.org/10.25596/jalc-2001-263https://dblp.org/rec/journals/jalc/Guesnet01URL#6330554Pierre-Cyrille HéamSome Topological Properties of Rational Sets.J. Autom. Lang. Comb.63275-2902001Journal Articlesclosedjournals/jalc/Heam0110.25596/JALC-2001-275https://doi.org/10.25596/jalc-2001-275https://dblp.org/rec/journals/jalc/Heam01URL#6330555Jan Holub 0001Costas S. IliopoulosBorivoj MelicharLaurent MouchardDistributed Pattern Matching Using Finite Automata.J. Autom. Lang. Comb.62191-2012001Journal Articlesclosedjournals/jalc/HolubIMM0110.25596/JALC-2001-191https://doi.org/10.25596/jalc-2001-191https://dblp.org/rec/journals/jalc/HolubIMM01URL#6330556Markus Holzer 0001Kai SalomaaSheng Yu 0001On the State Complexity of k-Entry Deterministic Finite Automata.J. Autom. Lang. Comb.64453-4662001Journal Articlesclosedjournals/jalc/HolzerSY0110.25596/JALC-2001-453https://doi.org/10.25596/jalc-2001-453https://dblp.org/rec/journals/jalc/HolzerSY01URL#6330557Costas S. IliopoulosJamie SimpsonOn-Line Validation and Analysis of Partially Occluded Images.J. Autom. Lang. Comb.63291-3032001Journal Articlesclosedjournals/jalc/IliopoulosS0110.25596/JALC-2001-291https://doi.org/10.25596/jalc-2001-291https://dblp.org/rec/journals/jalc/IliopoulosS01URL#6330558Helmut JürgensenEditorial.J. Autom. Lang. Comb.643932001Journal Articlesclosedjournals/jalc/Jurgensen0110.25596/JALC-2001-393https://doi.org/10.25596/jalc-2001-393https://dblp.org/rec/journals/jalc/Jurgensen01URL#6330559Helmut JürgensenMasashi KatsuraStavros KonstantinidisMaximal Solid Codes.J. Autom. Lang. Comb.6125-502001Journal Articlesclosedjournals/jalc/JurgensenKK0110.25596/JALC-2001-025https://doi.org/10.25596/jalc-2001-025https://dblp.org/rec/journals/jalc/JurgensenKK01URL#6330560Andrei V. KelarevOlga SokratovaDirected Graphs and Syntactic Algebras of Tree Languages.J. Autom. Lang. Comb.63305-3112001Journal Articlesclosedjournals/jalc/KelarevS0110.25596/JALC-2001-305https://doi.org/10.25596/jalc-2001-305https://dblp.org/rec/journals/jalc/KelarevS01URL#6330561Rainer KempOn the Expected Number of Leftist Nodes in Simply Generated Trees.J. Autom. Lang. Comb.63313-3432001Journal Articlesclosedjournals/jalc/Kemp0110.25596/JALC-2001-313https://doi.org/10.25596/jalc-2001-313https://dblp.org/rec/journals/jalc/Kemp01URL#6330562Bakhadyr KhoussainovSasha RubinGraphs with Automatic Presentations over a Unary Alphabet.J. Autom. Lang. Comb.64467-4802001Journal Articlesclosedjournals/jalc/KhoussainovR0110.25596/JALC-2001-467https://doi.org/10.25596/jalc-2001-467https://dblp.org/rec/journals/jalc/KhoussainovR01URL#6330563Shankara Narayanan KrishnaRaghavan Rama 0001P Systems with Replicated Rewriting.J. Autom. Lang. Comb.63345-3502001Journal Articlesclosedjournals/jalc/KrishnaR0110.25596/JALC-2001-345https://doi.org/10.25596/jalc-2001-345https://dblp.org/rec/journals/jalc/KrishnaR01URL#6330564Erkki MäkinenOn the Inclusion Problem for Very Simple Deterministic Pushdown Automata.J. Autom. Lang. Comb.63351-3572001Journal Articlesclosedjournals/jalc/Makinen0110.25596/JALC-2001-351https://doi.org/10.25596/jalc-2001-351https://dblp.org/rec/journals/jalc/Makinen01URL#6330565Vincenzo MancaCarlos Martín-VideGheorghe PaunOn the Power of P Systems with Replicated Rewriting.J. Autom. Lang. Comb.63359-3742001Journal Articlesclosedjournals/jalc/MancaMP0110.25596/JALC-2001-359https://doi.org/10.25596/jalc-2001-359https://dblp.org/rec/journals/jalc/MancaMP01URL#6330566Massimiliano MilaniGiovanni PighizziniTight Bounds on the Simulation of Unary Probabilistic Automata by Deterministic Automata.J. Autom. Lang. Comb.64481-4922001Journal Articlesclosedjournals/jalc/MilaniP0110.25596/JALC-2001-481https://doi.org/10.25596/jalc-2001-481https://dblp.org/rec/journals/jalc/MilaniP01URL#6330567Frantisek MrázLookahead Hierarchies of Restarting Automata.J. Autom. Lang. Comb.64493-5062001Journal Articlesclosedjournals/jalc/Mraz0110.25596/JALC-2001-493https://doi.org/10.25596/jalc-2001-493https://dblp.org/rec/journals/jalc/Mraz01URL#6330568Markus E. NebelOn the Power of Subroutines for Finite State Machines.J. Autom. Lang. Comb.6151-742001Journal Articlesclosedjournals/jalc/Nebel0110.25596/JALC-2001-051https://doi.org/10.25596/jalc-2001-051https://dblp.org/rec/journals/jalc/Nebel01URL#6330569Taishin Y. NishidaSizes of Context-Free Languages Generated by Context-Free Grammars and Stable and Recurrent 0L Systems.J. Autom. Lang. Comb.64507-5182001Journal Articlesclosedjournals/jalc/Nishida0110.25596/JALC-2001-507https://doi.org/10.25596/jalc-2001-507https://dblp.org/rec/journals/jalc/Nishida01URL#6330570Alexander OkhotinConjunctive Grammars.J. Autom. Lang. Comb.64519-5352001Journal Articlesclosedjournals/jalc/Okhotin0110.25596/JALC-2001-519https://doi.org/10.25596/jalc-2001-519https://dblp.org/rec/journals/jalc/Okhotin01URL#6330571Friedrich OttoNikola RuskucConfluent Monadic String-Rewriting Systems and Automatic Structures.J. Autom. Lang. Comb.63375-3882001Journal Articlesclosedjournals/jalc/OttoR0110.25596/JALC-2001-375https://doi.org/10.25596/jalc-2001-375https://dblp.org/rec/journals/jalc/OttoR01URL#6330572Gheorghe PaunP Systems with Active Membranes: Attacking NP-Complete Problems.J. Autom. Lang. Comb.6175-902001Journal Articlesclosedjournals/jalc/Paun0110.25596/JALC-2001-075https://doi.org/10.25596/jalc-2001-075https://dblp.org/rec/journals/jalc/Paun01URL#6330573Tatjana PetkovicMagnus SteinbyPiecewise Directable Automata.J. Autom. Lang. Comb.62205-2202001Journal Articlesclosedjournals/jalc/PetkovicS0110.25596/JALC-2001-205https://doi.org/10.25596/jalc-2001-205https://dblp.org/rec/journals/jalc/PetkovicS01URL#6330574Jeffrey O. ShallitMing-wei WangAutomatic Complexity of Strings.J. Autom. Lang. Comb.64537-5542001Journal Articlesclosedjournals/jalc/ShallitW0110.25596/JALC-2001-537https://doi.org/10.25596/jalc-2001-537https://dblp.org/rec/journals/jalc/ShallitW01URL#6330575K. G. Subramanian 0001D. Gnanaraj ThomasP. Helen ChandraMaia HoeberechtsBasic Puzzle Grammars and Generation of Polygons.J. Autom. Lang. Comb.64555-5682001Journal Articlesclosedjournals/jalc/SubramanianTCH0110.25596/JALC-2001-555https://doi.org/10.25596/jalc-2001-555https://dblp.org/rec/journals/jalc/SubramanianTCH01URL#6330576Paavo TurakainenInjectivity of the Quotient h\g of two Morphisms and Ambiguity of Linear Grammars.J. Autom. Lang. Comb.6191-962001Journal Articlesclosedjournals/jalc/Turakainen0110.25596/JALC-2001-091https://doi.org/10.25596/jalc-2001-091https://dblp.org/rec/journals/jalc/Turakainen01URL#6330577Yuri VelinovOn the Regions of Influence in Complex Decomposition Forms of Finite Functions.J. Autom. Lang. Comb.64569-5792001Journal Articlesclosedjournals/jalc/Velinov0110.25596/JALC-2001-569https://doi.org/10.25596/jalc-2001-569https://dblp.org/rec/journals/jalc/Velinov01URL#6330578Dietmar WätjenDavid OstrovskyFunction-Limited 0L Systems Revisited.J. Autom. Lang. Comb.6197-1142001Journal Articlesclosedjournals/jalc/WatjenO0110.25596/JALC-2001-097https://doi.org/10.25596/jalc-2001-097https://dblp.org/rec/journals/jalc/WatjenO01URL#6330579Sheng Yu 0001State Complexity of Regular Languages.J. Autom. Lang. Comb.62221-2342001Journal Articlesclosedjournals/jalc/Yu0110.25596/JALC-2001-221https://doi.org/10.25596/jalc-2001-221https://dblp.org/rec/journals/jalc/Yu01URL#6330580Christian ChoffrutMassimiliano GoldwurmTimed Automata with Periodic Clock Constraints.J. Autom. Lang. Comb.54371-4032000Journal Articlesclosedjournals/jalc/ChoffrutG0010.25596/JALC-2000-371https://doi.org/10.25596/jalc-2000-371https://dblp.org/rec/journals/jalc/ChoffrutG00URL#6416525Erzsébet Csuhaj-VarjúParallel Communicating Grammar Systems with Bounded Resources: Results, Techniques, Open Problems.J. Autom. Lang. Comb.53175-1902000Journal Articlesclosedjournals/jalc/Csuhaj-Varju0010.25596/JALC-2000-175https://doi.org/10.25596/jalc-2000-175https://dblp.org/rec/journals/jalc/Csuhaj-Varju00URL#6416526Raymond R. DevillersHanna KlaudelElisabeth PelzAn Algebraic Box Calculus.J. Autom. Lang. Comb.5281-1072000Journal Articlesclosedjournals/jalc/DevillersKP0010.25596/JALC-2000-081https://doi.org/10.25596/jalc-2000-081https://dblp.org/rec/journals/jalc/DevillersKP00URL#6416527Zoltán ÉsikWerner KuichA Kleene Theorem for Lindenmayerian Algebraic Power Series.J. Autom. Lang. Comb.52109-1222000Journal Articlesclosedjournals/jalc/EsikK0010.25596/JALC-2000-109https://doi.org/10.25596/jalc-2000-109https://dblp.org/rec/journals/jalc/EsikK00URL#6416528Rudolf FreundArray Grammar Systems.J. Autom. Lang. Comb.5113-292000Journal Articlesclosedjournals/jalc/Freund0010.25596/JALC-2000-013https://doi.org/10.25596/jalc-2000-013https://dblp.org/rec/journals/jalc/Freund00URL#6416529Ján GasoUnreliable Colonies - the Sequential Case.J. Autom. Lang. Comb.5131-442000Journal Articlesclosedjournals/jalc/Gaso0010.25596/JALC-2000-031https://doi.org/10.25596/jalc-2000-031https://dblp.org/rec/journals/jalc/Gaso00URL#6416530Jozef GruskaDescriptional Complexity Issues in Quantum Computing.J. Autom. Lang. Comb.53191-2182000Journal Articlesclosedjournals/jalc/Gruska0010.25596/JALC-2000-191https://doi.org/10.25596/jalc-2000-191https://dblp.org/rec/journals/jalc/Gruska00URL#6416531Kosaburo HashiguchiShin IchiharaShuji JimboFormal Languages over Free Binoids.J. Autom. Lang. Comb.53219-2342000Journal Articlesclosedjournals/jalc/HashiguchiIJ0010.25596/JALC-2000-219https://doi.org/10.25596/jalc-2000-219https://dblp.org/rec/journals/jalc/HashiguchiIJ00URL#6416532Juha HonkalaOn Formal Power Series Generated by Lindenmayer Systems.J. Autom. Lang. Comb.52123-1442000Journal Articlesclosedjournals/jalc/Honkala0010.25596/JALC-2000-123https://doi.org/10.25596/jalc-2000-123https://dblp.org/rec/journals/jalc/Honkala00URL#6416533Martin KappesDescriptional Complexity of Deterministic Finite Automata with Multiple Initial States.J. Autom. Lang. Comb.53269-2782000Journal Articlesclosedjournals/jalc/Kappes0010.25596/JALC-2000-269https://doi.org/10.25596/jalc-2000-269https://dblp.org/rec/journals/jalc/Kappes00URL#6416534Jozef KelemenAlica KelemenováGrammar Systems: Where are we? And Where do we go from Here? (As an Editorial).J. Autom. Lang. Comb.515-122000Journal Articlesclosedjournals/jalc/KelemenK0010.25596/JALC-2000-005https://doi.org/10.25596/jalc-2000-005https://dblp.org/rec/journals/jalc/KelemenK00URL#6416535Hing LeungOn a Family of Nondeterministic Finite Automata.J. Autom. Lang. Comb.53235-2442000Journal Articlesclosedjournals/jalc/Leung0010.25596/JALC-2000-235https://doi.org/10.25596/jalc-2000-235https://dblp.org/rec/journals/jalc/Leung00URL#6416536Carlos Martín-VideAlexandru MateescuSpecial Families of Sewing Languages.J. Autom. Lang. Comb.53279-2862000Journal Articlesclosedjournals/jalc/Martin-VideM0010.25596/JALC-2000-279https://doi.org/10.25596/jalc-2000-279https://dblp.org/rec/journals/jalc/Martin-VideM00URL#6416537Alexandru MateescuKai SalomaaSheng Yu 0001On Fairness of Many-Dimensional Trajectories.J. Autom. Lang. Comb.52145-1572000Journal Articlesclosedjournals/jalc/MateescuSY0010.25596/JALC-2000-145https://doi.org/10.25596/jalc-2000-145https://dblp.org/rec/journals/jalc/MateescuSY00URL#6416538Carlo MereghettiGiovanni PighizziniTwo-Way Automata Simulations and Unary Languages.J. Autom. Lang. Comb.53287-3002000Journal Articlesclosedjournals/jalc/MereghettiP0010.25596/JALC-2000-287https://doi.org/10.25596/jalc-2000-287https://dblp.org/rec/journals/jalc/MereghettiP00URL#6416539Victor MitranaOn the Degree of Communication in Parallel Communicating Finite Automata Systems.J. Autom. Lang. Comb.53301-3142000Journal Articlesclosedjournals/jalc/Mitrana0010.25596/JALC-2000-301https://doi.org/10.25596/jalc-2000-301https://dblp.org/rec/journals/jalc/Mitrana00URL#6416540Friedrich OttoOn Dehn Functions of Finitely Presented Bi-Automatic Monoids.J. Autom. Lang. Comb.54405-4192000Journal Articlesclosedjournals/jalc/Otto0010.25596/JALC-2000-405https://doi.org/10.25596/jalc-2000-405https://dblp.org/rec/journals/jalc/Otto00URL#6416541Andrei PaunOn the Diameter of Various Classes of H Systems.J. Autom. Lang. Comb.53315-3242000Journal Articlesclosedjournals/jalc/Paun0010.25596/JALC-2000-315https://doi.org/10.25596/jalc-2000-315https://dblp.org/rec/journals/jalc/Paun00URL#6416542Holger Petersen 0001Prefix Rewriting and Descriptional Complexity.J. Autom. Lang. Comb.53245-2542000Journal Articlesclosedjournals/jalc/Petersen0010.25596/JALC-2000-245https://doi.org/10.25596/jalc-2000-245https://dblp.org/rec/journals/jalc/Petersen00URL#6416543Ivo G. RosenbergDietmar SchweigertLocally Maximal Clones II.J. Autom. Lang. Comb.54421-4552000Journal Articlesclosedjournals/jalc/RosenbergS0010.25596/JALC-2000-421https://doi.org/10.25596/jalc-2000-421https://dblp.org/rec/journals/jalc/RosenbergS00URL#6416544Heinz SchmitzRestricted Temporal Logic and Deterministic Languages.J. Autom. Lang. Comb.53325-3412000Journal Articlesclosedjournals/jalc/Schmitz0010.25596/JALC-2000-325https://doi.org/10.25596/jalc-2000-325https://dblp.org/rec/journals/jalc/Schmitz00URL#6416545José M. SempereOn a Class of Regular-like Expressions for Linear Languages.J. Autom. Lang. Comb.53343-3542000Journal Articlesclosedjournals/jalc/Sempere0010.25596/JALC-2000-343https://doi.org/10.25596/jalc-2000-343https://dblp.org/rec/journals/jalc/Sempere00URL#6416546Jeffrey O. ShallitAutomaticity and Rationality.J. Autom. Lang. Comb.53255-2682000Journal Articlesclosedjournals/jalc/Shallit0010.25596/JALC-2000-255https://doi.org/10.25596/jalc-2000-255https://dblp.org/rec/journals/jalc/Shallit00URL#6416547Petr SosíkOn the Decidability Problems of Eco-Grammar Systems.J. Autom. Lang. Comb.5145-582000Journal Articlesclosedjournals/jalc/Sosik0010.25596/JALC-2000-045https://doi.org/10.25596/jalc-2000-045https://dblp.org/rec/journals/jalc/Sosik00URL#6416548Lakshminarayanan SubramanianMuralidhar TalupurKamala KrithivasanC. Pandu RanganOn the Generative Power of Simple H Systems.J. Autom. Lang. Comb.54457-4732000Journal Articlesclosedjournals/jalc/SubramanianTKR0010.25596/JALC-2000-457https://doi.org/10.25596/jalc-2000-457https://dblp.org/rec/journals/jalc/SubramanianTKR00URL#6416549György VaszilFurther Remarks on Parallel Communicating Grammar Systems without a Master.J. Autom. Lang. Comb.5159-752000Journal Articlesclosedjournals/jalc/Vaszil0010.25596/JALC-2000-059https://doi.org/10.25596/jalc-2000-059https://dblp.org/rec/journals/jalc/Vaszil00URL#6416550Yuri VelinovRegions of Influence in Simple Decomposition Forms of Finite Functions.J. Autom. Lang. Comb.53355-3662000Journal Articlesclosedjournals/jalc/Velinov0010.25596/JALC-2000-355https://doi.org/10.25596/jalc-2000-355https://dblp.org/rec/journals/jalc/Velinov00URL#6416551Dietmar WätjenUndecidability Results for Uniformly k-Limited 0L Systems.J. Autom. Lang. Comb.52159-1672000Journal Articlesclosedjournals/jalc/Watjen0010.25596/JALC-2000-159https://doi.org/10.25596/jalc-2000-159https://dblp.org/rec/journals/jalc/Watjen00URL#6416552Jürgen DassowDetlef WotschkeEditorial.J. Autom. Lang. Comb.531732000Journal Articlesclosedjournals/jalc/X0010.25596/JALC-2000-173https://doi.org/10.25596/jalc-2000-173https://dblp.org/rec/journals/jalc/X00URL#6416553Eberhard BertschAbstract Comparison of two Error Detection Techniques for Programming Languages.J. Autom. Lang. Comb.4277-861999Journal Articlesclosedjournals/jalc/Bertsch9910.25596/JALC-1999-077https://doi.org/10.25596/jalc-1999-077https://dblp.org/rec/journals/jalc/Bertsch99URL#6496208Véronique BruyèreEditorial.J. Autom. Lang. Comb.43149-1511999Journal Articlesclosedjournals/jalc/Bruyere9910.25596/JALC-1999-149https://doi.org/10.25596/jalc-1999-149https://dblp.org/rec/journals/jalc/Bruyere99URL#6496209Véronique BruyèreClelia de FeliceOn the Existence of Codings Between Trace Monoids.J. Autom. Lang. Comb.4287-1001999Journal Articlesclosedjournals/jalc/BruyereF9910.25596/JALC-1999-087https://doi.org/10.25596/jalc-1999-087https://dblp.org/rec/journals/jalc/BruyereF99URL#6496210Julien CassaigneDouble Sequences with Complexity mn+1.J. Autom. Lang. Comb.43153-1701999Journal Articlesclosedjournals/jalc/Cassaigne9910.25596/JALC-1999-153https://doi.org/10.25596/jalc-1999-153https://dblp.org/rec/journals/jalc/Cassaigne99URL#6496211Christian ChoffrutHratchia PélibossianPierre SimonnetDecision Issues on Functions Realized by Finite Automata.J. Autom. Lang. Comb.43171-1811999Journal Articlesclosedjournals/jalc/ChoffrutPS9910.25596/JALC-1999-171https://doi.org/10.25596/jalc-1999-171https://dblp.org/rec/journals/jalc/ChoffrutPS99URL#6496212James D. CurrieHolger Petersen 0001John Michael RobsonJeffrey O. ShallitSeparating Words with Small Grammars.J. Autom. Lang. Comb.42101-1101999Journal Articlesclosedjournals/jalc/CurriePRS9910.25596/JALC-1999-101https://doi.org/10.25596/jalc-1999-101https://dblp.org/rec/journals/jalc/CurriePRS99URL#6496213Jeanne DevolderGenerators with Bounded Deciphering Delay for Rational ω-Languages.J. Autom. Lang. Comb.43183-2041999Journal Articlesclosedjournals/jalc/Devolder9910.25596/JALC-1999-183https://doi.org/10.25596/jalc-1999-183https://dblp.org/rec/journals/jalc/Devolder99URL#6496214Jean-Pierre DuvalLaurent MouchardSequences Obtained from a Series of Permutations of Borders and Ultimately Periodic Words.J. Autom. Lang. Comb.43205-2111999Journal Articlesclosedjournals/jalc/DuvalM9910.25596/JALC-1999-205https://doi.org/10.25596/jalc-1999-205https://dblp.org/rec/journals/jalc/DuvalM99URL#6496215Clelia de FeliceHajós Factorizations of Cyclic Groups - A Simpler Proof of a Characterization.J. Autom. Lang. Comb.42111-1161999Journal Articlesclosedjournals/jalc/Felice9910.25596/JALC-1999-111https://doi.org/10.25596/jalc-1999-111https://dblp.org/rec/journals/jalc/Felice99URL#6496216Henning FernauFrank Stephan 0001Characterizations of Recursively Enumerable Languages by Programmed Grammars With Unconditional Transfer.J. Autom. Lang. Comb.42117-1421999Journal Articlesclosedjournals/jalc/FernauS9910.25596/JALC-1999-117https://doi.org/10.25596/jalc-1999-117https://dblp.org/rec/journals/jalc/FernauS99URL#6496217Costas S. IliopoulosLaurent MouchardQuasiperiodicity: From Detection to Normal Forms.J. Autom. Lang. Comb.43213-2281999Journal Articlesclosedjournals/jalc/IliopoulosM9910.25596/JALC-1999-213https://doi.org/10.25596/jalc-1999-213https://dblp.org/rec/journals/jalc/IliopoulosM99URL#6496218Petr JancarFrantisek MrázMartin PlátekJörg Vogel 0001On Monotonic Automata with a Restart Operation.J. Autom. Lang. Comb.44287-3111999Journal Articlesclosedjournals/jalc/JancarMPV9910.25596/JALC-1999-287https://doi.org/10.25596/jalc-1999-287https://dblp.org/rec/journals/jalc/JancarMPV99URL#6496219Rainer KempOn Leftist Simply Generated Trees.J. Autom. Lang. Comb.44313-3311999Journal Articlesclosedjournals/jalc/Kemp9910.25596/JALC-1999-313https://doi.org/10.25596/jalc-1999-313https://dblp.org/rec/journals/jalc/Kemp99URL#6496220Maria MadoniaSergio SalemiTecla SportelliCovering Submonoids and Covering Codes.J. Autom. Lang. Comb.44333-3501999Journal Articlesclosedjournals/jalc/MadoniaSS9910.25596/JALC-1999-333https://doi.org/10.25596/jalc-1999-333https://dblp.org/rec/journals/jalc/MadoniaSS99URL#6496221Arnaud MaesAn Automata Theoretic Decidability Proof for First-Order Theory of ⟨ℕ,<,P⟩ with Morphic Predicate P.J. Autom. Lang. Comb.43229-2451999Journal Articlesclosedjournals/jalc/Maes9910.25596/JALC-1999-229https://doi.org/10.25596/jalc-1999-229https://dblp.org/rec/journals/jalc/Maes99URL#6496222Carlos Martín-VideGheorghe PaunCooperating Distributed Splicing Systems.J. Autom. Lang. Comb.413-161999Journal Articlesclosedjournals/jalc/Martin-VideP9910.25596/JALC-1999-003https://doi.org/10.25596/jalc-1999-003https://dblp.org/rec/journals/jalc/Martin-VideP99URL#6496223Ion PetreParikh's Theorem Does Not Hold for Multiplicities.J. Autom. Lang. Comb.4117-301999Journal Articlesclosedjournals/jalc/Petre9910.25596/JALC-1999-017https://doi.org/10.25596/jalc-1999-017https://dblp.org/rec/journals/jalc/Petre99URL#6496224Jean-François RaskinPierre-Yves SchobbensThe Logic of Event Clocks - Decidability, Complexity and Expressiveness.J. Autom. Lang. Comb.43247-2821999Journal Articlesclosedjournals/jalc/RaskinS9910.25596/JALC-1999-247https://doi.org/10.25596/jalc-1999-247https://dblp.org/rec/journals/jalc/RaskinS99URL#6496225Huei-Jan ShyrShyr-Shen YuSome Properties of Left Non-Cancellative Languages.J. Autom. Lang. Comb.44351-3601999Journal Articlesclosedjournals/jalc/ShyrY9910.25596/JALC-1999-351https://doi.org/10.25596/jalc-1999-351https://dblp.org/rec/journals/jalc/ShyrY99URL#6496226Dietmar WätjenTeams of Limited and Uniformly Limited 0L Systems.J. Autom. Lang. Comb.4131-571999Journal Articlesclosedjournals/jalc/Watjen9910.25596/JALC-1999-031https://doi.org/10.25596/jalc-1999-031https://dblp.org/rec/journals/jalc/Watjen99URL#6496227Liang Zhang 0008Kar-Ping ShumShou-Li PengGeneralized Prefix Relations and Codes with Finite Decoding Delay.J. Autom. Lang. Comb.4159-711999Journal Articlesclosedjournals/jalc/ZhangSP9910.25596/JALC-1999-059https://doi.org/10.25596/jalc-1999-059https://dblp.org/rec/journals/jalc/ZhangSP99URL#6496228Paolo BottoniAnna LabellaPiero MussioGheorghe PaunPattern Control on Derivations in Context-Free Rewriting.J. Autom. Lang. Comb.313-281998Journal Articlesclosedjournals/jalc/BottoniLMP9810.25596/JALC-1998-003https://doi.org/10.25596/jalc-1998-003https://dblp.org/rec/journals/jalc/BottoniLMP98URL#6565812Anna E. FridOn the Frequency of Factors in a D0L Word.J. Autom. Lang. Comb.3129-411998Journal Articlesclosedjournals/jalc/Frid9810.25596/JALC-1998-029https://doi.org/10.25596/jalc-1998-029https://dblp.org/rec/journals/jalc/Frid98URL#6565813Ferenc GécsegBalázs ImrehAndrás PluhárOn the Existence of Finite Isomorphically Complete Systems of Automata.J. Autom. Lang. Comb.3277-841998Journal Articlesclosedjournals/jalc/GecsegIP9810.25596/JALC-1998-077https://doi.org/10.25596/jalc-1998-077https://dblp.org/rec/journals/jalc/GecsegIP98URL#6565814Martin KappesMulti-Bracketed Contextual Grammars.J. Autom. Lang. Comb.3285-1031998Journal Articlesclosedjournals/jalc/Kappes9810.25596/JALC-1998-085https://doi.org/10.25596/jalc-1998-085https://dblp.org/rec/journals/jalc/Kappes98URL#6565815Juha KortelainenOn the System of Word Equations x0u1ix1u2ix2 ... umixm = y0v1iy1v2iy2 ... vniyn (i=0, 1, 2, ...) in a Free Monoid.J. Autom. Lang. Comb.3143-571998Journal Articlesclosedjournals/jalc/Kortelainen9810.25596/JALC-1998-043https://doi.org/10.25596/jalc-1998-043https://dblp.org/rec/journals/jalc/Kortelainen98URL#6565816Sebastian ManethHeiko VoglerAttributed Context-Free Hypergraph Grammars.J. Autom. Lang. Comb.32105-1471998Journal Articlesclosedjournals/jalc/ManethV9810.25596/JALC-1998-105https://doi.org/10.25596/jalc-1998-105https://dblp.org/rec/journals/jalc/ManethV98URL#6565817Viswanathan RadhakrishnanVenkatesan T. ChakaravarthyKamala KrithivasanPattern Matching in Matrix Grammars.J. Autom. Lang. Comb.3159-721998Journal Articlesclosedjournals/jalc/RadhakrishnanCK9810.25596/JALC-1998-059https://doi.org/10.25596/jalc-1998-059https://dblp.org/rec/journals/jalc/RadhakrishnanCK98URL#6565818Karel Culík IIVladimir ValentaGeneralized Finite Automata and Transducers.J. Autom. Lang. Comb.213-171997Journal Articlesclosedjournals/jalc/CulikV9710.25596/JALC-1997-003https://doi.org/10.25596/jalc-1997-003https://dblp.org/rec/journals/jalc/CulikV97URL#6629424Jürgen DuskeRainer ParchmannNon-Synchronized Pattern Languages are IO-Macro Languages.J. Autom. Lang. Comb.23143-1491997Journal Articlesclosedjournals/jalc/DuskeP9710.25596/JALC-1997-143https://doi.org/10.25596/jalc-1997-143https://dblp.org/rec/journals/jalc/DuskeP97URL#6629425Henning FernauGraph-Controlled Grammars as Language Acceptors.J. Autom. Lang. Comb.2279-911997Journal Articlesclosedjournals/jalc/Fernau9710.25596/JALC-1997-079https://doi.org/10.25596/jalc-1997-079https://dblp.org/rec/journals/jalc/Fernau97URL#6629426Wolf GöhringMinimal Initializing Word: A Contribution to Černý's Conjecture.J. Autom. Lang. Comb.24209-2261997Journal Articlesclosedjournals/jalc/Gohring9710.25596/JALC-1997-209https://doi.org/10.25596/jalc-1997-209https://dblp.org/rec/journals/jalc/Gohring97URL#6629427Jozef GruskaIrène GuessarianFixpoint Semantics of Synchronized Systems and Correctness of Their Basic Transformations.J. Autom. Lang. Comb.2293-1331997Journal Articlesclosedjournals/jalc/GruskaG9710.25596/JALC-1997-093https://doi.org/10.25596/jalc-1997-093https://dblp.org/rec/journals/jalc/GruskaG97URL#6629428Ulrich HuckenbeckOn Valve Adjustments that Interrupt all s-t-Paths in a Digraph.J. Autom. Lang. Comb.2119-451997Journal Articlesclosedjournals/jalc/Huckenbeck9710.25596/JALC-1997-019https://doi.org/10.25596/jalc-1997-019https://dblp.org/rec/journals/jalc/Huckenbeck97URL#6629429Matthias KriesellA Note on Hamiltonian Cycles in Lexicographical Products.J. Autom. Lang. Comb.22135-1381997Journal Articlesclosedjournals/jalc/Kriesell9710.25596/JALC-1997-135https://doi.org/10.25596/jalc-1997-135https://dblp.org/rec/journals/jalc/Kriesell97URL#6629430Jens LiebehenschelRanking and Unranking of Lexicographically Ordered Words: An Average-Case Analysis.J. Autom. Lang. Comb.24227-2681997Journal Articlesclosedjournals/jalc/Liebehenschel9710.25596/JALC-1997-227https://doi.org/10.25596/jalc-1997-227https://dblp.org/rec/journals/jalc/Liebehenschel97URL#6629431Victor MitranaCrossover Systems. A Generalization of Splicing Systems.J. Autom. Lang. Comb.23151-1601997Journal Articlesclosedjournals/jalc/Mitrana9710.25596/JALC-1997-151https://doi.org/10.25596/jalc-1997-151https://dblp.org/rec/journals/jalc/Mitrana97URL#6629432Markus E. NebelNew Results on the Stack Ramification of Binary Trees.J. Autom. Lang. Comb.23161-1751997Journal Articlesclosedjournals/jalc/Nebel9710.25596/JALC-1997-161https://doi.org/10.25596/jalc-1997-161https://dblp.org/rec/journals/jalc/Nebel97URL#6629433Lucio de ProphetisStefano VarricchioRecognizability of Rectangular Pictures by Wang Systems.J. Autom. Lang. Comb.24269-2881997Journal Articlesclosedjournals/jalc/ProphetisV9710.25596/JALC-1997-269https://doi.org/10.25596/jalc-1997-269https://dblp.org/rec/journals/jalc/ProphetisV97URL#6629434Kai SalomaaSheng Yu 0001NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.J. Autom. Lang. Comb.23177-1861997Journal Articlesclosedjournals/jalc/SalomaaY9710.25596/JALC-1997-177https://doi.org/10.25596/jalc-1997-177https://dblp.org/rec/journals/jalc/SalomaaY97URL#6629435Ferucio Laurentiu TipleaCristian EneHierarchies of Petri Net Languages and a Super-Normal Form.J. Autom. Lang. Comb.23187-2041997Journal Articlesclosedjournals/jalc/TipleaE9710.25596/JALC-1997-187https://doi.org/10.25596/jalc-1997-187https://dblp.org/rec/journals/jalc/TipleaE97URL#6629436Ferucio Laurentiu TipleaMasashi KatsuraMasami ItoProcesses and Vectorial Characterizations of Parallel Communicating Grammar Systems.J. Autom. Lang. Comb.2147-731997Journal Articlesclosedjournals/jalc/TipleaKI9710.25596/JALC-1997-047https://doi.org/10.25596/jalc-1997-047https://dblp.org/rec/journals/jalc/TipleaKI97URL#6629437Igor BaníkColonies as Systems of Turing Machines Without States.J. Autom. Lang. Comb.1281-961996Journal Articlesclosedjournals/jalc/Banik9610.25596/JALC-1996-081https://doi.org/10.25596/jalc-1996-081https://dblp.org/rec/journals/jalc/Banik96URL#6685483Henning BordihnHenning FernauAccepting Grammars and Systems via Context Condition Grammars.J. Autom. Lang. Comb.1297-1121996Journal Articlesclosedjournals/jalc/BordihnF9610.25596/JALC-1996-097https://doi.org/10.25596/jalc-1996-097https://dblp.org/rec/journals/jalc/BordihnF96URL#6685484Symeon BozapalidisConvex Algebras, Convex Modules and Formal Power Series on Trees.J. Autom. Lang. Comb.13165-1801996Journal Articlesclosedjournals/jalc/Bozapalidis9610.25596/JALC-1996-165https://doi.org/10.25596/jalc-1996-165https://dblp.org/rec/journals/jalc/Bozapalidis96URL#6685485James D. CurrieRobert O. SheltonCantor Sets and Dejean's Conjecture.J. Autom. Lang. Comb.12113-1271996Journal Articlesclosedjournals/jalc/CurrieS9610.25596/JALC-1996-113https://doi.org/10.25596/jalc-1996-113https://dblp.org/rec/journals/jalc/CurrieS96URL#6685486Jürgen DassowEditorial.J. Autom. Lang. Comb.1131996Journal Articlesclosedjournals/jalc/Dassow9610.25596/JALC-1996-003https://doi.org/10.25596/jalc-1996-003https://dblp.org/rec/journals/jalc/Dassow96URL#6685487Jürgen DassowEditorial.J. Autom. Lang. Comb.12791996Journal Articlesclosedjournals/jalc/Dassow96a10.25596/JALC-1996-079https://doi.org/10.25596/jalc-1996-079https://dblp.org/rec/journals/jalc/Dassow96aURL#6685488Jürgen DassowEditorial.J. Autom. Lang. Comb.142411996Journal Articlesclosedjournals/jalc/Dassow96b10.25596/JALC-1996-241https://doi.org/10.25596/jalc-1996-241https://dblp.org/rec/journals/jalc/Dassow96bURL#6685489Henning FernauMembership for k-Limited ET0L Languages is not Decidable.J. Autom. Lang. Comb.14243-2451996Journal Articlesclosedjournals/jalc/Fernau9610.25596/JALC-1996-243https://doi.org/10.25596/jalc-1996-243https://dblp.org/rec/journals/jalc/Fernau96URL#6685490Gianina GeorgescuOn the Regularity of Languages Generated by Parallel Communicating Grammar Systems.J. Autom. Lang. Comb.13181-1971996Journal Articlesclosedjournals/jalc/Georgescu9610.25596/JALC-1996-181https://doi.org/10.25596/jalc-1996-181https://dblp.org/rec/journals/jalc/Georgescu96URL#6685491Silvia GhilezanGeneralized Finiteness of Developments in Typed Lambda Calculi.J. Autom. Lang. Comb.14247-2571996Journal Articlesclosedjournals/jalc/Ghilezan9610.25596/JALC-1996-247https://doi.org/10.25596/jalc-1996-247https://dblp.org/rec/journals/jalc/Ghilezan96URL#6685492Jonathan S. GolanAlexandru MateescuDragos VaidaSemirings and Parallel Composition of Processes.J. Autom. Lang. Comb.13199-2171996Journal Articlesclosedjournals/jalc/GolanMV9610.25596/JALC-1996-199https://doi.org/10.25596/jalc-1996-199https://dblp.org/rec/journals/jalc/GolanMV96URL#6685493Peter J. GrabnerHelmut ProdingerOn the Optimality of an Algorithm of Reingold and Supowit.J. Autom. Lang. Comb.115-111996Journal Articlesclosedjournals/jalc/GrabnerP9610.25596/JALC-1996-005https://doi.org/10.25596/jalc-1996-005https://dblp.org/rec/journals/jalc/GrabnerP96URL#6685494Peter HartmannImplementation of Parallel Replacement Systems for Cellular Hypergraphs.J. Autom. Lang. Comb.12129-1461996Journal Articlesclosedjournals/jalc/Hartmann9610.25596/JALC-1996-129https://doi.org/10.25596/jalc-1996-129https://dblp.org/rec/journals/jalc/Hartmann96URL#6685495Joanna JedrzejowiczUndecidability Results for Shuffle Languages.J. Autom. Lang. Comb.12147-1591996Journal Articlesclosedjournals/jalc/Jedrzejowicz9610.25596/JALC-1996-147https://doi.org/10.25596/jalc-1996-147https://dblp.org/rec/journals/jalc/Jedrzejowicz96URL#6685496Lila KariGabriel ThierrinOmega-Syntactic Congruences.J. Autom. Lang. Comb.1113-261996Journal Articlesclosedjournals/jalc/KariT9610.25596/JALC-1996-013https://doi.org/10.25596/jalc-1996-013https://dblp.org/rec/journals/jalc/KariT96URL#6685497Rainer KempOn Prefixes of Formal Languages and Their Relation to the Average-Case Complexity of the Membership Problem.J. Autom. Lang. Comb.14259-3031996Journal Articlesclosedjournals/jalc/Kemp9610.25596/JALC-1996-259https://doi.org/10.25596/jalc-1996-259https://dblp.org/rec/journals/jalc/Kemp96URL#6685498Victor MitranaIterated Pattern Languages.J. Autom. Lang. Comb.14305-3111996Journal Articlesclosedjournals/jalc/Mitrana9610.25596/JALC-1996-305https://doi.org/10.25596/jalc-1996-305https://dblp.org/rec/journals/jalc/Mitrana96URL#6685499Gheorghe PaunRegular Extended H Systems are Computationally Universal.J. Autom. Lang. Comb.1127-361996Journal Articlesclosedjournals/jalc/Paun9610.25596/JALC-1996-027https://doi.org/10.25596/jalc-1996-027https://dblp.org/rec/journals/jalc/Paun96URL#6685500Gheorghe PaunGrzegorz RozenbergArto SalomaaPattern Grammars.J. Autom. Lang. Comb.13219-2351996Journal Articlesclosedjournals/jalc/PaunRS9610.25596/JALC-1996-219https://doi.org/10.25596/jalc-1996-219https://dblp.org/rec/journals/jalc/PaunRS96URL#6685501Kai SalomaaOn the Modularity of Decidability of Completeness and Termination.J. Autom. Lang. Comb.1137-531996Journal Articlesclosedjournals/jalc/Salomaa9610.25596/JALC-1996-037https://doi.org/10.25596/jalc-1996-037https://dblp.org/rec/journals/jalc/Salomaa96URL#6685502Dietmar WätjenRegulations of Uniformly k-Limited ET0L Systems and Their Relations to Controlled Context-Free Grammars.J. Autom. Lang. Comb.1155-741996Journal Articlesclosedjournals/jalc/Watjen9610.25596/JALC-1996-055https://doi.org/10.25596/jalc-1996-055https://dblp.org/rec/journals/jalc/Watjen96URL#6685503