Hoffmann, Stefan Computational complexity of synchronization under sparse regular constraints. (English) Zbl 07530239 Bampis, Evripidis (ed.) et al., Fundamentals of computation theory. 23rd international symposium, FCT 2021, Athens, Greece, September 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12867, 272-286 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{S. Hoffmann}, Lect. Notes Comput. Sci. 12867, 272--286 (2021; Zbl 07530239) Full Text: DOI arXiv OpenURL
Leupold, Peter On the unavoidability of primitive words and other languages. (English) Zbl 07488327 J. Autom. Lang. Comb. 26, No. 1-2, 91-107 (2021). MSC: 68Q45 PDF BibTeX XML Cite \textit{P. Leupold}, J. Autom. Lang. Comb. 26, No. 1--2, 91--107 (2021; Zbl 07488327) Full Text: Link OpenURL
D’Alessandro, Flavio; Ibarra, Oscar H.; McQuillan, Ian On finite-index indexed grammars and their restrictions. (English) Zbl 1497.68242 Inf. Comput. 279, Article ID 104613, 13 p. (2021). MSC: 68Q42 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} et al., Inf. Comput. 279, Article ID 104613, 13 p. (2021; Zbl 1497.68242) Full Text: DOI arXiv OpenURL
Carpi, Arturo; D’Alessandro, Flavio; Ibarra, Oscar H.; McQuillan, Ian Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity. (English) Zbl 1497.68252 Theor. Comput. Sci. 862, 97-118 (2021). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{A. Carpi} et al., Theor. Comput. Sci. 862, 97--118 (2021; Zbl 1497.68252) Full Text: DOI OpenURL
Carpi, Arturo; D’Alessandro, Flavio On bounded linear codes and the commutative equivalence. (English) Zbl 1477.68170 Theor. Comput. Sci. 852, 185-196 (2021). MSC: 68Q70 20M35 PDF BibTeX XML Cite \textit{A. Carpi} and \textit{F. D'Alessandro}, Theor. Comput. Sci. 852, 185--196 (2021; Zbl 1477.68170) Full Text: DOI OpenURL
Sin’ya, Ryoma Context-freeness of Word-MIX languages. (English) Zbl 07601079 Jonoska, Nataša (ed.) et al., Developments in language theory. 24th international conference, DLT 2020, Tampa, FL, USA, May 11–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12086, 304-318 (2020). MSC: 68Q45 PDF BibTeX XML Cite \textit{R. Sin'ya}, Lect. Notes Comput. Sci. 12086, 304--318 (2020; Zbl 07601079) Full Text: DOI OpenURL
Bell, Paul C.; Semukhin, Pavel Decidability of cutpoint isolation for probabilistic finite automata on letter-bounded inputs. (English) Zbl 07559478 Konnov, Igor (ed.) et al., 31st international conference on concurrency theory. CONCUR 2020, September 1–4, 2020, Vienna, Austria, virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 171, Article 22, 16 p. (2020). MSC: 68Q85 PDF BibTeX XML Cite \textit{P. C. Bell} and \textit{P. Semukhin}, LIPIcs -- Leibniz Int. Proc. Inform. 171, Article 22, 16 p. (2020; Zbl 07559478) Full Text: DOI arXiv OpenURL
Ibarra, Oscar H.; McQuillan, Ian Semilinearity of families of languages. (English) Zbl 1458.68102 Int. J. Found. Comput. Sci. 31, No. 8, 1179-1198 (2020). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{I. McQuillan}, Int. J. Found. Comput. Sci. 31, No. 8, 1179--1198 (2020; Zbl 1458.68102) Full Text: DOI OpenURL
Crespi Reghizzi, Stefano; San Pietro, Pierluigi Deque automata, languages, and planar graph representations. (English) Zbl 1440.68153 Theor. Comput. Sci. 834, 43-59 (2020). MSC: 68Q45 68R10 PDF BibTeX XML Cite \textit{S. Crespi Reghizzi} and \textit{P. San Pietro}, Theor. Comput. Sci. 834, 43--59 (2020; Zbl 1440.68153) Full Text: DOI OpenURL
Hejda, Tomáš; Kala, Vítězslav Additive structure of totally positive quadratic integers. (English) Zbl 1450.11113 Manuscr. Math. 163, No. 1-2, 263-278 (2020). Reviewer: Balasubramanian Sury (Bangalore) MSC: 11R11 11A55 20M05 20M14 PDF BibTeX XML Cite \textit{T. Hejda} and \textit{V. Kala}, Manuscr. Math. 163, No. 1--2, 263--278 (2020; Zbl 1450.11113) Full Text: DOI arXiv OpenURL
Kutrib, Martin Kernels of sub-classes of context-free languages. (English) Zbl 1440.68159 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 136-147 (2020). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Kutrib}, Lect. Notes Comput. Sci. 12011, 136--147 (2020; Zbl 1440.68159) Full Text: DOI OpenURL
Crespi Reghizzi, Stefano; San Pietro, Pierluigi Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet. (English) Zbl 1435.68153 Inf. Comput. 269, Article ID 104442, 17 p. (2019). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{S. Crespi Reghizzi} and \textit{P. San Pietro}, Inf. Comput. 269, Article ID 104442, 17 p. (2019; Zbl 1435.68153) Full Text: DOI arXiv OpenURL
Ibarra, Oscar H.; McQuillan, Ian On families of full trios containing counter machine languages. (English) Zbl 1436.68174 Theor. Comput. Sci. 799, 71-93 (2019). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{I. McQuillan}, Theor. Comput. Sci. 799, 71--93 (2019; Zbl 1436.68174) Full Text: DOI OpenURL
Freydenberger, Dominik D. A logic for document spanners. (English) Zbl 1430.68081 Theory Comput. Syst. 63, No. 7, 1679-1754 (2019). MSC: 68P15 03B70 68P20 68Q45 PDF BibTeX XML Cite \textit{D. D. Freydenberger}, Theory Comput. Syst. 63, No. 7, 1679--1754 (2019; Zbl 1430.68081) Full Text: DOI OpenURL
Ibarra, Oscar H. Grammatical characterizations of NPDAs and VPDAs with counters. (English) Zbl 1400.68106 Theor. Comput. Sci. 746, 136-150 (2018). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{O. H. Ibarra}, Theor. Comput. Sci. 746, 136--150 (2018; Zbl 1400.68106) Full Text: DOI OpenURL
Eremondi, Joey; Ibarra, Oscar H.; McQuillan, Ian On the density of context-free and counter languages. (English) Zbl 1387.68155 Int. J. Found. Comput. Sci. 29, No. 2, 233-250 (2018). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Eremondi} et al., Int. J. Found. Comput. Sci. 29, No. 2, 233--250 (2018; Zbl 1387.68155) Full Text: DOI OpenURL
Nguyen, Danny; Pak, Igor Enumerating projections of integer points in unbounded polyhedra. (English) Zbl 1385.05017 SIAM J. Discrete Math. 32, No. 2, 986-1002 (2018). MSC: 05A15 11P21 68W30 PDF BibTeX XML Cite \textit{D. Nguyen} and \textit{I. Pak}, SIAM J. Discrete Math. 32, No. 2, 986--1002 (2018; Zbl 1385.05017) Full Text: DOI arXiv OpenURL
Kanovich, Max; Kuznetsov, Stepan; Morrill, Glyn; Scedrov, Andre A polynomial-time algorithm for the Lambek calculus with brackets of bounded order. (English) Zbl 1434.03076 Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 22, 17 p. (2017). MSC: 03B47 68Q42 03F05 03F52 68Q25 PDF BibTeX XML Cite \textit{M. Kanovich} et al., LIPIcs -- Leibniz Int. Proc. Inform. 84, Article 22, 17 p. (2017; Zbl 1434.03076) Full Text: DOI arXiv OpenURL
Fernau, Henning; Paramasivan, Meenakshi; Schmid, Markus L.; Vorel, Vojtěch Characterization and complexity results on jumping finite automata. (English) Zbl 1371.68148 Theor. Comput. Sci. 679, 31-52 (2017). MSC: 68Q45 68Q17 PDF BibTeX XML Cite \textit{H. Fernau} et al., Theor. Comput. Sci. 679, 31--52 (2017; Zbl 1371.68148) Full Text: DOI arXiv OpenURL
D’Alessandro, Flavio; Ibarra, Oscar H.; McQuillan, Ian On finite-index indexed grammars and their restrictions. (English) Zbl 1485.68127 Drewes, Frank (ed.) et al., Language and automata theory and applications. 11th international conference, LATA 2017, Umeå, Sweden, March 6–9, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10168, 287-298 (2017). MSC: 68Q42 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} et al., Lect. Notes Comput. Sci. 10168, 287--298 (2017; Zbl 1485.68127) Full Text: DOI arXiv OpenURL
Ibarra, Oscar H. On decidability and closure properties of language classes with respect to bio-operations. (English) Zbl 1415.68131 Nat. Comput. 15, No. 2, 225-234 (2016). MSC: 68Q45 68Q05 68Q10 PDF BibTeX XML Cite \textit{O. H. Ibarra}, Nat. Comput. 15, No. 2, 225--234 (2016; Zbl 1415.68131) Full Text: DOI OpenURL
Ibarra, Oscar H.; McQuillan, Ian On bounded semilinear languages, counter machines, and finite-index ET0L. (English) Zbl 1475.68156 Han, Yo-Sub (ed.) et al., Implementation and application of automata. 21st international conference, CIAA 2016, Seoul, South Korea, July 19–22, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9705, 138-149 (2016). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{I. McQuillan}, Lect. Notes Comput. Sci. 9705, 138--149 (2016; Zbl 1475.68156) Full Text: DOI OpenURL
Herrmann, Andrea; Kutrib, Martin; Malcher, Andreas; Wendlandt, Matthias Descriptional complexity of bounded regular languages. (English) Zbl 1476.68130 Câmpeanu, Cezar (ed.) et al., Descriptional complexity of formal systems. 18th IFIP WG 1.2 international conference, DCFS 2016, Bucharest, Romania, July 5–8, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9777, 138-152 (2016). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Herrmann} et al., Lect. Notes Comput. Sci. 9777, 138--152 (2016; Zbl 1476.68130) Full Text: DOI Link OpenURL
Ramos, Marcus Vinícius Midena; de Queiroz, Ruy J. G. B.; Moreira, Nelma; Bacelar Almeida, José Carlos On the formalization of some results of context-free language theory. (English) Zbl 1478.68133 Väänänen, Jouko (ed.) et al., Logic, language, information, and computation. 23rd international workshop, WoLLIC 2016, Puebla, Mexico, August 16–19th, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9803, 338-357 (2016). MSC: 68Q45 68Q42 68V20 PDF BibTeX XML Cite \textit{M. V. M. Ramos} et al., Lect. Notes Comput. Sci. 9803, 338--357 (2016; Zbl 1478.68133) Full Text: DOI Link OpenURL
Ibarra, Oscar H.; McQuillan, Ian On families of full trios containing counter machine languages. (English) Zbl 1436.68173 Brlek, Srečko (ed.) et al., Developments in language theory. 20th international conference, DLT 2016, Montréal, Canada, July 25–28, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9840, 216-228 (2016). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{I. McQuillan}, Lect. Notes Comput. Sci. 9840, 216--228 (2016; Zbl 1436.68173) Full Text: DOI OpenURL
Zhang, Zhiqiang; Wu, Tingfang; Păun, Andrei; Pan, Linqiang Numerical P systems with migrating variables. (English) Zbl 1344.68082 Theor. Comput. Sci. 641, 85-108 (2016). MSC: 68Q05 68Q10 68Q45 PDF BibTeX XML Cite \textit{Z. Zhang} et al., Theor. Comput. Sci. 641, 85--108 (2016; Zbl 1344.68082) Full Text: DOI OpenURL
Ibarra, Oscar H.; Ravikumar, Bala On bounded languages and reversal-bounded automata. (English) Zbl 1333.68168 Inf. Comput. 246, 30-42 (2016). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{B. Ravikumar}, Inf. Comput. 246, 30--42 (2016; Zbl 1333.68168) Full Text: DOI OpenURL
Ceccherini-Silberstein, Tullio; Coornaert, Michel; Fiorenzi, Francesca; Schupp, Paul E.; Touikan, Nicholas W. M. Multipass automata and group word problems. (English) Zbl 1329.68160 Theor. Comput. Sci. 600, 19-33 (2015). MSC: 68Q45 20F10 PDF BibTeX XML Cite \textit{T. Ceccherini-Silberstein} et al., Theor. Comput. Sci. 600, 19--33 (2015; Zbl 1329.68160) Full Text: DOI arXiv OpenURL
D’Alessandro, Flavio; Intrigila, Benedetto On the commutative equivalence of bounded context-free and regular languages: the semi-linear case. (English) Zbl 1318.68103 Theor. Comput. Sci. 572, 1-24 (2015). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} and \textit{B. Intrigila}, Theor. Comput. Sci. 572, 1--24 (2015; Zbl 1318.68103) Full Text: DOI OpenURL
D’Alessandro, Flavio; Intrigila, Benedetto On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\). (English) Zbl 1304.68099 Theor. Comput. Sci. 562, 476-495 (2015). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} and \textit{B. Intrigila}, Theor. Comput. Sci. 562, 476--495 (2015; Zbl 1304.68099) Full Text: DOI OpenURL
D’Alessandro, Flavio; Intrigila, Benedetto On the commutative equivalence of bounded context-free and regular languages: the code case. (English) Zbl 1304.68098 Theor. Comput. Sci. 562, 304-319 (2015). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} and \textit{B. Intrigila}, Theor. Comput. Sci. 562, 304--319 (2015; Zbl 1304.68098) Full Text: DOI OpenURL
Ibarra, Oscar H.; Seki, Shinnosuke On the open problem of Ginsburg concerning semilinear sets and related problems. (English) Zbl 1296.68094 Theor. Comput. Sci. 501, 11-19 (2013). MSC: 68Q45 03B25 03D05 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{S. Seki}, Theor. Comput. Sci. 501, 11--19 (2013; Zbl 1296.68094) Full Text: DOI OpenURL
Berglund, Martin; Björklund, Henrik; Björklund, Johanna Shuffled languages – representation and recognition. (English) Zbl 1294.68101 Theor. Comput. Sci. 489-490, 1-20 (2013). MSC: 68Q45 68Q17 PDF BibTeX XML Cite \textit{M. Berglund} et al., Theor. Comput. Sci. 489--490, 1--20 (2013; Zbl 1294.68101) Full Text: DOI OpenURL
Malcher, Andreas; Pighizzini, Giovanni Descriptional complexity of bounded context-free languages. (English) Zbl 1358.68173 Inf. Comput. 227, 1-20 (2013). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Malcher} and \textit{G. Pighizzini}, Inf. Comput. 227, 1--20 (2013; Zbl 1358.68173) Full Text: DOI OpenURL
Shur, Arseny M. Growth properties of power-free languages. (English) Zbl 1298.68157 Comput. Sci. Rev. 6, No. 5-6, 187-208 (2012). MSC: 68Q45 68-02 PDF BibTeX XML Cite \textit{A. M. Shur}, Comput. Sci. Rev. 6, No. 5--6, 187--208 (2012; Zbl 1298.68157) Full Text: DOI OpenURL
Choffrut, Christian; Malcher, Andreas; Mereghetti, Carlo; Palano, Beatrice First-order logics: some characterizations and closure properties. (English) Zbl 1279.68143 Acta Inf. 49, No. 4, 225-248 (2012). MSC: 68Q45 68Q19 PDF BibTeX XML Cite \textit{C. Choffrut} et al., Acta Inf. 49, No. 4, 225--248 (2012; Zbl 1279.68143) Full Text: DOI OpenURL
Ganty, Pierre; Majumdar, Rupak; Monmege, Benjamin Bounded underapproximations. (English) Zbl 1247.68140 Form. Methods Syst. Des. 40, No. 2, 206-231 (2012). MSC: 68Q45 68Q60 PDF BibTeX XML Cite \textit{P. Ganty} et al., Form. Methods Syst. Des. 40, No. 2, 206--231 (2012; Zbl 1247.68140) Full Text: DOI arXiv OpenURL
Malcher, Andreas; Mereghetti, Carlo; Palano, Beatrice Descriptional complexity of two-way pushdown automata with restricted head reversals. (English) Zbl 1276.68094 Theor. Comput. Sci. 449, 119-133 (2012). Reviewer: Giovanni Pighizzini (Milano) MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Malcher} et al., Theor. Comput. Sci. 449, 119--133 (2012; Zbl 1276.68094) Full Text: DOI OpenURL
D’Alessandro, Flavio; Intrigila, Benedetto; Varricchio, Stefano Quasi-polynomials, linear Diophantine equations and semi-linear sets. (English) Zbl 1253.11042 Theor. Comput. Sci. 416, 1-16 (2012). Reviewer: Dmitriy Frolenkov (Moscow) MSC: 11D04 52C07 68Q70 PDF BibTeX XML Cite \textit{F. D'Alessandro} et al., Theor. Comput. Sci. 416, 1--16 (2012; Zbl 1253.11042) Full Text: DOI OpenURL
Holub, Štěpán; Kortelainen, Juha On partitions separating words. (English) Zbl 1239.68039 Int. J. Algebra Comput. 21, No. 8, 1305-1316 (2011). Reviewer: Adrian Atanasiu (Bucharest) MSC: 68Q45 68R15 52C35 PDF BibTeX XML Cite \textit{Š. Holub} and \textit{J. Kortelainen}, Int. J. Algebra Comput. 21, No. 8, 1305--1316 (2011; Zbl 1239.68039) Full Text: DOI OpenURL
Cousot, Patrick; Cousot, Radhia Grammar semantics, analysis and parsing by abstract interpretation. (English) Zbl 1248.68316 Theor. Comput. Sci. 412, No. 44, 6135-6192 (2011). Reviewer: Anna Labella (Roma) MSC: 68Q55 68Q45 68Q42 PDF BibTeX XML Cite \textit{P. Cousot} and \textit{R. Cousot}, Theor. Comput. Sci. 412, No. 44, 6135--6192 (2011; Zbl 1248.68316) Full Text: DOI OpenURL
Malcher, Andreas; Mereghetti, Carlo; Palano, Beatrice Descriptional complexity of two-way pushdown automata with restricted head reversals. (English) Zbl 1341.68100 Holzer, Markus (ed.) et al., Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25–27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22599-4/pbk). Lecture Notes in Computer Science 6808, 248-260 (2011). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Malcher} et al., Lect. Notes Comput. Sci. 6808, 248--260 (2011; Zbl 1341.68100) Full Text: DOI OpenURL
Cui, Bo; Kari, Lila; Seki, Shinnosuke Block insertion and deletion on trajectories. (English) Zbl 1206.68170 Theor. Comput. Sci. 412, No. 8-10, 714-728 (2011). MSC: 68Q45 PDF BibTeX XML Cite \textit{B. Cui} et al., Theor. Comput. Sci. 412, No. 8--10, 714--728 (2011; Zbl 1206.68170) Full Text: DOI OpenURL
Holzer, Markus; Kutrib, Martin; Malcher, Andreas Complexity of multi-head finite automata: origins and directions. (English) Zbl 1207.68188 Theor. Comput. Sci. 412, No. 1-2, 83-96 (2011). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Holzer} et al., Theor. Comput. Sci. 412, No. 1--2, 83--96 (2011; Zbl 1207.68188) Full Text: DOI OpenURL
Gawrychowski, Paweł; Krieger, Dalia; Rampersad, Narad; Shallit, Jeffrey Finding the growth rate of a regular or context-free language in polynomial time. (English) Zbl 1206.68172 Int. J. Found. Comput. Sci. 21, No. 4, 597-618 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{P. Gawrychowski} et al., Int. J. Found. Comput. Sci. 21, No. 4, 597--618 (2010; Zbl 1206.68172) Full Text: DOI OpenURL
Choffrut, Christian; D’Alessandro, Flavio; Varricchio, Stefano On bounded rational trace languages. (English) Zbl 1209.68295 Theory Comput. Syst. 46, No. 2, 351-369 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{C. Choffrut} et al., Theory Comput. Syst. 46, No. 2, 351--369 (2010; Zbl 1209.68295) Full Text: DOI OpenURL
D’Alessandro, Flavio; Intrigila, Benedetto; Varricchio, Stefano The Parikh counting functions of sparse context-free languages are quasi-polynomials. (English) Zbl 1194.68135 Theor. Comput. Sci. 410, No. 47-49, 5158-5181 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} et al., Theor. Comput. Sci. 410, No. 47--49, 5158--5181 (2009; Zbl 1194.68135) Full Text: DOI OpenURL
Kutrib, Martin; Malcher, Andreas; Werlein, Larissa Regulated nondeterminism in pushdown automata. (English) Zbl 1194.68142 Theor. Comput. Sci. 410, No. 37, 3447-3460 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Kutrib} et al., Theor. Comput. Sci. 410, No. 37, 3447--3460 (2009; Zbl 1194.68142) Full Text: DOI OpenURL
Yen, Hsu-Chun Path decomposition and semilinearity of Petri nets. (English) Zbl 1192.68453 Int. J. Found. Comput. Sci. 20, No. 4, 581-596 (2009). MSC: 68Q85 PDF BibTeX XML Cite \textit{H.-C. Yen}, Int. J. Found. Comput. Sci. 20, No. 4, 581--596 (2009; Zbl 1192.68453) Full Text: DOI OpenURL
Stiebe, Ralf Slender Siromoney matrix languages. (English) Zbl 1328.68107 Inf. Comput. 206, No. 9-10, 1248-1258 (2008). MSC: 68Q42 68Q45 PDF BibTeX XML Cite \textit{R. Stiebe}, Inf. Comput. 206, No. 9--10, 1248--1258 (2008; Zbl 1328.68107) Full Text: DOI OpenURL
Kutrib, Martin; Malcher, Andreas; Wotschke, Detlef The Boolean closure of linear context-free languages. (English) Zbl 1144.68035 Acta Inf. 45, No. 3, 177-191 (2008). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Kutrib} et al., Acta Inf. 45, No. 3, 177--191 (2008; Zbl 1144.68035) Full Text: DOI OpenURL
Reinhardt, Klaus A tree-height hierarchy of context-free languages. (English) Zbl 1191.68402 Int. J. Found. Comput. Sci. 18, No. 6, 1383-1394 (2007). MSC: 68Q45 68Q15 68Q70 PDF BibTeX XML Cite \textit{K. Reinhardt}, Int. J. Found. Comput. Sci. 18, No. 6, 1383--1394 (2007; Zbl 1191.68402) Full Text: DOI OpenURL
Domaratzki, Michael Bond-free DNA language classes. (English) Zbl 1130.68061 Nat. Comput. 6, No. 4, 371-402 (2007). MSC: 68Q10 68Q45 92D20 PDF BibTeX XML Cite \textit{M. Domaratzki}, Nat. Comput. 6, No. 4, 371--402 (2007; Zbl 1130.68061) Full Text: DOI OpenURL
Choffrut, Christian; D’alessandro, Flavio; Varricchio, Stefano On the separability of sparse context-free languages and of bounded rational relations. (English) Zbl 1188.68170 Theor. Comput. Sci. 381, No. 1-3, 274-279 (2007). MSC: 68Q45 PDF BibTeX XML Cite \textit{C. Choffrut} et al., Theor. Comput. Sci. 381, No. 1--3, 274--279 (2007; Zbl 1188.68170) Full Text: DOI OpenURL
Lehnert, Jörg; Schweitzer, Pascal The co-word problem for the Higman-Thompson group is context-free. (English) Zbl 1166.20025 Bull. Lond. Math. Soc. 39, No. 2, 235-241 (2007). MSC: 20F10 68Q45 03D40 PDF BibTeX XML Cite \textit{J. Lehnert} and \textit{P. Schweitzer}, Bull. Lond. Math. Soc. 39, No. 2, 235--241 (2007; Zbl 1166.20025) Full Text: DOI OpenURL
Konstantinidis, Stavros; Santean, Nicolae; Yu, Sheng Representation and uniformization of algebraic transductions. (English) Zbl 1106.68061 Acta Inf. 43, No. 6, 395-417 (2007). MSC: 68Q45 PDF BibTeX XML Cite \textit{S. Konstantinidis} et al., Acta Inf. 43, No. 6, 395--417 (2007; Zbl 1106.68061) Full Text: DOI OpenURL
Engelfriet, Joost; Maneth, Sebastian The equivalence problem for deterministic MSO tree transducers is decidable. (English) Zbl 1185.68385 Inf. Process. Lett. 100, No. 5, 206-212 (2006). MSC: 68Q45 68R10 PDF BibTeX XML Cite \textit{J. Engelfriet} and \textit{S. Maneth}, Inf. Process. Lett. 100, No. 5, 206--212 (2006; Zbl 1185.68385) Full Text: DOI arXiv OpenURL
Ibarra, Oscar H.; Woodworth, Sara On symport/antiport P systems with a small number of objects. (English) Zbl 1112.68063 Int. J. Comput. Math. 83, No. 7, 613-629 (2006). MSC: 68Q10 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{S. Woodworth}, Int. J. Comput. Math. 83, No. 7, 613--629 (2006; Zbl 1112.68063) Full Text: DOI OpenURL
Holt, Derek F.; Röver, Claas E. Groups with indexed co-word problem. (English) Zbl 1151.20028 Int. J. Algebra Comput. 16, No. 5, 985-1014 (2006). MSC: 20F10 68Q45 03D40 20F05 PDF BibTeX XML Cite \textit{D. F. Holt} and \textit{C. E. Röver}, Int. J. Algebra Comput. 16, No. 5, 985--1014 (2006; Zbl 1151.20028) Full Text: DOI OpenURL
Ibarra, Oscar H.; Yen, Hsu-Chun Deterministic catalytic systems are not universal. (English) Zbl 1153.68019 Theor. Comput. Sci. 363, No. 2, 149-161 (2006). MSC: 68Q10 68Q42 68Q45 PDF BibTeX XML Cite \textit{O. H. Ibarra} and \textit{H.-C. Yen}, Theor. Comput. Sci. 363, No. 2, 149--161 (2006; Zbl 1153.68019) Full Text: DOI OpenURL
D’Alessandro, Flavio; Intrigila, Benedetto; Varricchio, Stefano On the structure of the counting function of sparse context-free languages. (English) Zbl 1160.68407 Theor. Comput. Sci. 356, No. 1-2, 104-117 (2006). MSC: 68Q45 PDF BibTeX XML Cite \textit{F. D'Alessandro} et al., Theor. Comput. Sci. 356, No. 1--2, 104--117 (2006; Zbl 1160.68407) Full Text: DOI OpenURL
Berstel, Jean; Boasson, Luc; Carton, Olivier; Petazzoni, Bruno; Pin, Jean-Eric Operations preserving regular languages. (English) Zbl 1088.68086 Theor. Comput. Sci. 354, No. 3, 405-420 (2006). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Berstel} et al., Theor. Comput. Sci. 354, No. 3, 405--420 (2006; Zbl 1088.68086) Full Text: DOI OpenURL
Ceccherini-Silberstein, Tullio On the growth of linear languages. (English) Zbl 1084.68060 Adv. Appl. Math. 35, No. 3, 243-253 (2005). MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Ceccherini-Silberstein}, Adv. Appl. Math. 35, No. 3, 243--253 (2005; Zbl 1084.68060) Full Text: DOI OpenURL
Lugiez, Denis; Schnoebelen, Philippe Decidable first-order transition logics for PA-processes. (English) Zbl 1101.68683 Inf. Comput. 203, No. 1, 75-113 (2005). MSC: 68Q60 PDF BibTeX XML Cite \textit{D. Lugiez} and \textit{P. Schnoebelen}, Inf. Comput. 203, No. 1, 75--113 (2005; Zbl 1101.68683) Full Text: DOI Link OpenURL
Domaratzki, Michael; Salomaa, Kai Decidability of trajectory-based equations. (English) Zbl 1079.68049 Theor. Comput. Sci. 345, No. 2-3, 304-330 (2005). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Domaratzki} and \textit{K. Salomaa}, Theor. Comput. Sci. 345, No. 2--3, 304--330 (2005; Zbl 1079.68049) Full Text: DOI OpenURL
Costagliola, Gennaro; Ferrucci, Filomena; Gravino, Carmine Adding symbolic information to picture models: definitions and properties. (English) Zbl 1077.68041 Theor. Comput. Sci. 337, No. 1-3, 51-104 (2005). MSC: 68Q45 03B25 PDF BibTeX XML Cite \textit{G. Costagliola} et al., Theor. Comput. Sci. 337, No. 1--3, 51--104 (2005; Zbl 1077.68041) Full Text: DOI OpenURL
Lugiez, Denis Multitree automata that count. (English) Zbl 1070.68075 Theor. Comput. Sci. 333, No. 1-2, 225-263 (2005). MSC: 68Q45 03D05 PDF BibTeX XML Cite \textit{D. Lugiez}, Theor. Comput. Sci. 333, No. 1--2, 225--263 (2005; Zbl 1070.68075) Full Text: DOI OpenURL
Ito, Masami; Martín-Vide, Carlos; Mitrana, Victor Chomsky-Schützenberger type characterizations of poly-slender and Parikh slender context-free languages. (English) Zbl 1263.68099 Moss, Lawrence S. (ed.) et al., Proceedings of the joint meeting of the 6th conference on formal grammar and the 7th conference on mathematics of language, Helsinki, Finland, August 10–12, 2001. Proceedings. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 53, 137-145 (2004). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{M. Ito} et al., Electron. Notes Theor. Comput. Sci. 53, 137--145 (2004; Zbl 1263.68099) Full Text: DOI OpenURL
Hoogeboom, Hendrik Jan; Kosters, Walter A. Tetris and decidability. (English) Zbl 1178.68258 Inf. Process. Lett. 89, No. 6, 267-272 (2004). MSC: 68Q05 PDF BibTeX XML Cite \textit{H. J. Hoogeboom} and \textit{W. A. Kosters}, Inf. Process. Lett. 89, No. 6, 267--272 (2004; Zbl 1178.68258) Full Text: DOI OpenURL
Dassow, Jürgen; Mitrana, Victor; Păun, Gheorghe; Stiebe, Ralf On differentiation functions, structure functions, and related languages of context-free grammars. (English) Zbl 1082.68049 Theor. Inform. Appl. 38, No. 3, 257-267 (2004). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{J. Dassow} et al., Theor. Inform. Appl. 38, No. 3, 257--267 (2004; Zbl 1082.68049) Full Text: DOI Numdam EuDML Link OpenURL
Finkel, Alain; Iyer, S. Purushothaman; Sutre, Grégoire Well-abstracted transition systems: Application to FIFO automata. (English) Zbl 1054.68092 Inf. Comput. 181, No. 1, 1-31 (2003). MSC: 68Q85 68Q45 PDF BibTeX XML Cite \textit{A. Finkel} et al., Inf. Comput. 181, No. 1, 1--31 (2003; Zbl 1054.68092) Full Text: DOI OpenURL
Finkel, Olivier Borel hierarchy and omega context free languages. (English) Zbl 1051.68094 Theor. Comput. Sci. 290, No. 3, 1385-1405 (2003). MSC: 68Q45 03D05 03E15 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Comput. Sci. 290, No. 3, 1385--1405 (2003; Zbl 1051.68094) Full Text: DOI OpenURL
Finkel, Olivier Ambiguity in omega context free languages. (English) Zbl 1023.68061 Theor. Comput. Sci. 301, No. 1-3, 217-270 (2003). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Comput. Sci. 301, No. 1--3, 217--270 (2003; Zbl 1023.68061) Full Text: DOI OpenURL
Finkel, Olivier On omega context free languages which are Borel sets of infinite rank. (English) Zbl 1051.68093 Theor. Comput. Sci. 299, No. 1-3, 327-346 (2003). MSC: 68Q45 03D05 03E15 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Comput. Sci. 299, No. 1--3, 327--346 (2003; Zbl 1051.68093) Full Text: DOI OpenURL
Harju, Tero; Ibarra, Oscar; Karhumäki, Juhani; Salomaa, Arto Some decision problems concerning semilinearity and commutation. (English) Zbl 1059.68061 J. Comput. Syst. Sci. 65, No. 2, 278-294 (2002). MSC: 68Q45 68R15 PDF BibTeX XML Cite \textit{T. Harju} et al., J. Comput. Syst. Sci. 65, No. 2, 278--294 (2002; Zbl 1059.68061) Full Text: DOI OpenURL
Dams, Dennis; Lakhnech, Yassine; Steffen, Martin Iterating transducers. (English) Zbl 1008.68062 J. Log. Algebr. Program. 52-53, 109-127 (2002). MSC: 68Q42 PDF BibTeX XML Cite \textit{D. Dams} et al., J. Log. Algebr. Program. 52--53, 109--127 (2002; Zbl 1008.68062) Full Text: DOI OpenURL
Aceto, Luca; Ésik, Zoltán; Ingólfsdóttir, Anna A fully equational proof of Parikh’s theorem. (English) Zbl 1024.68070 Theor. Inform. Appl. 36, No. 2, 129-153 (2002). Reviewer: Magnus Steinby (Turku) MSC: 68Q70 03C05 16Y60 PDF BibTeX XML Cite \textit{L. Aceto} et al., Theor. Inform. Appl. 36, No. 2, 129--153 (2002; Zbl 1024.68070) Full Text: DOI Numdam EuDML OpenURL
Schwer, Sylviane R. S-arrangements with repetitions. (S-arrangements avec répétitions.) (French. Abridged English version) Zbl 0997.05004 C. R., Math., Acad. Sci. Paris 334, No. 4, 261-266 (2002). MSC: 05A05 05A15 68Q45 68R15 PDF BibTeX XML Cite \textit{S. R. Schwer}, C. R., Math., Acad. Sci. Paris 334, No. 4, 261--266 (2002; Zbl 0997.05004) Full Text: DOI OpenURL
Finkel, Olivier Wadge hierarchy of omega context-free languages. (English) Zbl 0992.68127 Theor. Comput. Sci. 269, No. 1-2, 283-315 (2001). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Comput. Sci. 269, No. 1--2, 283--315 (2001; Zbl 0992.68127) Full Text: DOI OpenURL
Finkel, O. Topological properties of omega context-free languages. (English) Zbl 0992.68125 Theor. Comput. Sci. 262, No. 1-2, 669-697 (2001). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Comput. Sci. 262, No. 1--2, 669--697 (2001; Zbl 0992.68125) Full Text: DOI OpenURL
Honkala, J. On Parikh slender context-free languages. (English) Zbl 0974.68098 Theor. Comput. Sci. 255, No. 1-2, 667-677 (2001). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Honkala}, Theor. Comput. Sci. 255, No. 1--2, 667--677 (2001; Zbl 0974.68098) Full Text: DOI OpenURL
Finkel, O. Locally finite languages. (English) Zbl 0974.68096 Theor. Comput. Sci. 255, No. 1-2, 223-261 (2001). MSC: 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, Theor. Comput. Sci. 255, No. 1--2, 223--261 (2001; Zbl 0974.68096) Full Text: DOI OpenURL
Ilie, Lucian On lengths of words in context-free languages. (English) Zbl 0944.68099 Theor. Comput. Sci. 242, No. 1-2, 327-359 (2000). MSC: 68Q45 03D05 PDF BibTeX XML Cite \textit{L. Ilie}, Theor. Comput. Sci. 242, No. 1--2, 327--359 (2000; Zbl 0944.68099) Full Text: DOI OpenURL
Honkala, Juha On \(N\)-algebraic power series having polynomial growths. (English) Zbl 0997.16031 Commun. Algebra 28, No. 7, 3253-3264 (2000). Reviewer: Corina Mohorianu (Iaşi) MSC: 16W60 68Q70 68Q45 PDF BibTeX XML Cite \textit{J. Honkala}, Commun. Algebra 28, No. 7, 3253--3264 (2000; Zbl 0997.16031) Full Text: DOI OpenURL
Sugimoto, Noriko; Ishizaka, Hiroki Generating languages by a derivation procedure for elementary formal systems. (English) Zbl 1338.68162 Inf. Process. Lett. 69, No. 4, 161-166 (1999). MSC: 68Q45 PDF BibTeX XML Cite \textit{N. Sugimoto} and \textit{H. Ishizaka}, Inf. Process. Lett. 69, No. 4, 161--166 (1999; Zbl 1338.68162) Full Text: DOI Link OpenURL
Martin-Vide, C.; Mateescu, A.; Rozenberg, G.; Salomaa, A. Contexts on trajectories. (English) Zbl 0937.68083 Int. J. Comput. Math. 73, No. 1, 15-36 (1999). MSC: 68Q45 68Q42 PDF BibTeX XML Cite \textit{C. Martin-Vide} et al., Int. J. Comput. Math. 73, No. 1, 15--36 (1999; Zbl 0937.68083) Full Text: DOI OpenURL
Honkala, Juha On the equivalence problem of context-free and DT0L languages. (English) Zbl 0937.68081 Discrete Appl. Math. 98, No. 1-2, 147-149 (1999). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Honkala}, Discrete Appl. Math. 98, No. 1--2, 147--149 (1999; Zbl 0937.68081) Full Text: DOI OpenURL
Harju, Tero; Ilie, Lucian On quasi orders of words and the confluence property. (English) Zbl 0915.68104 Theor. Comput. Sci. 200, No. 1-2, 205-224 (1998). MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Harju} and \textit{L. Ilie}, Theor. Comput. Sci. 200, No. 1--2, 205--224 (1998; Zbl 0915.68104) Full Text: DOI OpenURL
Sakarovitch, Jacques A construction on finite automata that has remained hidden. (English) Zbl 0913.68137 Theor. Comput. Sci. 204, No. 1-2, 205-231 (1998). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Sakarovitch}, Theor. Comput. Sci. 204, No. 1--2, 205--231 (1998; Zbl 0913.68137) Full Text: DOI OpenURL
Păun, Gheorghe; Rozenberg, Grzegorz Sticker systems. (English) Zbl 0908.68058 Theor. Comput. Sci. 204, No. 1-2, 183-203 (1998). MSC: 68Q05 PDF BibTeX XML Cite \textit{G. Păun} and \textit{G. Rozenberg}, Theor. Comput. Sci. 204, No. 1--2, 183--203 (1998; Zbl 0908.68058) Full Text: DOI OpenURL
Kortelainen, Juha Remarks about commutative context-free languages. (English) Zbl 0914.68119 J. Comput. Syst. Sci. 56, No. 1, 125-129 (1998). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Kortelainen}, J. Comput. Syst. Sci. 56, No. 1, 125--129 (1998; Zbl 0914.68119) Full Text: DOI Link OpenURL
Ramos-Jiménez, G.; López-Muñoz, J.; Morales-Bueno, R. Comparisons of Parikh’s condition to other conditions for context-free languages. (English) Zbl 0902.68101 Theor. Comput. Sci. 202, No. 1-2, 231-244 (1998). MSC: 68Q45 PDF BibTeX XML Cite \textit{G. Ramos-Jiménez} et al., Theor. Comput. Sci. 202, No. 1--2, 231--244 (1998; Zbl 0902.68101) Full Text: DOI OpenURL
Mateescu, Alexandru; Rozenberg, Grzegorz; Salomaa, Arto Shuffle on trajectories: Syntactic constraints. (English) Zbl 0902.68096 Theor. Comput. Sci. 197, No. 1-2, 1-56 (1998). MSC: 68Q45 68Q10 PDF BibTeX XML Cite \textit{A. Mateescu} et al., Theor. Comput. Sci. 197, No. 1--2, 1--56 (1998; Zbl 0902.68096) Full Text: DOI OpenURL
Honkala, Juha A decision method for Parikh slenderness of context-free languages. (English) Zbl 0865.68072 Discrete Appl. Math. 73, No. 1, 1-4 (1997). MSC: 68Q45 PDF BibTeX XML Cite \textit{J. Honkala}, Discrete Appl. Math. 73, No. 1, 1--4 (1997; Zbl 0865.68072) Full Text: DOI Link OpenURL
Lisovik, L. P. Equivalence problems for transducers with a bounded number of states. (English. Russian original) Zbl 0919.68079 Cybern. Syst. Anal. 33, No. 6, 840-844 (1997); translation from Kibern. Sist. Anal. 1998, No. 109-114 (1997). MSC: 68Q45 PDF BibTeX XML Cite \textit{L. P. Lisovik}, Cybern. Syst. Anal. 33, No. 6, 840--844 (1997; Zbl 0919.68079); translation from Kibern. Sist. Anal. 1998, No. 109--114 (1997) Full Text: DOI OpenURL
Raz, Danny Length considerations in context-free languages. (English) Zbl 0911.68097 Theor. Comput. Sci. 183, No. 1, 21-32 (1997). MSC: 68Q45 PDF BibTeX XML Cite \textit{D. Raz}, Theor. Comput. Sci. 183, No. 1, 21--32 (1997; Zbl 0911.68097) Full Text: DOI OpenURL
Dassow, Jürgen; Mitrana, Victor Cooperation in context-free grammars. (English) Zbl 0901.68101 Theor. Comput. Sci. 180, No. 1-2, 353-361 (1997). MSC: 68Q42 PDF BibTeX XML Cite \textit{J. Dassow} and \textit{V. Mitrana}, Theor. Comput. Sci. 180, No. 1--2, 353--361 (1997; Zbl 0901.68101) Full Text: DOI OpenURL
Dumitrescu, S.; Păun, G. On the power of parallel communicating grammar systems with right-linear components. (English) Zbl 0892.68058 RAIRO, Inform. Théor. Appl. 31, No. 4, 331-354 (1997). MSC: 68Q42 PDF BibTeX XML Cite \textit{S. Dumitrescu} and \textit{G. Păun}, RAIRO, Inform. Théor. Appl. 31, No. 4, 331--354 (1997; Zbl 0892.68058) Full Text: DOI EuDML OpenURL
Stilman, B. Network languages for concurrent multiagent systems. (English) Zbl 0879.68102 Comput. Math. Appl. 34, No. 1, 103-136 (1997). MSC: 68T99 PDF BibTeX XML Cite \textit{B. Stilman}, Comput. Math. Appl. 34, No. 1, 103--136 (1997; Zbl 0879.68102) Full Text: DOI OpenURL
Petersen, H. On the language of primitive words. (English) Zbl 0872.68091 Theor. Comput. Sci. 161, No. 1-2, 141-156 (1996). MSC: 68Q45 PDF BibTeX XML Cite \textit{H. Petersen}, Theor. Comput. Sci. 161, No. 1--2, 141--156 (1996; Zbl 0872.68091) Full Text: DOI OpenURL