Journal ArticleDOI
Quasi-realtime languages
Reads0
Chats0
TLDR
Every quasi-realtime language can be accepted in real time by a nondeterministic one stack, one pushdown store machine, and can be expressed as the length-preserving homomorphic image of the intersection of three context-free languages.Abstract:
The quasi-realtime languages are seen to be the languages accepted by nondeterministic multitape Turing machines in real time The family of quasi-realtime languages forms an abstract family of languages closed under intersection, linear erasing, and reversal It is identical with the family of languages accepted by nondeterministic multitape Turing machines in linear time Every quasi-realtime language can be accepted in real time by a nondeterministic one stack, one pushdown store machine, and can be expressed as the length-preserving homomorphic image of the intersection of three context-free languagesread more
Citations
More filters
Proceedings ArticleDOI
Conversation specification: a new approach to design and analysis of e-service composition
TL;DR: Conversation specifications as a formalism to define the conversations allowed by an e-service composition is proposed and a central notion of a "conversation", which is a sequence of messages observed by the watcher is proposed.
Journal ArticleDOI
Remarks on blind and partially blind one-way multicounter machines
TL;DR: This work considers one-way nondeterministic machines which have counters allowed to hold positive or negative integers and which accept by final state with all counters zero and quasirealtime partially blind multicounter machines.
Journal ArticleDOI
Real-time language recognition by one-dimensional cellular automata
TL;DR: Pattern recognition by parallel devices is investigated by studying the formal language recognition capabilities of one-dimensional cellular automata, finding that nondeterministic bounded cellular Automata can recognize the context-free languages in real time.
Journal ArticleDOI
On the power of bounded concurrency I: finite automata
Doron Drusinsky,David Harel +1 more
TL;DR: Of the three fundamental notions for modeling concurrency, bounded concurrency is the strongest, representing a similar exponential saving even when substituted for each of the others, and exponential upper and lower bounds on the simulation of deterministic concurrent automata by AFAs are proved.
Journal ArticleDOI
Dynamical recognizers: real time language recognition by analog computers
TL;DR: A model of analog computer which can recognize various languages in real time by composing iterated maps, which can be seen as a real-time, constant-space, off-line version of Blum, Shub, and Smale's real-valued machines.
References
More filters
Journal ArticleDOI
On the computational complexity of algorithms
Book ChapterDOI
The Algebraic Theory of Context-Free Languages*
TL;DR: This chapter discusses the several classes of sentence-generating devices that are closely related, in various ways, to the grammars of both natural languages and artificial languages of various kinds.
Journal ArticleDOI
One-way stack automata
TL;DR: A number of operations which either preserve sets accepted by one-way stack automata or preserve setsaccepted by deterministic one- way stack Automata are presented.
Proceedings ArticleDOI
Abstract families of languages
TL;DR: The notion of an abstract family of languages (AFL) as a family of sets of words satisfying certain properties common to many types of formal languages is introduced and operations preserving AFL are considered.