×

Found 1,439 Documents (Results 1–100)

100
MathJax

Generative program analysis and beyond: the power of domain-specific languages (invited paper). (English) Zbl 1472.68042

Henglein, Fritz (ed.) et al., Verification, model checking, and abstract interpretation. 22nd international conference, VMCAI 2021, Copenhagen, Denmark, January 17–19, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12597, 29-51 (2021).
PDF BibTeX XML Cite
Full Text: DOI

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

A characterization of the context-free languages by stateless ordered restart-delete automata. (English) Zbl 1440.68160

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, 39-50 (2020).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Two-head finite-state acceptors with translucent letters. (English) Zbl 1444.68099

Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 406-418 (2019).
MSC:  68Q45
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

Bar-Hillel theorem mechanization in Coq. (English) Zbl 07176931

Iemhoff, Rosalie (ed.) et al., Logic, language, information, and computation. 26th international workshop, WoLLIC 2019, Utrecht, The Netherlands, July 2–5, 2019. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 11541, 264-281 (2019).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

Enhancement of automata with jumping modes. (English) Zbl 1425.68195

Castillo-Ramirez, Alonso (ed.) et al., Cellular automata and discrete complex systems. 25th IFIP WG 1.5 international workshop, AUTOMATA 2019, Guadalajara, Mexico, June 26–28, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11525, 62-76 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Some applications of the formalization of the pumping lemma for context-free languages. (English) Zbl 1433.68200

Accattoli, Beniamino (ed.) et al., Proceedings of the 13th workshop on logical and semantic frameworks with applications, LSFA 18, Fortaleza, Brazil, September 26–28, 2018. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 344, 151-167 (2019).
MSC:  68Q45 68V15 68V20
PDF BibTeX XML Cite
Full Text: DOI

Input-driven pushdown automata for edit distance neighborhood. (English) Zbl 07117540

Hofman, Piotrek (ed.) et al., Developments in language theory. 23rd international conference, DLT 2019, Warsaw, Poland, August 5–9, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11647, 113-126 (2019).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI

Sliding windows over context-free languages. (English) Zbl 07378332

Potapov, Igor (ed.) et al., 43rd international symposium on mathematical foundations of computer science. MFCS 2018, Liverpool, United Kingdom, August 27–31, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 117, Article 15, 15 p. (2018).
MSC:  68Qxx
PDF BibTeX XML Cite
Full Text: DOI

Analytic combinatorics of lattice paths with forbidden patterns: asymptotic aspects and Borges’s theorem. (English) Zbl 1482.05009

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 10, 14 p. (2018).
PDF BibTeX XML Cite
Full Text: DOI

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

Word problem languages for free inverse monoids. (English) Zbl 1435.68149

Konstantinidis, Stavros (ed.) et al., Descriptional complexity of formal systems. 20th IFIP WG 1.02 international conference, DCFS 2018, Halifax, NS, Canada, July 25–27, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10952, 24-36 (2018).
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

On the commutative equivalence of context-free languages. (English) Zbl 06983376

Hoshi, Mizuho (ed.) et al., Developments in language theory. 22nd international conference, DLT 2018, Tokyo, Japan, September 10–14, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11088, 169-181 (2018).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI Link

Deterministic sensing \(5'\rightarrow 3'\) Watson-Crick automata without sensing parameter. (English) Zbl 06958394

Stepney, Susan (ed.) et al., Unconventional computation and natural computation. 17th international conference, UCNC 2018, Fontainebleau, France, June 25–29, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10867, 173-187 (2018).
MSC:  68Q05 68Q10
PDF BibTeX XML Cite
Full Text: DOI

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

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

Partial derivatives for context-free languages. From \(\mu\)-regular expressions to pushdown automata. (English) Zbl 06720994

Esparza, Javier (ed.) et al., Foundations of software science and computation structures. 20th international conference, FOSSACS 2017, held as part of the European joint conferences on theory and practice of software, ETAPS 2017, Uppsala, Sweden, April 22–29, 2017. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10203, 248-264 (2017).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

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

Mathematical structures in language. (English) Zbl 1446.03003

CSLI Lecture Notes 218. Stanford, CA: CSLI Publications (ISBN 978-1-57586-847-9/pbk; 978-1-57586-872-1/hbk; 978-1-68400-021-0/ebook). xi, 473 p. (2016).
PDF BibTeX XML Cite

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