Results 251 to 260 of about 171,423 (283)

On Bounded Right Context Languages and Grammars

SIAM Journal on Computing, 1974
It is shown using phrase-structure-preserving grammatical transformations that the family of $(1,1)$ bounded right context languages is the same as the family of context-free deterministic languages. The elimination of $\lambda $-rules and a reconciliation of our definition of bounded right context with Floyd’s are also discussed.
Susan L Graham
exaly   +3 more sources

Leftmove-bounded picture languages

Theoretical Computer Science, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Changwook Kim
exaly   +2 more sources

Heap-Bounded Assembly Language

Journal of Automated Reasoning, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David Aspinall 0001, Adriana B. Compagnoni   +1 more
openaire   +2 more sources

An optimal lower bound for nonregular languages

Information Processing Letters, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. Bertoni, C. Mereghetti, G. Pighizzini
openaire   +1 more source

On bounded context-free languages

J. Inf. Process. Cybern., 2020
Two new characterizations of bounded context-free languages are established and two known conjectures concerning context-free languages are shown to be true for the particular case of bounded context-free languages.
Michel Latteux, Gabriel Thierrin
openaire   +1 more source

Two-Way Automata and Bounded Languages

We prove that, at the cost of a polynomial increase of the number of states, each two-way nondeterministic automaton accepting a letter-bounded language can be simulated by an equivalent machine of the same type, where nondeterministic transitions and inversions of head movement are possible only when the head visits one of the tape end-markers ...
Alessandro Clerici Lorenzini, Giovanni Pighizzini, Luca Prigioniero   +2 more
openaire   +1 more source

Hume: a bounded time concurrent language

ICECS 2000. 7th IEEE International Conference on Electronics, Circuits and Systems (Cat. No.00EX445), 2002
This paper gives a formal description of Hume, a novel functionally-based concurrent language that aims to target space- and time-critical systems. The language supports rigorous cost and space analyses, whilst providing a high level of abstraction including polymorphic type inference, automatic memory management, and higher-order functions.
openaire   +1 more source

Language of topologically valid bounding manifolds

Computer-Aided Design, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Computing Languages by (Bounded) Local Sets

2003
We introduce the definition of local structures as description of computations to recognize strings and characterize families of Chomsky's hierarchy in terms of projection of frontiers of local sets of structures. Then we consider particular grid structures we call bounded-grids and study the corresponding family of string languages by proving some ...
openaire   +3 more sources

A Useful Bounded Resource Functional Language

2008
Real-time software, particularly that used in embedded systems, has unique resource and verification requirements. While embedded software may not have great need for processor and memory resources, the need to prove that computations are performed correctly and within hard time and space constraints is very great. Improvements in hardware and compiler
Michael J. Burrell, James H. Andrews, Mark Daley   +2 more
openaire   +1 more source