| |
Browse All Reviews > Theory Of Computation (F) > Mathematical Logic And Formal Languages (F.4) > Grammars And Other Rewriting Systems (F.4.2)
|
|
 |
|
|
| |
|
|
| |
1-10 of 152
Reviews about "Grammars And Other Rewriting Systems (F.4.2)":
|
Date Reviewed |
| |
Characterization of context-free languages
Badano M., Vaggione D. Theoretical Computer Science 676 92-96, 2017. Type: Article
The authors prove that a generalized Greibach normal form (GNF) grammar still generates a context-free language. They expand the left side of GNF-type rules to be any nonempty product of variables (nonterminals), not just a single vari...
|
Sep 20 2018 |
| |
Decidability and independence of conjugacy problems in finitely presented monoids
Araújo J., Kinyon M., Konieczny J., Malheiro A. Theoretical Computer Science 731(C): 88-98, 2018. Type: Article
In a group, two elements a and b are conjugate if there is some g with gag-1 = b. Conjugacy is an equivalence relation and can be...
|
Jul 20 2018 |
| |
Beyond polynomials and Peano arithmetic-automation of elementary and ordinal interpretations
Zankl H., Winkler S., Middeldorp A. Journal of Symbolic Computation 69(C): 129-158, 2015. Type: Article
Goodstein sequences and theorems are very popular because of their unboundedness with respect to multiple recursive functions and derivational complexity....
|
Sep 1 2015 |
| |
Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate
Cantone D., Ursino P. Information and Computation 237215-242, 2014. Type: Article
In an effort to marry set theory and theoretical computer science, in 1970 the Computable Set Theory project was launched to study decidable fragments of set theory. A challenging question for researchers has been finding a way to over...
|
May 27 2015 |
| |
An extension of context-free grammars with one-sided context specifications
Barash M., Okhotin A. Information and Computation 237268-293, 2014. Type: Article
The gap between context-sensitive languages and context-free languages (types 1 and 2 in the Chomsky hierarchy) has been a rich area of research in formal language theory for the past five decades, giving rise to such mildly context-se...
|
Dec 16 2014 |
| |
Using grammars for pattern recognition in images: a systematic review
Pedro R., Nunes F., Machado-Lima A. ACM Computing Surveys 46(2): 1-34, 2013. Type: Article
Grammars were used in computer science from the beginning for designing compilers for the first programming language. They were later used in image generation (for example, L-systems were used to generate beautiful pictures of plants)....
|
Mar 12 2014 |
| |
 Linguistic decision making: theory and methods
Xu Z., Springer Publishing Company, Incorporated, 2013. 300 pp. Type: Book (978-3-642294-39-6)
What is “linguistic decision making” exactly?...
|
Jul 1 2013 |
| |
Grammatical inference: learning automata and grammars
de la Higuera C., Cambridge University Press, New York, NY, 2010. 432 pp. Type: Book (978-0-521763-16-5)
Humans are language-using animals, and since, according to Pope, “the proper study of mankind is man,” one would expect questions on language use and acquisition to be a popular part of the scientific paradigm. Of c...
|
Oct 19 2010 |
| |
Practical algorithms for unsatisfiability proof and core generation in SAT solvers
Asín Achá R., Nieuwenhuis R., Oliveras A., Rodríguez-Carbonell E. AI Communications 23(2-3): 145-157, 2010. Type: Article
Boolean satisfiability (SAT), a nondeterministic polynomial-time (NP) complete problem, deals with determining whether a given set of Boolean propositions can evaluate to a true value, by choosing an appropriate assignment to their con...
|
Aug 11 2010 |
| |
Parsing techniques (Monographs in Computer Science)
Grune D., Jacobs C., Springer-Verlag New York, Inc., Secaucus, NJ, 2006. 662 pp. Type: Book (9780387202488)
Historically speaking, parsing techniques are considered an old topic in computer science (CS), and many good books exist on the subject. What makes this book different is its well-balanced material that includes not only explanatory d...
|
May 30 2008 |
| |
|
|
| |
|
|
