Parallel communicating grammar systems with terminal transmission

Acta Informatica

Volumn 37, Issue 7, 2001, Pages 511-540

  Fernau, Henning ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035532348     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013312     Document Type: Article

References (48)

1. 1. K. Abrahamson, L. Cai, S. Gordon: A grammar characterization of logarithmic-space computation. In: Gh. Pǎun, A. Salomaa (eds) New Trends in Formal Languages, Vol 1218 of LNCS, pp 247-255. Berlin Heidelberg New York: Springer 1997
2. 2. D. Angluin: Inductive inference of formal languages from positive data. Inf Control 45: 117-135 (1980)
3. 3. D. Angluin: Inference of reversible languages. J ACM 29(3): 741-765 (1982)
4. 4. J.-M. Autebert: Some results about centralized PC grammar system. Theor Comput Sci 215: 383-398 (1999)
5. 5. J. Berstel: Transductions and Context-Free Languages, Vol 38 of LAMM. Stuttgart, Teubner 1979
6. 6. L. Blum, M. Blum: Toward a mathematical theory of inductive inference. Inf Control 28: 125-155 (1975)
7. 7. H. Bordihn, J. Dassow, G. Vaszil: Grammar systems as language analyzers and recursively enumerable languages. In: G. Ciobanu, Gh. Pǎun (eds) Fundamentals of Computation Theory, Proc. FCT'99, Vol 1684 of LNCS, pp 136-147. Berlin Heidelberg New York: Springer 1999
8. 8. F.-J. Brandenburg: Intersections of some families of languages. In: Automata, Languages and Programming. Proc. ICALP'86, Vol 226 of LNCS, pp 60-69. Berlin Heidelberg New York: Springer 1986
9. 9. L. Cai: The complexity of linear PCGS. Comput Artif Intell 15: 199-210 (1996)
10. 10. L. Cai: The computational complexity of PCGS with regular components. In: J. Dassow, G. Rozenberg, A. Salomaa (eds) Developments in Language Theory II; at the crossroads of mathematics, computer science and biology, pp 209-219. Singapore: World Scientific 1996
11. 11. J. Dassow, Gh. Pǎun: Regulated Rewriting in Formal Language Theory, Vol 18 of EATCS Monographs in Theoretical Computer Science. Berlin Heidelberg New York: Springer 1989
12. 12. S. Dumitrescu, Gh. Pǎun: On the power of parallel communicating grammar systems with right-linear components. RAIRO Informatique théorique et Applications/Theoretical Informatics and Applications 31(4): 331-354 (1997)
13. 13. H. Fernau: Identifying terminal distinguishable languages. Submitted revised version of the extended abstract which appeared in the Proc. AMAI 2000, see http://rutcor.rutgers.edu/~amai/AcceptedCont.htm
14. 14. H. Fernau: On learning function distinguishable languages. Technical Report WSI-2000-13, Universität Tübingen (Germany), Wilhelm-Schickard-Institut für Informatik, 2000. A conference version will appear at ALT 2000
15. 15. H. Fernau: PC grammar systems with terminal transmission. In: R. Freund, A. Kelemenová (eds) Proc. International Workshop on Grammar Systems, pp 229-252. Silesian University at Opava, 2000
16. 16. H. Fernau, M. Holzer: Conditional context-free languages of finite index. In: Gh. Pǎun, A. Salomaa (eds) New Trends in Formal Languages, Vol 1218 of LNCS, pp 10-26. Berlin Heidelberg New York: Springer 1997
17. 17. H. Fernau, M. Holzer: External contextual and conditional languages. In: C. Martin-Vide, Gh. Pǎun (eds) Recent Topics in Mathematical and Computational Linguistics, pp 104-120. Bukarest: The Publishing House of the Romanian Academy, 2000
18. 18. H. Fernau, J. M. Sempere: Permutations and control sets for learning non-regular language families. In: A.L. Oliveira (ed.) Proc. 5th International Colloquium on Grammatical Inference ICGI 2000, Vol 1891 of LNCS/LNAI, pp 75-88. Berlin Heidelberg New York: Springer 2000
19. 19. H. Fernau, R. Stiebe: Sequential grammars and automata with valences. Manuscript.
20. 20. E. M. Gold: Language identification in the limit. Inf Control 10: 447-474 (1967)
21. 21. S. Greibach: Remarks on blind and partially blind one-way multicounter machines. Theor Comput Sci 7: 311-324 (1978)
22. 22. M. Holzer: Multi-head finite automata: data-independent versus data-dependent computations. In: I. Prívara, P. Ružička (eds) Mathematical Foundations of Computer Science MFCS'97, 56ol 1295 of LNCS, pp 299-308. Berlin Heidelberg New York: Springer 1997
23. 23. O. Ibarra: Simple matrix languages. Inf Control 17: 359-394 (1970)
24. 24. O. H. Ibarra, S. K. Sahni, C. E. Kim: Finite automata with multiplication. Theor Comput Sci 2: 271-296 (1976)
25. 25. K.-J. Lange: Complexity and structure in formal language theory. Fund Inform 25(3): 327-352 (1996)
26. 26. K.-J. Lange, R. Niedermeier: Data independence of read, write and control structures in PRAM computations. J Comput Syst Sci 60: 109-144, 2000.
27. 27. H. A. Maurer, W. Kuich: Tuple languages. In: W. D. Itzfeld (ed.) Proc. ACM International Computing Symposium, pp 882-891. German Chapter of the ACM 1970
28. 28. Gh. Pǎun: On the family of finite index matrix languages. J Computer Syst Sci 18(3): 267-280 (1979)
29. 29. Gh. Pǎun: A new generative device: valence grammars. Rev. Roumaine Math. Pures Appl. XXV(6): 911-924 (1980)
30. 30. Gh. Pǎun: On the synchronization in parallel communicating grammar systems. Acta Inf 30: 351-367 (1993)
31. 31. Gh. Pǎun, L. Santean: Parallel communicating grammar systems: the regular case. Ann. Univ. Bucharest, Ser. Matem.-Inform. 38(2): 55-63 (1989)
32. 32. H. Petersen: The head hierarchy for oblivious finite automata with polynomial advice collapses. In: L. Brim, J. Gruska, J. Zlatuška, editors, Mathematical Foundations of Computer Science MFCS'98, Vol 1450 of LNCS, pp 296-304. Berlin Heidelberg New York: Springer 1998
33. 33. V. Radhakrishnan: Grammatical Inference from Positive Data: An Effective Integrated Approach. PhD thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay (India), 1987
34. 34. V. Radhakrishnan, G. Nagaraja: Inference of regular grammars via skeletons. IEEE Trans Syst Man Cybern 17(6): 982-992 (1987)
35. 35. R. D. Rosebrugh, D. Wood: A characterization theorem for n-parallel right linear languages. J Comput Syst Sci 7: 579-582 (1973)
36. 36. R. D. Rosebrugh, D. Wood: Image theorems for simple matrix languages and n-parallel languages. Math Syst Theory 8: 150-155 (1974)
37. 37. R. D. Rosebrugh, D. Wood: Restricted parallelism and right linear grammars. Utilitas Mathematica 7: 151-186 (1975)
38. 38. P. Rossmanith: The owner concept for PRAMs. In: 8th Annual Symposium on Theoretical Aspects of Computer Science STACS'91, Vol 480 of LNCS, pp 172-183. Berlin Heidelberg New York: Springer 1991
39. 39. G. Rozenberg, D. Vermeir: On the effect of the finite index restriction on several families of grammars. Inf Control 39: 284-302 (1978)
40. 40. J. M. Sempere, G. Nagaraja: Learning a subclass of linear languages from positive structural information. In: V. Honavar, G. Slutski (eds) Proc. 4th International Colloquium on Grammatical Inference ICGI'98, Vol 1433 of LNCS/LNAI, pp 162-174. Berlin Heidelberg New York: Springer 1998
41. 41. R. Siromoney: On equal matrix languages. Inf Control 14: 133-151 (1969)
42. 42. I. H. Sudborough: A note on tape-bounded complexity classes and linear context-free languages. J ACM 22(4): 499-500 (1975)
43. 43. I. H. Sudborough: On tape-bounded complexity classes and multi-head finite automata. J Comput Syst Sci 10(1): 62-76 (1975)
44. 44. Y. Takada: Learning even equal matrix languages based on control sets. In: A. Nakamura et al. (eds) Parallel Image Analysis, ICPIA'92, Vol 652 of LNCS, pp 274-289. Berlin Heidelberg New York: Springer 1992
45. 45. Y. Takada: A hierarchy of language families learnable by regular language learning. Inf Comput 123: 138-145 (1995)
46. 46. R. E. Tarjan: Efficiency of a good but not linear set union algorithm. J ACM 22(2): 215-225 (1975)
47. 47. D. Wood: Properties of n-parallel finite state languages. Technical Report 73/4, McMaster University, Hamilton, Canada, 1973
48. 48. D. Wood: Bounded parallelism and regular languages. In: G. Rozenberg, A. Salomaa (eds) L Systems, Vol 15 of LNCS, pp 292-301. Berlin Heidelberg New York: Springer 1974