11. fejezet - Irodalomjegyzék

[Afonin, Golomazov 2009] Sergey Afonin, Denis Golomazov: Minimal Union-Free Decompositions of Regular Languages. LNCS 5457, LATA 2009, 83-92.

[Aho 1968] A. V. Aho: Indexed Grammars - An Extension of Context-Free Grammars, Journ. of ACM, 15 (1968), 647-671.

[Amar, Putzolu 1964] V. Amar, G.R. Putzolu: On a Family of Linear Grammars. Information and Control 7(3) (1964), 283-291.

[Amar, Putzolu 1965] V. Amar, G.R. Putzolu: Generalizations of Regular Events. Information and Control 8(1) (1965), 56-63.

[Babcsányi 2007] Babcsányi István: Automaták, nyelvek, kódok, BME, Matematika Intézet, Algebra Tanszék, 2007 (elektronikus jegyzet: http://www.math.bme.hu/~babcs/aut.pdf).

[Bach 2002] Bach Iván: Formális nyelvek, Typotex kiadó, 2002 (elektronikusan: http://www.typotex.hu/download/formalisnyelvek.pdf).

[Backus 1959] J.W. Backus: The syntax and semantics of the proposed international algebraic language of the Zurich ACM-GAMM coference, Proc. Intl. Conf. on Information Processing (1959), UNESCO, 125-132.

[Bar-Hillel et al 1961] Y. Bar-Hillel, M. Perles, E. Shamir: On formal properties of simple phrase structure grammars, Z. Phonetik. Sprachwiss. Komm., 14 (1961) 143-172.

[Bel-Enguix et al 2008] G. Bel-Enguix, M.D. Jiménez-López, C. Martín-Vide (eds.): Recent Developments in Formal Languages and Applications. Springer, Berlin, 2008.

[Buntrock, Otto 1995] G. Buntrock, F. Otto: Growing context-sensitive languages and Church-Rosser languages, 12th STACS, Lecture Notes in Computer Science 900 (1995), 313-324.

[Chomsky 1956] N. Chomsky: Three Models for the Description of Language. IRE Transactions on Information Theory IT-2, no. 3 (September 1956): 113-24. (Reprinted in Readings in Mathematical Psychology 2, edited by R. Luce, R. Bush, E. Galanter, 105-24. New York: Wiley and Sons, 1965.)

[Chomsky 1959] N. Chomsky: On Certain Formal Properties of Grammars. Information and Control 2 (June 1959): 137-67. (Reprinted in Readings in Mathematical Psychology 2, edited by Luce, Bush, Galanter, 125-55. New York, Wiley and Sons, 1965.)

[Cremers 1973] Armin B. Cremers: Normal Forms for Context-Sensitive Grammars, Acta Informatica 3 (1973) 59-73.

[Csuhaj-Varjú et al 1994] E. Csuhaj-Varjú, J. Dassow, J. Kelemen, Gh. Paun: Grammar Systems: A grammatical approach to distribution and cooperation. Gordon and Breach Science Publishers, Topics in Computer Mathematics 5, Yverdon, 1994.

[Csuhaj-Varjú, Dassow 1990] Erzsébet Csuhaj-Varjú, Jürgen Dassow: On Cooperating/Distributed Grammar Systems. Elektronische Informationsverarbeitung und Kybernetik 26 (1/2) (1990) 49-63.

[Csuhaj-Varjú, Salomaa 2001] Erzsébet Csuhaj-Varjú, Arto Salomaa: Networks of Language Processors: Parallel Communicating Systems. Current Trends in Theoretical Computer Science, Entering the 21th Century, World Scientific (2001) 791-810.

[Csuhaj-Varjú, Vaszil 2001] E. Csuhaj-Varjú, Gy. Vaszil: On context-free parallel communicating grammar systems: synchronization, communication, and normal forms. Theoretical Computer Science 255 (2001), 511-538.

[Dassow, Paun 1989] J. Dassow, Gh. Paun: Regulated Rewriting in Formal Language Theory. EATCS Monographs in Theoretical Computer Science 18, Springer, 1989.

[Dassow et al 1994] J. Dassow, M. Ito, Gh. Paun: On the Subword Density of Languages, SEA Bull. Math., 18 (1994), 49-61.

[Demetrovics et al 1989] Demetrovics János, Jordan Denev, Radiszlav Pavlov: A számítástudomány matematikai alapjai, Tankönyvkiadó, Budapest, 1989.

[Dömösi 1995] Dömösi Pál: Formális Nyelvek és Automaták, egyetemi jegyzet, Debrecen, 1995.

[Dömösi et al, 1996] P. Dömösi, M. Ito, M. Katsura, C. Nehaniv: New pumping property of context-free languages, Combinatorics, Complexity and Logic, Proc. International Conference on Discrete Mathemtics and Theoretical Computer Science - DMTCS'96, Springer, Singapore, 187-193.

[Dömösi et al 2004] Dömösi P., Fazekas A., Horváth G., Mecsei Z.: Formális nyelvek és automaták, egyetemi jegyzet, MobiDiák, 2004.

[Dömösi, Nehaniv 2005] P. Dömösi, C. Nehaniv: Algebraic theory of automata networks: an introduction, SIAM Monographs on Discrete Mathematics and Applications 11, 2005.

[Earley 1970] J. Earley: An efficient context-free parsing algorithm, Communications of the Association for Computing Machinery (ACM), 13 (1970) 94-102.

[Ésik et al 2006] Zoltán Ésik, Carlos Martín-Vide, Victor Mitrana (eds.): Recent Advances in Formal Languages and Applications, Springer 2006.

[Fülöp 2005] Fülöp Zoltán: Formális nyelvek és szintaktikus elemzésük, Polygon jegyzettár (3. kiadás, 2005)

[Garey, Johnson 1979] M.R. Garey, D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, 1979.

[Geffert 1988] Viliam Geffert: Context-Free-Like Forms for the Phrase-Structure Grammars. LNCS 324, MFCS 1988, 309-317.

[Greibach 1965] Sheila A. Greibach: A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. J. ACM 12(1) (1965) 42-52.

[Harrison 1978] Michael A. Harrison: Introduction to Formal Language Theory, Addison-Wesley, 1978.

[Hayashi 1973] T. Hayashi: On Derivation Trees of Indexed Grammars - An Extension of the uvwxy - Theorem, Publ. RIMS, Kyoto Univ., 9 (1973), 61-92.

[Hopcroft, Ullman 1979] J. E. Hopcroft, J. D. Ullmann: Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts, Menlo Park, California, London, Amsterdam, Don Mils,Ontario, Sidney, 1979.

[Horváth et al 2004] Horváth G., Mecsei Z., Nagy B.: Formális nyelvek és automaták gyakorlati összefoglaló, egyetemi jegyzet, Mobidiák, Debrecen, 2004.

[Horváth, Nagy 2010] Horváth G., Nagy B.: Pumping lemmas for linear and nonlinear context-free languages, Acta Univ. Sapientiae, Informatica, 2/2 (2010), 194-209.

[Huffman 1954] D.A. Huffman: The synthesis of sequential switching circuits, J. Franklin Inst. 257 (1954), 161-190 és 275-303.

[Kleene 1956] S.C. Kleene: Representation of events in nerve nets and finite automata, in: C.E. Shannon, J. McCarthy: Automata Studies, Princeton Univ. Press, (1956), 3-42.

[Kuroda 1964] S.-Y. Kuroda: Classes of languages and linear-bounded automata, Information and Control 7 (1964), 207-223.

[Leupold, Nagy 2010] P. Leupold, B. Nagy: 5' → 3' Watson-Crick automata with several runs, Fundamenta Informaticae 104 (2010) 71-91.

[Lindenmayer 1968] A. Lindenmayer: Mathematical models for cellular interaction in development I. Filaments with one-sided inputs. Journal of Theoretical Biology 18 (1968) 280-289.

[Linz 2006] P. Linz: An introduction to formal languages and automata, Fourth edition, Jones and Bartlett Publishers 2006.

[Mäkinen 1985] E. Mäkinen: On permutative grammars generating context-free languages, BIT 25 (1985), 604-610.

[Martín-Vide et al 2004] C. Martín-Vide, V. Mitrana, Gh. Paun, (eds.): Formal Languages and Applications. Springer, Berlin, 2004.

[Mealy 1955] G.H. Mealy: A method for synthesizing sequential circuits, Bell System Technical Journal 34 (1955), 1045-1079.

[Minsky 1967] M. Minsky: Computation: Finite and Infinite Machines, Prentice-Hall 1967.

[Moore 1956] E.F. Moore: Gedanken experiments on sequential machines, in: C.E. Shannon, J. McCarthy: Automata Studies, Princeton Univ. Press, (1956), 129-153.

[Nagy 2004] Nagy B.: A Normal Form for Regular Expressions, DLT'04, Eighth International Conference on Developments in Language Theory, Auckland, New Zealand, (CDMTCS-252) 10 pages (2004).

[Nagy 2005] Nagy B.: Új elvű számítógépek (Bevezetés az új számítási modellekbe és a nem-klasszikus "számítógépek" tudományába), egyetemi jegyzet, Mobidiák, Debrecen, 2005.

[Nagy 2006a] Nagy B.: Union-free languages and 1-cycle-free-path-automata, Publicationes Mathematicae Debrecen 68 (2006), 183-197.

[Nagy 2006b] Nagy B.: Left-most derivation and shadow-pushdown automata for context-sensitive languages (2006), Proceedings of the 10th WSEAS International Conference on Computers, Athens, Greece, 962-967.

[Nagy 2006c] Nagy B.: Shadow-Pushdown Automata, WSEAS Transactions on Computers 5/11 (2006), 2565-2570.

[Nagy 2008]: Nagy B.: On 5' → 3' sensing Watson-Crick finite automata, DNA 13, Revised Selected Papers, Lecture Notes in Computer Science - LNCS 4848 (2008), 256-262.

[Nagy 2009a] Nagy, B.: Languages generated by context-free grammars extended by type AB → BA rules, Journal of Automata, Languages and Combinatorics 14 (2009), 175-186.

[Nagy 2009b] Nagy, B.: Permutation languages in formal linguistics, IWANN 2009, Lecture Notes in Computer Science 5517 (2009), 504-511.

[Nagy 2010a] Nagy, B.: On a hierarchy of permutation languages, in: (editors: M. Ito, Y. Kobayashi, K. Shoji) Automata, Formal Languages and Algebraic Systems, World Scientific, Singapore (2010), 163-178.

[Nagy 2010b] Nagy, B.: Derivation trees for context-sensitive grammars, in: (editors: M. Ito, Y. Kobayashi, K. Shoji) Automata, Formal Languages and Algebraic Systems, World Scientific, Singapore (2010), 179-199.

[Nagy 2010c] Nagy B.: An automata-theoretic characterization of the Chomsky-hierarchy, TAMC 2010, Lecture Notes in Computer Science - LNCS 6108 (2010), 361-372.

[Nagy 2010d] Nagy B.: On Union-complexity of Regular Languages, CINTI 2010, 11th IEEE International Symposium on Computational Intelligence and Informatics, 177-182.

[Nagy 2010e] Nagy, B.: Pumping lemmas for special linear languages, ICAI 2010, Eger, Hungary, vol. II. 73-81.

[Nagy 2011a] Nagy B.: Linguistic power of permutation languages by regular help, in: Linguistics, Biology and Computer Science: Interplays, Cambridge Scholars (2011), 135-152.

[Nagy 2011b] Nagy, B.: A class of 2-head finite automata for linear languages, TRIANGLE (2011), megjelenés alatt

[Nagy 2011c] Nagy, B.: On a hierarchy of 5' → 3' sensing Watson-Crick finite automata languages, Journal of Logic and Computation (Oxford University Press), 2011, közlésre elfogadva

[Nagy, Otto 2010a] Nagy B., F. Otto: CD-Systems of Stateless Deterministic R(1)-Automata Accept all Rational Trace Languages, LATA 2010, Lecture Notes in Computer Science - LNCS 6031 (2010), 463-474. Springer, Heidelberg

[Nagy, Otto 2010b] Nagy B., F. Otto: On CD-systems of stateless deterministic R-automata with window size one, Kasseler Informatikschriften 2010, 2, Kassel University, Germany

[Nagy, Otto 2010c] Nagy B., F. Otto: CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store, Kasseler Informatikschriften 2010, 4, Kassel University, Germany

[Nagy, Otto 2011a] Nagy B., F. Otto: An automata-theoretical characterization of context-free trace languages, SOFSEM 2011, Lecture Notes In Computer Science - LNCS 6543 (2011), 406-417.

[Nagy, Otto 2011b] Nagy B., F. Otto: Finite-State Acceptors with Translucent Letters, ICAART 2011 - 3rd International Conference on Agents and Artificial Intelligence, BILC 2011 - 1st International Workshop on AI Methods for Interdisciplinary Research in Language and Biology, 3-13.

[Nagy, Otto 2011c] Nagy B., F. Otto: CD-Systems of Stateless Deterministic R(1)-Automata Governed by an External Pushdown Store, RAIRO - Theoretical Informatics and Applications, RAIRO-ITA, 2011, megjelenés alatt

[Nagy, Otto 2011d] Nagy B., F. Otto: On CD-systems of stateless deterministic R-automata with window size one, Journal of Computer and System Sciences - JCSS, megjelenés alatt

[Nagy, Varga 2009] Nagy B., Varga P.: A New Normal Form for Context-Sensitive Grammars, SOFSEM 2009: (35th Conference on Current Trends in) Theory and Practice of Computer Science, Spindleruv Mlyn, Czech Repulic, Volume II, 60-71. Iteration-free Normal Form for Context-Sensitive Grammars, Tech. Rep., Dept. Math. and Fac. Inf., Univ. Debrecen, 2007/8.

[Oettinger 1961] A.G. Oettinger: Automatic syntactic analysis and the pushdown store, Proc. Symposia on Applied Math. 12 (1961), AMS, Providence, RI.

[Papadimitriou 1995] Christos H. Papadimitriou: Számítási bonyolultság, Addison-Wesley, 1995., magyar fordítás: Novadat Bt. 1999.

[Paun et al 1998] Gheorge Paun, Grzegorz Rozenberg, Arto Salomaa: DNA Computing - New Computing Paradigms. Springer-Verlag, 1998.

[Peák 1988] Peák István: Bevezetés az automaták elméletébe I., Tankönyvkiadó, Budapest, 1988.

[Peák 1989] Peák István: Bevezetés az automaták elméletébe II., Tankönyvkiadó, Budapest, 1989.

[Peák 1990] Peák István: Bevezetés az automaták elméletébe III., Tankönyvkiadó, Budapest, 1990.

[Penttonen 1974] M. Penttonen: One-sided and two-sided context in formal grammars. Information and Control 25 (1974), 371-392.

[Prusinkiewicz, Lindenmayer 1990] P. Prusinkiewicz, A. Lindenmayer: The Algorithmic Beauty of Plants, Springer-Verlag, 1990, 1996. (elektronikusan: http://algorithmicbotany.org/papers/#abop)

[Rabin, Scott 1959] M.O. Rabin, D. Scott: Finite automata and their decision problems, IBM J. Res. Dev. 3 (1959), 114-125.

[Révész 1983] Gy. E. Révész: Introduction to Formal Languages, McGraw-Hill, New York, St Louis, San Francisco, Auckland, Bogota, Hamburg, Johannesburg, London, Madrid, Mexico, Montreal, New Delhi, Panama, Paris, Sao Paulo, Singapore, Sydney, Tokyo, Toronto, 1983.

[Révész 1989] Révész György: Bevezetés a formális nyelvek elméletébe, Tankönyvkiadó, Budapest, 1989.

[Rónyai et al 1998] Rónyai L., Ivanyos G., Szabó R.: Algoritmusok, Typotex 1998.

[Rosenfeld 1979] A. Rosenfeld: Picture Languages, Formal Models for Picture Recognition, Academic Press, New York, 1979.

[Rozenberg, Salomaa 1997] G. Rozenberg, A. Salomaa (eds.): Handbook of formal languages, Springer, Berlin, Heidelberg, 1997. 3 volumes.

[Salomaa 1973] A. Salomaa: Formal Languages, Academic Press, New York, London, 1973.

[Salomaa 1981] A. Salomaa: Jewels of formal language theory, Computer Science Press, Rockville, Maryland, 1981.

[Scheinberg 1960] S. Scheinberg: Note on the boolean properties of context-free languages, Information and Control 3 (1960), 372-375.

[Schutzenberger 1963] M.P. Schutzenberger: On context-free languages and pushdown automata, Information and Control 6 (1963), 246-264.

[Sempere, García 1994] J. M. Sempere, P. García: A characterization of even linear languages and its application to the learning problem, Proc. Second International Colloquium, ICGI-94, Lecture Notes in Artificial Intelligence, 862 (1994) 38-44.

[Sipser 2005] M. Sipser: Introduction to the Theory of Computation, Course Technology, 2005.

[Shallit 2009] J. Shallit: A Second Course in Formal Languages and Automata Theory, Cambridge University Press, 2009.

[Shyr 1991] H.J. Shyr: Free Monoids and Languages, National Chung-Hsing University, Taichung, Taiwan, R.O.C., Ho Min Book Company, 1991.

[Turing 1936] A.M. Turing: On computable numbers with an application to the Entscheidungsproblem, Proc. Londom Math. Society 2 (1936), 230-265. és 544-546.

[Vaszil 1997] Gy. Vaszil: Various communications in PC grammar systems, Acta Cybernetica 13 (1997), 173-196.

[Younger 1967] D.H. Younger: Recognition and parsing of context-free languages in time n3, Information and Control 10 (1967), 189-208.