Results 1 to 10 of about 433 (250)
Nonterminal Complexity of Programmed Grammars [PDF]
Lecture Notes in Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Henning Fernau, Fernau Henning
exaly +6 more sources
Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study cooperating distributed grammar systems working in hybrid modes in connection with the finite index restriction in two different ways: firstly, we investigate cooperating distributed grammar systems working in hybrid modes which characterize ...
Henning Fernau +2 more
doaj +3 more sources
A Solution to the Flowgraphs Case Study using Triple Graph Grammars and eMoflon [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 After 20 years of Triple Graph Grammars (TGGs) and numerous actively maintained implementations, there is now a need for challenging examples and success stories to show that TGGs can be used for real-world bidirectional model transformations.
Anthony Anjorin, Marius Lauder
doaj +3 more sources
The Phonological Latching Network
Biolinguistics, 2021 This paper gives an analysis of an attractor neural network model dubbed the Phonological Latching Network. The model appears to reproduce certain quintessentially phonological phenomena, despite not having any of these phonological behaviours programmed
Joe Stephen Bratsvedal Collins
doaj +1 more source
Synthesizing program input grammars [PDF]
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017 We present an algorithm for synthesizing a context-free grammar encoding the language of valid program inputs from a set of input examples and blackbox access to the program. Our algorithm addresses shortcomings of existing grammar inference algorithms, which both severely overgeneralize and are prohibitively slow.
Osbert Bastani +3 more
openaire +2 more sources
Grammar-based Genetic Programming: a survey [PDF]
Genetic Programming and Evolvable Machines, 2010 Grammar formalisms are one of the key representation structures in Computer Science. So it is not surprising that they have also become important as a method for formalizing constraints in Genetic Programming (GP). Practical grammar-based GP systems first appeared in the mid 1990s, and have subsequently become an important strand in GP research and ...
Robert I. McKay +4 more
openaire +3 more sources
Constructing Programs as Executable Attribute Grammars [PDF]
The Computer Journal, 1992 Summary: Attribute grammars provide a formal yet intuitive notation for specifying the static semantics of programming languages and consequently have been used in various compiler generation systems. Their use, however, need not be limited to this. With a little change in perspective, many programs may be regarded as interpreters and constructed as ...
openaire +2 more sources
Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye NaukiThis paper discusses an approach to programming based on the use of parameterized grammars. The concepts of these grammars are equipped with parameters that can also be objects of the grammars. Such grammars are quite a powerful tool; they are proposed to be used for formulating statements of problems of transformation of linguistic data.
A.P. Beltiukov, M. Joudakizadeh
openaire +1 more source
Grammar-based genetic programming for timetabling [PDF]
2009 IEEE Congress on Evolutionary Computation, 2009 We present a grammar-based genetic programming framework for the solving the timetabling problem via the evolution of constructive heuristics. The grammar used for producing new generations is based on graph colouring heuristics that have previously proved to be effective in constructing timetables as well as different slot allocation heuristics.
Mohamed Bahy Bader-El-Den, Riccardo Poli
openaire +2 more sources
Extended linear macro grammars, iteration grammars, and register programs
Acta Informatica, 1979 Extended macro grammars (of the linear basic type only) are introduced as a generalization of those in [5], and it is shown that they have the same language generating power as (parallel) iteration grammars. In particular the OI and OI versions of extended macro grammars correspond to the deterministic and the (usual) nondeterministic iteration ...
Asveld, Peter R.J., Engelfriet, Joost
openaire +2 more sources