Terrier, Véronique Communication complexity tools on recognizable picture languages. (English) Zbl 1434.68290 Theor. Comput. Sci. 795, 194-203 (2019). MSC: 68Q45 68Q11 PDF BibTeX XML Cite \textit{V. Terrier}, Theor. Comput. Sci. 795, 194--203 (2019; Zbl 1434.68290) Full Text: DOI
Caron, Pascal; Flouret, Marianne; Mignot, Ludovic \((k,l)\)-unambiguity and quasi-deterministic structures. (English) Zbl 1439.68012 J. Autom. Lang. Comb. 24, No. 1, 13-49 (2019). Reviewer: Andreas Maletti (Leipzig) MSC: 68Q45 PDF BibTeX XML Cite \textit{P. Caron} et al., J. Autom. Lang. Comb. 24, No. 1, 13--49 (2019; Zbl 1439.68012) Full Text: DOI
Dave, Vrunda; Gastin, Paul; Krishna, Shankara Narayanan Regular transducer expressions for regular transformations. (English) Zbl 07298756 Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-5583-4). 315-324 (2018). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Dave} et al., in: Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9--12, 2018. New York, NY: Association for Computing Machinery (ACM). 315--324 (2018; Zbl 07298756) Full Text: DOI
Michalewski, Henryk; Skrzypczak, Michał On the strength of unambiguous tree automata. (English) Zbl 1403.68119 Int. J. Found. Comput. Sci. 29, No. 5, 911-933 (2018). MSC: 68Q45 PDF BibTeX XML Cite \textit{H. Michalewski} and \textit{M. Skrzypczak}, Int. J. Found. Comput. Sci. 29, No. 5, 911--933 (2018; Zbl 1403.68119) Full Text: DOI
Paul, Erik The equivalence, unambiguity and sequentiality problems of finitely ambiguous max-plus tree automata are decidable. (English) Zbl 1441.68128 Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 53, 13 p. (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{E. Paul}, LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 53, 13 p. (2017; Zbl 1441.68128) Full Text: DOI
Göös, Mika; Pitassi, Toniann; Watson, Thomas Zero-information protocols and unambiguity in Arthur-Merlin communication. (English) Zbl 1352.94004 Algorithmica 76, No. 3, 684-719 (2016). MSC: 94A05 68Q15 68Q17 68M12 PDF BibTeX XML Cite \textit{M. Göös} et al., Algorithmica 76, No. 3, 684--719 (2016; Zbl 1352.94004) Full Text: DOI
Michalewski, Henryk; Skrzypczak, Michał Unambiguous Büchi is weak. (English) Zbl 1436.68181 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, 319-331 (2016). MSC: 68Q45 PDF BibTeX XML Cite \textit{H. Michalewski} and \textit{M. Skrzypczak}, Lect. Notes Comput. Sci. 9840, 319--331 (2016; Zbl 1436.68181) Full Text: DOI
Duparc, Jacques; Fournier, Kevin; Hummel, Szczepan On unambiguous regular tree languages of index \((0,2)\). (English) Zbl 1434.03101 Kreutzer, Stephan (ed.), 24th EACSL annual conference and 29th workshop on computer science logic, CSL’15, Berlin, Germany, September 7–10, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 41, 534-548 (2015). MSC: 03D05 68Q45 PDF BibTeX XML Cite \textit{J. Duparc} et al., LIPIcs -- Leibniz Int. Proc. Inform. 41, 534--548 (2015; Zbl 1434.03101) Full Text: DOI
Carnino, Vincent; Lombardy, Sylvain On determinism and unambiguity of weighted two-way automata. (English) Zbl 1338.68142 Int. J. Found. Comput. Sci. 26, No. 8, 1127-1146 (2015). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{V. Carnino} and \textit{S. Lombardy}, Int. J. Found. Comput. Sci. 26, No. 8, 1127--1146 (2015; Zbl 1338.68142) Full Text: DOI
Okhotin, Alexander; Salomaa, Kai Descriptional complexity of unambiguous input-driven pushdown automata. (English) Zbl 1318.68111 Theor. Comput. Sci. 566, 1-11 (2015). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Okhotin} and \textit{K. Salomaa}, Theor. Comput. Sci. 566, 1--11 (2015; Zbl 1318.68111) Full Text: DOI
Cadilhac, Michaël; Finkel, Alain; McKenzie, Pierre Unambiguous constrained automata. (English) Zbl 1293.68182 Int. J. Found. Comput. Sci. 24, No. 7, 1099-1166 (2013). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Cadilhac} et al., Int. J. Found. Comput. Sci. 24, No. 7, 1099--1166 (2013; Zbl 1293.68182) Full Text: DOI
Hovland, Dag The inclusion problem for regular expressions. (English) Zbl 1250.68162 J. Comput. Syst. Sci. 78, No. 6, 1795-1813 (2012). MSC: 68Q45 68Q17 68W40 PDF BibTeX XML Cite \textit{D. Hovland}, J. Comput. Syst. Sci. 78, No. 6, 1795--1813 (2012; Zbl 1250.68162) Full Text: DOI
Cadilhac, Michaël; Finkel, Alain; McKenzie, Pierre Unambiguous constrained automata. (English) Zbl 1370.68161 Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 239-250 (2012). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Cadilhac} et al., Lect. Notes Comput. Sci. 7410, 239--250 (2012; Zbl 1370.68161) Full Text: DOI
Colcombet, Thomas Forms of determinism for automata. (English) Zbl 1245.68123 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 1-23, electronic only (2012). MSC: 68Q45 PDF BibTeX XML Cite \textit{T. Colcombet}, LIPIcs -- Leibniz Int. Proc. Inform. 14, 1--23 (2012; Zbl 1245.68123) Full Text: DOI
Herman, Grzegorz; Soltys, Michael Unambiguous functions in logarithmic space. (English) Zbl 1279.68079 Fundam. Inform. 114, No. 2, 129-147 (2012). MSC: 68Q05 68Q10 68Q25 68R10 PDF BibTeX XML Cite \textit{G. Herman} and \textit{M. Soltys}, Fundam. Inform. 114, No. 2, 129--147 (2012; Zbl 1279.68079) Full Text: Link
Lonati, Violetta; Pradella, Matteo Deterministic recognizability of picture languages with Wang automata. (English) Zbl 1286.68291 Discrete Math. Theor. Comput. Sci. 12, No. 4, 73-94 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Lonati} and \textit{M. Pradella}, Discrete Math. Theor. Comput. Sci. 12, No. 4, 73--94 (2010; Zbl 1286.68291) Full Text: Link
Finkel, Olivier Decision problems for recognizable languages of infinite pictures. (English) Zbl 1244.03052 Cégielski, Patrick (ed.), Studies in weak arithmetics. Stanford, CA: CSLI Publications; Créteil: Presses Universitaires du Pôle de Recherche et d’Enseignement Supérieur Paris-Est (ISBN 978-1-57586-602-4/pbk). CSLI Lecture Notes 196, 127-151 (2010). MSC: 03B25 03D05 03E15 03E35 68Q45 PDF BibTeX XML Cite \textit{O. Finkel}, CSLI Lect. Notes 196, 127--151 (2010; Zbl 1244.03052)
Anselmo, Marcella; Madonia, Maria Classes of two-dimensional languages and recognizability conditions. (English) Zbl 1211.68230 RAIRO, Theor. Inform. Appl. 44, No. 4, 471-488 (2010). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{M. Anselmo} and \textit{M. Madonia}, RAIRO, Theor. Inform. Appl. 44, No. 4, 471--488 (2010; Zbl 1211.68230) Full Text: DOI EuDML
Giammarresi, Dora A brief excursion inside the class of tiling recognizable two-dimensional languages. (English) Zbl 1250.68159 Gao, Yuan (ed.) et al., Developments in language theory. 14th international conference, DLT 2010, London, ON, Canada, August 17–20, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14454-7/pbk). Lecture Notes in Computer Science 6224, 4-15 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{D. Giammarresi}, Lect. Notes Comput. Sci. 6224, 4--15 (2010; Zbl 1250.68159) Full Text: DOI
Schneider, Johannes C. Unambiguous erasing morphisms in free monoids. (English) Zbl 1203.68132 RAIRO, Theor. Inform. Appl. 44, No. 2, 193-208 (2010). MSC: 68R15 68Q25 PDF BibTeX XML Cite \textit{J. C. Schneider}, RAIRO, Theor. Inform. Appl. 44, No. 2, 193--208 (2010; Zbl 1203.68132) Full Text: DOI EuDML
Anselmo, Marcella; Giammarresi, Dora; Madonia, Maria Deterministic and unambiguous families within recognizable two-dimensional languages. (English) Zbl 1196.68117 Fundam. Inform. 98, No. 2-3, 143-166 (2010). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Anselmo} et al., Fundam. Inform. 98, No. 2--3, 143--166 (2010; Zbl 1196.68117) Full Text: DOI
Salomaa, Arto; Yu, Sheng Subword occurrences, Parikh matrices and Lyndon images. (English) Zbl 1187.68300 Int. J. Found. Comput. Sci. 21, No. 1, 91-111 (2010). MSC: 68Q45 03D05 68R15 PDF BibTeX XML Cite \textit{A. Salomaa} and \textit{S. Yu}, Int. J. Found. Comput. Sci. 21, No. 1, 91--111 (2010; Zbl 1187.68300) Full Text: DOI
Anselmo, Marcella; Madonia, Maria A note on unambiguity, finite ambiguity and complementation in recognizable two-dimensional languages. (English) Zbl 1256.68095 Bozapalidis, Symeon (ed.) et al., Algebraic informatics. Third international conference, CAI 2009, Thessaloniki, Greece, May 19–22, 2009, Proceedings. Berlin: Springer (ISBN 978-3-642-03563-0/pbk). Lecture Notes in Computer Science 5725, 147-159 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Anselmo} and \textit{M. Madonia}, Lect. Notes Comput. Sci. 5725, 147--159 (2009; Zbl 1256.68095) Full Text: DOI
Lonati, Violetta; Pradella, Matteo Snake-deterministic tiling systems. (English) Zbl 1250.68168 Královič, Rastislav (ed.) et al., Mathematical foundations of computer science 2009. 34th international symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24–28, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03815-0/pbk). Lecture Notes in Computer Science 5734, 549-560 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Lonati} and \textit{M. Pradella}, Lect. Notes Comput. Sci. 5734, 549--560 (2009; Zbl 1250.68168) Full Text: DOI
Anselmo, Marcella; Madonia, Maria Deterministic and unambiguous two-dimensional languages over one-letter alphabet. (English) Zbl 1162.68020 Theor. Comput. Sci. 410, No. 16, 1477-1485 (2009). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Anselmo} and \textit{M. Madonia}, Theor. Comput. Sci. 410, No. 16, 1477--1485 (2009; Zbl 1162.68020) Full Text: DOI
Mäurer, Ina Characterizations of recognizable picture series. (English) Zbl 1164.68016 Theor. Comput. Sci. 374, No. 1-3, 214-228 (2007). MSC: 68Q45 68Q70 PDF BibTeX XML Cite \textit{I. Mäurer}, Theor. Comput. Sci. 374, No. 1--3, 214--228 (2007; Zbl 1164.68016) Full Text: DOI
Giammarresi, Dora Tiling recognizable two-dimensional languages. (English) Zbl 1148.68400 Bozapalidis, Symeon (ed.) et al., Algebraic informatics. Second international conference, CAI 2007, Thessaloniki, Greece, May 21–25, 2007. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-540-75413-8/pbk). Lecture Notes in Computer Science 4728, 75-86 (2007). MSC: 68Q45 PDF BibTeX XML Cite \textit{D. Giammarresi}, Lect. Notes Comput. Sci. 4728, 75--86 (2007; Zbl 1148.68400) Full Text: DOI
Anselmo, Marcella; Giammarresi, Dora; Madonia, Maria From determinism to non-determinism in recognizable two-dimensional languages. (English) Zbl 1202.68218 Harju, Tero (ed.) et al., Developments in language theory. 11th international conference, DLT 2007, Turku, Finland, July 3–6, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73207-5/pbk). Lecture Notes in Computer Science 4588, 36-47 (2007). MSC: 68Q45 PDF BibTeX XML Cite \textit{M. Anselmo} et al., Lect. Notes Comput. Sci. 4588, 36--47 (2007; Zbl 1202.68218) Full Text: DOI
Kilpeläinen, Pekka; Tuhkanen, Rauno One-unambiguity of regular expressions with numeric occurrence indicators. (English) Zbl 1118.68079 Inf. Comput. 205, No. 6, 890-916 (2007). MSC: 68Q45 68P05 PDF BibTeX XML Cite \textit{P. Kilpeläinen} and \textit{R. Tuhkanen}, Inf. Comput. 205, No. 6, 890--916 (2007; Zbl 1118.68079) Full Text: DOI
Wybraniec-Skardowska, Urszula Meaning and interpretation. I. (English) Zbl 1117.03014 Stud. Log. 85, No. 1, 105-132 (2007). MSC: 03A05 03B65 PDF BibTeX XML Cite \textit{U. Wybraniec-Skardowska}, Stud. Log. 85, No. 1, 105--132 (2007; Zbl 1117.03014) Full Text: DOI
Anselmo, Marcella; Giammarresi, Dora; Madonia, Maria; Restivo, Antonio Unambiguous recognizable two-dimensional languages. (English) Zbl 1112.68085 Theor. Inform. Appl. 40, No. 2, 277-293 (2006). MSC: 68Q45 68Q10 PDF BibTeX XML Cite \textit{M. Anselmo} et al., Theor. Inform. Appl. 40, No. 2, 277--293 (2006; Zbl 1112.68085) Full Text: DOI Numdam EuDML
Andrei, Ştefan; Chin, Wei-Ngan; Grigoras, Gheorghe Co-determinism and unambiguity of automata accepting finite or infinite words. (English) Zbl 1343.68131 An. Ştiinţ. Univ. Al. I. Cuza Iaşi, Ser. Nouă, Inf. 14, 1-11 (2004). MSC: 68Q45 PDF BibTeX XML Cite \textit{Ş. Andrei} et al., An. Ştiinţ. Univ. Al. I. Cuza Iaşi, Ser. Nouă, Inf. 14, 1--11 (2004; Zbl 1343.68131)
Klimann, Ines; Lombardy, Sylvain; Mairesse, Jean; Prieur, Christophe Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. (English) Zbl 1071.68035 Theor. Comput. Sci. 327, No. 3, 349-373 (2004). MSC: 68Q42 68Q45 PDF BibTeX XML Cite \textit{I. Klimann} et al., Theor. Comput. Sci. 327, No. 3, 349--373 (2004; Zbl 1071.68035) Full Text: DOI
Carton, Olivier; Michel, Max Unambiguous Büchi automata. (English) Zbl 0957.03047 Gonnet, Gastón H. (ed.) et al., LATIN 2000: Theoretical informatics. 4th Latin American symposium, Punta del Este, Uruguay, April 10-14, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1776, 407-416 (2000). MSC: 03D05 68Q45 PDF BibTeX XML Cite \textit{O. Carton} and \textit{M. Michel}, Lect. Notes Comput. Sci. 1776, 407--416 (2000; Zbl 0957.03047)
Brüggemann-Klein, Anne; Wood, Derick One-unambiguous regular languages. (English) Zbl 0912.68112 Inf. Comput. 142, No. 2, 182-206 (1998). MSC: 68Q45 PDF BibTeX XML Cite \textit{A. Brüggemann-Klein} and \textit{D. Wood}, Inf. Comput. 142, No. 2, 182--206 (1998; Zbl 0912.68112) Full Text: DOI
Niedermeier, Rolf; Rossmanith, Peter Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits. (English) Zbl 0826.68080 Inf. Comput. 118, No. 2, 227-245 (1995). MSC: 68Q45 68Q05 68Q15 PDF BibTeX XML Cite \textit{R. Niedermeier} and \textit{P. Rossmanith}, Inf. Comput. 118, No. 2, 227--245 (1995; Zbl 0826.68080) Full Text: DOI
Allen, Dennis jun. A structure theory for finite regular semigroups. (English) Zbl 0799.20056 Rhodes, John (ed.), Monoids and semigroups with applications. Proceedings of the Berkeley workshop on monoids, Berkeley, CA, USA, 31 July - 5 August 1989. Singapore etc.: World Scientific Publishing. 403-423 (1991). MSC: 20M17 20M10 20M15 PDF BibTeX XML Cite \textit{D. Allen jun.}, in: Monoids and semigroups with applications. Proceedings of the Berkeley workshop in monoids, Berkeley, CA, USA, 31 July - 5 August 1989. Singapore etc.: World Scientific Publishing. 403--423 (1991; Zbl 0799.20056)
Lange, Klaus-Jörn; Rossmanith, Peter Characterizing unambiguous augmented pushdown automata by circuits. (English) Zbl 0731.68038 Mathematical foundations of computer science, Proc. 15th Symp., MFCS ’90, Banská Bystrica/Czech. 1990, Lect. Notes Comput. Sci. 452, 399-406 (1990). MSC: 68Q15 68Q10 PDF BibTeX XML
Head, Tom One-dimensional cellular automata: Injectivity from unambiguity. (English) Zbl 0725.68076 Complex Syst. 3, No. 4, 343-348 (1989). MSC: 68Q80 68R10 68Q45 PDF BibTeX XML Cite \textit{T. Head}, Complex Syst. 3, No. 4, 343--348 (1989; Zbl 0725.68076)
Biskup, Joachim; Brüggemann, Hans Hermann Data manipulation languages for the universal relation view DURST. (English) Zbl 0648.68112 Mathematical fundamentals of database systems, 1st Symp. MFDBS, Dresden/GDR 1987, Lect. Notes Comput. Sci. 305, 20-41 (1988). MSC: 68P20 68Q55 PDF BibTeX XML
Mohan, Chilukuri K.; Srivas, Mandayam K. Function definitions in term rewriting and applicative programming. (English) Zbl 0629.68033 Inf. Control 71, 186-217 (1986). MSC: 68Q65 68N01 PDF BibTeX XML Cite \textit{C. K. Mohan} and \textit{M. K. Srivas}, Inf. Control 71, 186--217 (1986; Zbl 0629.68033) Full Text: DOI
Perrin, Dominique Recent results on automata and infinite words. (English) Zbl 0577.68076 Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 134-148 (1984). MSC: 68Q45 PDF BibTeX XML
Hoffmann, Berthold Modelling compiler generation by graph grammars. (English) Zbl 0522.68073 Graph-grammars and their application to computer science, 2nd int. Workshop, Haus Ohrbeck/Ger. 1982, Lect. Notes Comput. Sci. 153, 159-171 (1983). MSC: 68Q45 PDF BibTeX XML
Sebesta, Robert W.; Jones, Neil D. Parsers for indexed grammars. (English) Zbl 0402.68059 Int. J. Comput. Inform. Sci. 7, 345-359 (1978). MSC: 68N20 68Q45 PDF BibTeX XML Cite \textit{R. W. Sebesta} and \textit{N. D. Jones}, Int. J. Comput. Inform. Sci. 7, 345--359 (1978; Zbl 0402.68059) Full Text: DOI