×

Found 906 Documents (Results 1–100)

100
MathJax

Synthesizing context-free grammars from recurrent neural networks. (English) Zbl 1467.68077

Groote, Jan Friso (ed.) et al., Tools and algorithms for the construction and analysis of systems. 27th international conference, TACAS 2021, held as part of the European joint conferences on theory and practice of software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 – April 1, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12651, 351-369 (2021).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Qualitative multi-objective reachability for ordered branching MDPs. (English) Zbl 07368098

Schmitz, Sylvain (ed.) et al., Reachability problems. 14th international conference, RP 2020, Paris, France, October 19–21, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12448, 67-82 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Context-free path querying by Kronecker product. (English) Zbl 1475.68108

Darmont, Jérôme (ed.) et al., Advances in databases and information systems. 24th European conference, ADBIS 2020, Lyon, France, August 25–27, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12245, 49-59 (2020).
MSC:  68P15 68Q42 68R10
PDF BibTeX XML Cite
Full Text: DOI

An improved proof of the closure under homomorphic inverse of FCFL valued in lattice-ordered monoids. (English) Zbl 1452.68110

Sun, Xiaoming (ed.) et al., Theoretical computer science. 37th national conference, NCTCS 2019, Lanzhou, China, August 2–4, 2019. Revised selected papers. Singapore: Springer. Commun. Comput. Inf. Sci. 1069, 64-75 (2019).
MSC:  68Q45 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Context-free grammars for deterministic regular expressions with interleaving. (English) Zbl 07142679

Hierons, Robert Mark (ed.) et al., Theoretical aspects of computing – ICTAC 2019. 16th international colloquium, Hammamet, Tunisia, October 31 – November 4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11884, 235-252 (2019).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Explicit formulas for enumeration of lattice paths: basketball and the kernel method. (English) Zbl 1422.05007

Andrews, George E. (ed.) et al., Lattice path combinatorics and applications. Based on the 8th international conference on lattice path combinatorics and applications, California State Polytechnic University, Pomona (Cal Poly Pomona), CA, USA, August 17–20, 2015. Cham: Springer. Dev. Math. 58, 78-118 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Computing the longest common prefix of a context-free language in polynomial time. (English) Zbl 07228439

Niedermeier, Rolf (ed.) et al., 35th symposium on theoretical aspects of computer science, STACS 2018, Caen, France, February 28 – March 3, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 96, Article 48, 13 p. (2018).
MSC:  68Q45 68Q42 68R15
PDF BibTeX XML Cite
Full Text: DOI arXiv

Languages and grammar. (English) Zbl 1403.68112

Gudivada, Venkat N. (ed.) et al., Computational analysis and understanding of natural languages: principles, methods and applications. Amsterdam: Elsevier/North Holland (ISBN 978-0-444-64042-0/hbk; 978-0-444-64043-7/ebook). Handbook of Statistics 38, 15-29 (2018).
MSC:  68Q45 68Q42 91F20
PDF BibTeX XML Cite
Full Text: DOI

Verification of PCP-related computational reductions in Coq. (English) Zbl 06946984

Avigad, Jeremy (ed.) et al., Interactive theorem proving. 9th international conference, ITP 2018, held as part of the federated logic conference, FloC 2018, Oxford, UK, July 9–12, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10895, 253-269 (2018).
MSC:  68T15
PDF BibTeX XML Cite
Full Text: DOI arXiv

Solutions of twisted word equations, EDT0L languages, and context-free groups. (English) Zbl 1442.68090

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 96, 14 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Approximating language edit distance beyond fast matrix multiplication: ultralinear grammars are where parsing becomes hard! (English) Zbl 1441.68114

Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 19, 15 p. (2017).
PDF BibTeX XML Cite
Full Text: DOI

Representing the suffix tree with the CDAWG. (English) Zbl 1434.68122

Kärkkäinen, Juha (ed.) et al., 28th annual symposium on combinatorial pattern matching. CPM 2017, Warsaw, Poland, July 4–6, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 78, Article 7, 13 p. (2017).
MSC:  68P05 68Q42
PDF BibTeX XML Cite
Full Text: DOI arXiv

Lattice paths with catastrophes. (English) Zbl 1427.05021

Fédou, Jean-Marc (ed.) et al., Random generation of combinatorial structures – GASCom 2016. Proceedings of the 10th GASCom conference, Centre IGESA, La Marana, Corsica, France, June 1 – June 4, 2016. Amsterdam: Elsevier. Electron. Notes Discrete Math. 59, 131-146 (2017).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Context-sensitive data-dependence analysis via linear conjunctive language reachability. (English) Zbl 1380.68262

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 344-358 (2017).
MSC:  68Q45 68N30 68Q42
PDF BibTeX XML Cite
Full Text: DOI

The strong, weak, and very weak finite context and kernel properties. (English) Zbl 1485.68123

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, 77-88 (2017).
MSC:  68Q32 68Q42 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Incompleteness theorems, large cardinals, and automata over finite words. (English) Zbl 1459.03055

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 231-246 (2017).
MSC:  03D05 03E55 03F40
PDF BibTeX XML Cite
Full Text: DOI HAL

Summaries for context-free games. (English) Zbl 1391.68072

Lal, Akash (ed.) et al., 36th IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2016), Chennai, India, December 13–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-027-9). LIPIcs – Leibniz International Proceedings in Informatics 65, Article 41, 16 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Context-free graph properties via definable decompositions. (English) Zbl 1370.03049

Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 17, 16 p. (2016).
MSC:  03C13 03B15 03D05
PDF BibTeX XML Cite
Full Text: DOI

On the mild context-sensitivity of \(k\)-tree wrapping grammar. (English) Zbl 1478.68115

Foret, Annie (ed.) et al., Formal grammar. 20th and 21st international conferences, FG 2015, Barcelona, Spain, August 2015. Revised selected papers. FG 2016, Bozen, Italy, August 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9804, 77-93 (2016).
MSC:  68Q42
PDF BibTeX XML Cite
Full Text: DOI

An approximation algorithm for quadratic dynamic systems based on N. Chomsky’s grammar for Taylor’s formula. (English. Russian original) Zbl 1353.65069

Proc. Steklov Inst. Math. 293, Suppl. 1, S17-S21 (2016); translation from Tr. Inst. Mat. Mekh. (Ekaterinburg) 21, No. 2, 21-25 (2015).
PDF BibTeX XML Cite
Full Text: DOI

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
Full Text: DOI Link

Ogden’s lemma, multiple context-free grammars, and the control language hierarchy. (English) Zbl 1443.68088

Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 10th international conference, LATA 2016, Prague, Czech Republic, March 14–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9618, 371-383 (2016).
MSC:  68Q45 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

all top 3

Software