×

Found 262 Documents (Results 1–100)

100
MathJax

Generalized forbidding matrix grammars and their membrane computing perspective. (English) Zbl 07437061

Freund, Rudolf (ed.) et al., Membrane computing. 21st international conference, CMC 2020, virtual event, September 14–18, 2020. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12687, 31-45 (2021).
MSC:  68Q07
PDF BibTeX XML Cite
Full Text: DOI

Usefulness of information and unary languages. (English) Zbl 07405983

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 131-142 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

On the transformation of two-way deterministic finite automata to unambiguous finite automata. (English) Zbl 07405979

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 15th international conference, LATA 2021, Milan, Italy, March 1–5, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12638, 81-93 (2021).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

On the power of generalized forbidding insertion-deletion systems. (English) Zbl 07371289

Jirásková, Galina (ed.) et al., Descriptional complexity of formal systems. 22nd international conference, DCFS 2020, Vienna, Austria, August 24–26, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12442, 52-63 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

New results on semilinear sets and variants of jumping finite automata. (English) Zbl 1471.68003

Berlin: Logos Verlag; Gießen: Univ. Gießen, Fachbereich Mathematik und Informatik, Physik, Geographie (Diss.) (ISBN 978-3-8325-5210-7/pbk). xi, 232 p. (2020).
MSC:  68-02 68Q45 68Q70
PDF BibTeX XML Cite

Descriptional complexity of matrix simple semi-conditional grammars. (English) Zbl 1434.68219

Hospodár, Michal (ed.) et al., Descriptional complexity of formal systems. 21st IFIP WG 1.02 international conference, DCFS 2019, Košice, Slovakia, July 17–19, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11612, 111-123 (2019).
MSC:  68Q42
PDF BibTeX XML Cite
Full Text: DOI

Improved descriptional complexity results on generalized forbidding grammars. (English) Zbl 07115814

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 174-188 (2019).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI

A look at the descriptional complexity of \(\mathrm{SNQ}\) \(\mathrm{P}\) systems. (English) Zbl 07002235

Graciani, Carmen (ed.) et al., Enjoying natural computing. Essays dedicated to Mario de Jesús Pérez-Jiménez on the occasion of his 70th birthday. Cham: Springer. Lect. Notes Comput. Sci. 11270, 228-236 (2018).
MSC:  68Q05 68Q10
PDF BibTeX XML Cite
Full Text: DOI

Minimizing rules and nonterminals in semi-conditional grammars: non-trivial for the simple case. (English) Zbl 06894484

Durand-Lose, Jérôme (ed.) et al., Machines, computations, and universality. 8th international conference, MCU 2018, Fontainebleau, France, June 28–30, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10881, 88-104 (2018).
MSC:  68Q42
PDF BibTeX XML Cite
Full Text: DOI

A logic for document spanners. (English) Zbl 1402.68047

Benedikt, Michael (ed.) et al., 20th international conference on database theory, ICDT 2017, Venice, Italy, March 21–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-024-8). LIPIcs – Leibniz International Proceedings in Informatics 68, Article 13, 18 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Graph-controlled insertion-deletion systems generating language classes beyond linearity. (English) Zbl 1410.68186

Pighizzini, Giovanni (ed.) et al., Descriptional complexity of formal systems. 19th IFIP WG 1.02 international conference, DCFS 2017, Milano, Italy, July 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10316, 128-139 (2017).
MSC:  68Q42 68Q45
PDF BibTeX XML Cite
Full Text: DOI Link

Computational completeness of path-structured graph-controlled insertion-deletion systems. (English) Zbl 1410.68185

Carayol, Arnaud (ed.) et al., Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27–30, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10329, 89-100 (2017).
MSC:  68Q42
PDF BibTeX XML Cite
Full Text: DOI

Document spanners: from expressive power to decision problems. (English) Zbl 1369.68182

Martens, Wim (ed.) et al., 19th international conference on database theory, ICDT ’16, Bordeaux, France, March 15–18, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-002-6). LIPIcs – Leibniz International Proceedings in Informatics 48, Article 17, 16 p. (2016).
MSC:  68P15 68P20 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Complexity of sets of two-dimensional patterns. (English) Zbl 1379.68229

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 (ISBN 978-3-319-40945-0/pbk; 978-3-319-40946-7/ebook). Lecture Notes in Computer Science 9705, 236-247 (2016).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Descriptional complexity of graph-controlled insertion-deletion systems. (English) Zbl 1410.68184

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, 111-125 (2016).
MSC:  68Q42 68Q45
PDF BibTeX XML Cite
Full Text: DOI Link

On the effects of nondeterminism on ordered restarting automata. (English) Zbl 1442.68095

Freivalds, Rūsiņš Mārtiņš (ed.) et al., SOFSEM 2016: theory and practice of computer science. 42nd international conference on current trends in theory and practice of computer science, Harrachov, Czech Republic, January 23–28, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9587, 369-380 (2016).
MSC:  68Q45 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Finite automata for the sub- and superword closure of CFLs: descriptional and computational complexity. (English) Zbl 1451.68142

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 9th international conference, LATA 2015, Nice, France, March 2–6, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8977, 473-485 (2015).
MSC:  68Q45 68Q17 68Q25
PDF BibTeX XML Cite
Full Text: DOI arXiv

On some decision problems for stateless deterministic ordered restarting automata. (English) Zbl 1390.68406

Shallit, Jeffrey (ed.) et al., Descriptional complexity of formal systems. 17th international workshop, DCFS 2015, Waterloo, ON, Canada, June 25–27, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-19224-6/pbk; 978-3-319-19225-3/ebook). Lecture Notes in Computer Science 9118, 165-176 (2015).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Complexity of promise problems on classical and quantum automata. (English) Zbl 1323.68338

Calude, Cristian S. (ed.) et al., Computing with new resources. Essays dedicated to Jozef Gruska on the occasion of his 80th birthday. Cham: Springer (ISBN 978-3-319-13349-2/pbk; 978-3-319-13350-8/ebook). Lecture Notes in Computer Science 8808, 161-175 (2014).
MSC:  68Q45 68Q05
PDF BibTeX XML Cite
Full Text: DOI

On the power of one-way automata with quantum and classical states. (English) Zbl 1302.68150

Holzer, Markus (ed.) et al., Implementation and application of automata. 19th international conference, CIAA 2014, Giessen, Germany, July 30 – August 2, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-08845-7/pbk). Lecture Notes in Computer Science 8587, 84-97 (2014).
MSC:  68Q45 81P68
PDF BibTeX XML Cite
Full Text: DOI

Non-recursive trade-offs between two-dimensional automata and grammars. (English) Zbl 1332.68126

Jürgensen, Helmut (ed.) et al., Descriptional complexity of formal systems. 16th international workshop, DCFS 2014, Turku, Finland, August 5–8, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-09703-9/pbk). Lecture Notes in Computer Science 8614, 352-363 (2014).
MSC:  68Q45 68Q05 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

all top 3

Software