268 search results - page 42 / 54 » Linear Context Free Languages |
APL
1992
ACM
13 years 11 months ago
1992
ACM
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
CONCUR
2006
Springer
13 years 11 months ago
2006
Springer
Boolean programs with recursion are convenient abstractions of sequential imperative programs, and can be represented as recursive state machines (RSMs) or pushdown automata. Motiv...
EMNLP
2011
12 years 7 months ago
2011
This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
We generalise Fiore et al's account of variable binding for untyped cartesian contexts and Tanaka's account of variable binding for untyped linear contexts to give an ac...
JLP
1998
13 years 7 months ago
1998
Using constraint logic techniques, it is made possible to use a wellknown metainterpreter backwards as a device for generating programs. A metainterpreter is developed, which prov...