Deterministic Stream X-Machines Based on Grammar Systems

Tudor Bălănescu (), Marian Gheorghe () and Mike Holcombe ()
Additional contact information
Tudor Bălănescu: Piteşti University, Department of Computer Science Faculty of Sciences
Marian Gheorghe: Piteşti University, Department of Computer Science Faculty of Sciences
Mike Holcombe: Sheffield University, Department of Computer Science

Chapter Chapter 2 in Where Mathematics, Computer Science, Linguistics and Biology Meet, 2001, pp 13-23 from Springer

Abstract: Abstract This paper investigates the power of the stream X-machines based on cooperating distributed grammar systems which replace relations by functions. The case of regular rules is considered. The deterministic case is introduced in order to allow the application of some already developed testing strategies. Some conditions for getting equivalent stream X-machines in the = 1 derivation mode are studied.

Keywords: Finite State Machine; Regular Language; Deterministic Case; Formal Grammar; Input Alphabet (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-015-9634-3_2

Ordering information: This item can be ordered from
http://www.springer.com/9789401596343

DOI: 10.1007/978-94-015-9634-3_2

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().