Modern Language Models and Computation
DOI10.1007/978-3-319-63100-4zbMath1385.68002OpenAlexW2759753845MaRDI QIDQ4596600
Alexander Meduna, Ondřej Soukup
Publication date: 1 December 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63100-4
finite automatoncomputational biologyexpressive powercomputational linguisticscontext-free grammarformal languageregulated rewritingcontext-sensitive grammarpushdown automatonformal grammarparallel rewritingjumping automaton
Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)
Related Items (1)
This page was built for publication: Modern Language Models and Computation