DOCSLIB.ORG

EPTCS 252 Automata and Formal Languages

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
EPTCS 252 Automata and Formal Languages EPTCS 252 Proceedings of the 15th International Conference on Automata and Formal Languages Debrecen, Hungary, September 4-6, 2017 Edited by: Erzsebet´ Csuhaj-Varju,´ Pal´ Dom¨ osi¨ and Gyorgy¨ Vaszil Published: 21st August 2017 DOI: 10.4204/EPTCS.252 ISSN: 2075-2180 Open Publishing Association i Table of Contents TableofContents .................................... ...................................... i Preface............................................ ........................................ iii Erzsébet Csuhaj-Varjú, Pál Dömösi and György Vaszil Invited Presentation: Automata and Formal Languages for Next Generation Sequencing Data . 1 Paola Bonizzoni and Gianluca Della Vedova Invited Presentation: Representation of Information in Automata . ................ 3 Henning Bordihn Invited Presentation: On Regular Images of Regular Languages under Extended Word Operations 5 Szilárd Zsolt Fazekas Invited Presentation: Networks of Genetic Processors: From Universality to a Formal Language Characterization ................................... ........................................ 7 José M. Sempere Invited Presentation: Rearrangement Problem of Multidimensional Arrays by Prefix Reversals . 9 Akihiro Yamamura (Tissue) P Systems with Vesicles of Multisets . ..................................... 11 Artiom Alhazov, Rudolf Freund, Sergiu Ivanov and Sergey Verlan Unavoidable Sets of Partial Words of Uniform Length . .................................. 26 Joey Becker, F. Blanchet-Sadri, Laure Flapan and Stephen Watkins On the Descriptional Complexity of Operations on SemilinearSets.............................. 41 Simon Beier, Markus Holzer and Martin Kutrib Dyck Words, Lattice Paths, and Abelian Borders . ................................... 56 F. Blanchet-Sadri, Kun Chen and Kenneth Hawes Constructing Words with High Distinct Square Densities . .................................... 71 F. Blanchet-Sadri and S. Osborne Higher-Order Operator Precedence Languages . .................................... 86 Stefano Crespi Reghizzi and Matteo Pradella The Triple-Pair Construction for Weighted ω-Pushdown Automata..............................101 Manfred Droste, Zoltán Ésik and Werner Kuich ii Reversible Languages Having Finitely Many Reduced Automata................................114 Kitti Gelle and Szabolcs Iván Input-Driven Double-Head Pushdown Automata . ..................................128 Markus Holzer, Martin Kutrib, Andreas Malcher and Matthias Wendlandt Weakly and Strongly Irreversible Regular Languages . ....................................143 Giovanna J. Lavado, Giovanni Pighizzini and Luca Prigioniero Descriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata . 157 Laurette Marais and Lynette van Zijl CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages. .....................................170 Alexander Meduna and Jakub Martiško Derivatives of Parsing Expression Grammars. .....................................180 Aaron Moss A New Sensing 5’–>3’ Watson-Crick Automata Concept. ................................195 Benedek Nagy, Shaghayegh Parchami and Hamid Mir-Mohammad-Sadeghi Exact AffineCounter Automata.......................... ....................................205 Masaki Nakanishi, Kamil Khadiev, Krisjanis Prusis, Jevgenijs Vihrovs and Abuzer Yakaryılmaz On h-Lexicalized Restarting Automata . .....................................219 Martin Plátek and Friedrich Otto Generalized Results on Monoids as Memory . ..................................234 Özlem Salehi, Flavio D’Alessandro and A. C. Cem Say Preface The 15th International Conference on Automata and Formal Languages (AFL 2017) was held in Debre- cen, September 4-6, 2017. It was organized by the Faculty of Informatics, University of Debrecen and the Faculty of Informatics, E¨otv¨os Lor´and University, Budapest. The AFL conference series was initiated by Prof. Istv´an Pe´ak (1936-1989). He organized the AFL conferences in 1980, 1982, 1984, 1986 and 1988 and started the organization of AFL’90. These con- ferences were all held in the hills around Salg´otarj´an. In 1986 and 1988, the title of the conference was Automata, Languages and Programming Systems. Since the untimely death of Prof. Istv´an Pe´ak in 1990, the AFL conferences have been organized in every third year. Professors Andr´as Ad´am´ and P´al D¨om¨osi took the lead in the continuation of the series. In 1993 and 1996, two more “Salg´otarj´an conferences” took place, the last three conferences of the series were held in Balatonf¨ured (AFL 2008), Debrecen (AFL’11), and Szeged (AFL 2014). AFL 2017 intended to cover all important areas of automata and formal language theory and their applications such as grammars, acceptors and transducers for strings, trees, graphs, arrays, algebraic theories for automata and languages, combinatorial properties of words and languages, formal power series, decision problems, efficient algorithms for automata and languages, relations to complexity theory and logic, picture description and analysis, quantum computing, cryptography, concurrency, applications of automata and language theory in biology, natural language processing, and other fields. The Programme Committee invited lectures from Paola Bonizzoni (University of Milan-Bicocca, Italy), Henning Bordihn (University of Potsdam, Germany), Szil´ard Zsolt Fazekas (Akita University, Japan), Jos´eM. Sempere (Technical University of Valencia, Spain), Akihiro Yamamura (Akita University, Japan). A special memorial session in honor of late Zolt´an Esik,´ steering committee member and organizer of AFL conferences, consisted of talks presented by Szabolcs Iv´an (University of Szeged, Hungary) and Werner Kuich (Technical University of Vienna, Austria). This volume contains the abstracts of invited lectures and the texts of the 17 papers accepted from the 23 submissions to AFL 2017. The members of the International Program Committee were Francine Blanchet-Sadri (Greensboro), Gy¨orgy Mar´oti (Veszpr´em), Victor Bovdi (Al Ain), Alexander Meduna (Brno), Erzs´ebet Csuhaj-Varj´u(Budapest, co-chair), Victor Mitrana (Bucharest, Madrid), J¨urgen Dassow (Magdeburg), Andreas Maletti (Stuttgart), P´al D¨om¨osi (Debrecen, co-chair), Benedek Nagy (Famagusta), Henning Fernau (Trier), Chrystopher Nehaniv (Hertfordshire), Zolt´an F¨ul¨op (Szeged), Friedrich Otto (Kassel), Viliam Geffert (Koˇsice), Gheorghe P˘aun (Bucharest), E. Csuhaj-Varj´u, P. D¨om¨osi, Gy. Vaszil (Eds.): 15th International Conference on Automata and Formal Languages (AFL 2017) EPTCS 252, 2017, pp. iii–v, doi:10.4204/EPTCS.252.0 iv Preface Marian Gheorghe (Bradford), Giovanni Pighizzini (Milano), Oscar H. Ibarra (Santa Barbara, CA), Agust´ın Riscos-N´u˜nez (Sevilla), Szabolcs Iv´an (Szeged), Jeffrey Shallit (Waterloo, Canada), Galina Jir´askov´a(Koˇsice), Petr Sos´ık (Opava), Juhani Karhum¨aki (Turku), Bianca Truthe (Giessen), Alica Kelemenov´a(Opava), Gy¨orgy Vaszil (Debrecen, co-chair), Mikl´os Kr´esz (Szeged), Laurent Vuillon (Chamb´ery), Martin Kutrib (Giessen), Claudio Zandron (Milano). We thank the members of the Programme Committee for the evaluation of the submissions and their subreferees for their excellent cooperation in this work. We are grateful to the contributors of the conference AFL 2017, in particular to the invited speakers for presenting interesting new developments. We are grateful to the Department of Computer Science and the Faculty of Informatics of the University of Debrecen for the local organization and for the financial support of AFL 2017. September 2017 Erzs´ebet Csuhaj-Varj´u, Budapest P´al D¨om¨osi, Gy¨orgy Vaszil, Debrecen E. Csuhaj-Varj´u, P. D¨om¨osi, Gy. Vaszil v AFL 2017 Organizing Committee G´eza Horv´ath (Debrecen, co-chair) Ern˝on´eK´asa (Debrecen) Gy¨orgy Vaszil (Debrecen, co-chair) Ildik´oCserh´atin´eVecsei (Debrecen) AFL Steering Committee Andr´as Ad´am´ (Budapest, honorary chair) Istv´an Babcs´anyi (Budapest) Erzs´ebet Csuhaj-Varj´u(Budapest) P´al D¨om¨osi (Debrecen, chair) Zolt´an F¨ul¨op (Szeged) L´aszl´oHunyadv´ari (Budapest) L´aszl´oK´aszonyi (Szombathely) Attila Nagy (Budapest) Gy¨orgy Vaszil (Debrecen) List of subreviewers Zuzana Bedn´arov´a Robert Mercas¸ Emilie Charlier Mark-Jan Nederhof Lucie Ciencialov´a Pascal Ochem James Currie Erik Paul Stefan D¨uck Luca Prigioniero Zsolt Gazdag Michael Rao Kitti Gelle Juraj Sebejˇ Markus Holzer Shinnosuke Seki G´eza Horv´ath S´andor V´agv¨olgyi Sylvain Lombardy Matthias Wendlandt Ian McQuillan Automata and Formal Languages for Next Generation Sequencing Data Paola Bonizzoni Gianluca Della Vedova Department of Informatics, Systems and Communications Department of Informatics, Systems and Communications University of Milan-Bicocca, Milan, Italy University of Milan-Bicocca, Milan, Italy [email protected] [email protected] The advent of Next Generation Sequencing (NGS) technologies is characterized by the production of massive data consisting of short sequences (reads) and it has enabled the completion of several sequencing projects on entire populations. This talk focuses on the application of concepts from automata theory and formal languages to Bioinformatics, motivated by the repetitive nature that is intrinsic to the sequences that are produced with NGS technologies. The analysis of such data raises the need of formal tools that are able to take advantage of the similarities among sequences to index and compare NGS data in a memory (and hence time) efficient manner. We will explore some
Load more

Recommended publications
  • Formal Languages and Automata Theory Géza Horváth, Benedek Nagy Szerzői Jog © 2014 Géza Horváth, Benedek Nagy, University of Debrecen
    Formal Languages and Automata Theory Géza Horváth, Benedek Nagy Created by XMLmind XSL-FO Converter. Formal Languages and Automata Theory Géza Horváth, Benedek Nagy Szerzői jog © 2014 Géza Horváth, Benedek Nagy, University of Debrecen Created by XMLmind XSL-FO Converter. Tartalom Formal Languages and Automata Theory .......................................................................................... vi Introduction ...................................................................................................................................... vii 1. Elements of Formal Languages ...................................................................................................... 1 1. 1.1. Basic Terms .................................................................................................................... 1 2. 1.2. Formal Systems .............................................................................................................. 2 3. 1.3. Generative Grammars .................................................................................................... 5 4. 1.4. Chomsky Hierarchy ....................................................................................................... 6 2. Regular Languages and Finite Automata ...................................................................................... 12 1. 2.1. Regular Grammars ....................................................................................................... 12 2. 2.2. Regular Expressions ....................................................................................................
    [Show full text]
  • Extended Finite Autómata O Ver Group S
    Extended finite autómata o ver group s Víctor Mitrana , Ralf Stiebe Abstract Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for finite autómata over arbitrary groups. The closure properties of these autómata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abelian group to a finite automaton is less powerful than the addition of the multiplicative group of rational numbers. Thus, each language accepted by a finite au­ tomaton over an abelian group is actually a unordered vector language. Characterizations of the context-free and recursively enumerable languages classes are set up in the case of non-abelian groups. We investigate also deterministic finite autómata over groups, especially over abelian groups. Keywords: Finite autómata over groups; Closure properties; Accepting capacity; Interchange lemma; Free groups 1. Introduction One of the oldest and most investigated device in the autómata theory is the finite automaton. Many fundamental properties have been established and many problems are still open. Unfortunately, the finite autómata without any external control have a very limited accepting power. DirTerent directions of research have been considered for overcoming this limitation. The most known extensión added to a finite autómata is the pushdown memory. In this way, a considerable increasing of the accepting capacity has been achieved: the pushdown autómata are able to recognize all context-free languages. Another simple and natural extensión, related somehow to the pushdown memory, was considered in a series of papers [2,4,5], namely to associate an element of a given group to each configuration, but no information regarding the associated element is allowed.
    [Show full text]
  • A Second Course in Formal Languages and Automata Theory Jeffrey Shallit Index More Information
    Cambridge University Press 978-0-521-86572-2 - A Second Course in Formal Languages and Automata Theory Jeffrey Shallit Index More information Index 2DFA, 66 Berstel, J., 48, 106 2DPDA, 213 Biedl, T., 135 3-SAT, 21 Van Biesbrouck, M., 139 Birget, J.-C., 107 abelian cube, 47 blank symbol, B, 14 abelian square, 47, 137 Blum, N., 106 Ackerman, M., xi Boolean closure, 221 Adian, S. I., 43, 47, 48 Boolean grammar, 223 Aho, A. V., 173, 201, 223 Boolean matrices, 73, 197 Alces, A., 29 Boonyavatana, R., 139 alfalfa, 30, 34, 37 border, 35, 104 Allouche, J.-P., 48, 105 bordered, 222 alphabet, 1 bordered word, 35 unary, 1 Borges, M., xi always-halting TM, 209 Borwein, P., 48 ambiguous, 10 Boyd, D., 223 NFA, 102 Brady, A. H., 200 Angluin, D., 105 branch point, 113 angst Brandenburg, F.-J., 139 existential, 54 Brauer, W., 106 antisymmetric, 92 Brzozowski, J., 27, 106 assignment Bucher, W., 138 satisfying, 20 Buntrock, J., 200 automaton Burnside problem for groups, 42 pushdown, 11 Buss, J., xi, 223 synchronizing, 105 busy beaver problem, 183, 184, 200 two-way, 66 Axelrod, R. M., 105 calliope, 3 Cantor, D. C., 201 Bader, C., 138 Cantor set, 102 balanced word, 137 cardinality, 1 Bar-Hillel, Y., 201 census generating function, 133 Barkhouse, C., xi Cerny’s conjecture, 105 base alphabet, 4 Chaitin, G. J., 200 Berman, P., 200 characteristic sequence, 28 233 © Cambridge University Press www.cambridge.org Cambridge University Press 978-0-521-86572-2 - A Second Course in Formal Languages and Automata Theory Jeffrey Shallit Index More information 234 Index chess,
    [Show full text]
  • Applications of an Infinite Square-Free Co-Cfl”
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Theoretical Computer Science 49 (1987) 113-119 113 North-Holland APPLICATIONS OF AN INFINITE SQUARE-FREE CO-CFL” Michael G. MAIN Department of Computer Science, University of Colorado, Boulder, CO 80309, U.S.A. Walter BUCHER Institutes for information Processing, Technical Universify sf Graz, A-8010 Graz, Austria David HAUSSLER Department of Mathematics and Computer Science, University of Denver, Denver, CO 80208, U.S.A. Abstract. We disprove several conjectures about context-free languages. The proofs use the set of all strings which are nor prefixes of Thue’s infinite square-free sequence. This is a context-free language with an infinite square-free complement. 1. Introduction A square is an immediately repeated nonempty string, e.g., au, abub, newyorknewyork. A string x is called square-conruining if it contains a substring which is a square. For example, the string mississippi contains the segment iss twice in a row; in fact, mississippi contains a total of five squares. On the other hand, colorudo contains no squares (the character o appears several times, but not consecu- tively). A string without squares is called square-free. In a study of context-free languages, Autebert et al. [2,3] collected several conjectures about square-containing strings. One of the weakest conjectures was that no context-free language (CFL) could include all of the square-containing strings and still have an infinite complement. Contrary to this conjecture, such a language has recently been constructed [ 141.
    [Show full text]
  • INF2080 Context-Sensitive Langugaes
    INF2080 Context-Sensitive Langugaes Daniel Lupp Universitetet i Oslo 15th February 2017 Department of University of Informatics Oslo INF2080 Lecture :: 15th February 1 / 20 Context-Free Grammar Definition (Context-Free Grammar) A context-free grammar is a 4-tuple (V ; Σ; R; S) where 1 V is a finite set of variables 2 Σ is a finite set disjoint from V of terminals 3 R is a finite set of rules, each consisting of a variable and of a string of variables and terminals 4 and S is the start variable Rules are of the form A ! B1B2B3 ::: Bm, where A 2 V and each Bi 2 V [ Σ. INF2080 Lecture :: 15th February 2 / 20 consider the following toy programming language, where you can “declare” and “assign” a variable a value. S ! declare v; S j assign v : x; S this is context-free... but what if we only want to allow assignment after declaration and an infinite amount of variable names? ! context-sensitive! Why Context-Sensitive? Many building blocks of programming languages are context-free, but not all! INF2080 Lecture :: 15th February 3 / 20 this is context-free... but what if we only want to allow assignment after declaration and an infinite amount of variable names? ! context-sensitive! Why Context-Sensitive? Many building blocks of programming languages are context-free, but not all! consider the following toy programming language, where you can “declare” and “assign” a variable a value. S ! declare v; S j assign v : x; S INF2080 Lecture :: 15th February 3 / 20 but what if we only want to allow assignment after declaration and an infinite amount of variable names? ! context-sensitive! Why Context-Sensitive? Many building blocks of programming languages are context-free, but not all! consider the following toy programming language, where you can “declare” and “assign” a variable a value.
    [Show full text]
  • Automata and Grammars
    Automata and Grammars Prof. Dr. Friedrich Otto Fachbereich Elektrotechnik/Informatik, Universität Kassel 34109 Kassel, Germany E-mail: [email protected] SS 2018 Prof. Dr. F. Otto (Universität Kassel) Automata and Grammars 1 / 294 Lectures and Seminary SS 2018 Lectures: Thursday 9:00 - 10:30, Room S 11 Start: Thursday, February 22, 2018, 9:00. Seminary: Thursday 10:40 - 12:10, Room S 11 Start: Thursday, February 22, 2018, 10:40. Prof. Dr. F. Otto (Universität Kassel) Automata and Grammars 2 / 294 Exercises: From Thursday to Thursday next week! To pass seminary: At least two successful presentations in class (10 %) and passing of midtem exam on April 5 (10:40 - 11:40) (20 %) Final Exam: (dates have been fixed!) Written exam (2 hours) on May 31 (9:00 - 11:30) in S 11 Oral exam (30 minutes per student) on June 14 (9:00 - 12:30) in S 10 Written exam (2. try) on June 21 (9:00 - 11:30) in S 11 Oral exam (2. try) on June 28 (9:00 - 12:30) in S 11 The written exam accounts for 50 % of the final grade, while the oral exam accounts for 20 % of the final grade. Moodle: Course ”Automata and Grammars” NTIN071. Prof. Dr. F. Otto (Universität Kassel) Automata and Grammars 3 / 294 Literature: P.J. Denning, J.E. Dennis, J.E. Qualitz; Machines, Languages, and Computation. Prentice-Hall, Englewood Cliffs, N.J., 1978. M. Harrison; Introduction to Formal Language Theory. Addison-Wesley, Reading, M.A., 1978. J.E. Hopcroft, R. Motwani, J.D. Ullman; Introduction to Automata Theory, Languages, and Computation.
    [Show full text]
  • On the Language of Primitive Words*
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Theoretical Computer Science ELSEVIER Theoretical Computer Science 161 (1996) 141-156 On the language of primitive words* H. Petersen *J Universitiit Stuttgart, Institut fiir Informatik, Breitwiesenstr. 20-22, D-70565 Stuttgart, Germany Received April 1994; revised June 1995 Communicated by P. Enjalbert Abstract A word is primitive if it is not a proper power of a shorter word. We prove that the set Q of primitive words over an alphabet is not an unambiguous context-free language. This strengthens the previous result that Q cannot be deterministic context-free. Further we show that the same holds for the set L of Lyndon words. We investigate the complexity of Q and L. We show that there are families of constant-depth, polynomial-size, unbounded fan-in boolean circuits and two-way deterministic pushdown automata recognizing both languages. The latter result implies efficient decidability on the RAM model of computation and we analyze the number of comparisons required for deciding Q. Finally we give a new proof showing a related language not to be context-free, which only relies on properties of semi-linear and regular sets. 1. Introduction This paper presents some further steps towards characterizing the set of primitive words over some fixed alphabet in terms of classical formal language theory and com- plexity. The notion of primitivity of words plays a central role in algebraic coding theory [28] and combinatorial theory of words [23,24]. Recently attention has been drawn to the language Q of all primitive words over an alphabet with at least two symbols.
    [Show full text]
  • Languages Generated by Context-Free and Type AB → BA Rules
    Magyar Kutatók 8. Nemzetközi Szimpóziuma 8th International Symposium of Hungarian Researchers on Computational Intelligence and Informatics Languages Generated by Context-Free and Type AB → BA Rules Benedek Nagy Faculty of Informatics, University of Debrecen, H-4010 PO Box 12, Hungary, Research Group on Mathematical Linguistics, Rovira i Virgili University, Tarragona, Spain [email protected] Abstract: Derivations using branch-interchanging and language family obtained by context-free and interchange (AB → BA) rules are analysed. This language family is between the context-free and context-sensitive families helping to fill the gap between them. Closure properties are analysed. Only semi-linear languages can be generated in this way. Keywords: formal languages, Chomsky hierarchy, derivation trees, interchange (permutation) rule, semi-linear languages, mildly context-sensitivity 1 Introduction The Chomsky type grammars and the generated language families are one of the most basic and most important fields of theoretical computer science. The field is fairly old, the basic concepts and results are from the middle of the last century (see, for instance, [2, 6, 7]). The context-free grammars (and languages) are widely used due to their generating power and simple way of derivation. The derivation trees represent the context-free derivations. There is a big gap between the efficiency of context-free and context-sensitive grammars. There are very ‘simple’ non-context-free languages, for instance {an^2 |n ∈ N}, {anbncn|n ∈ N}, etc. It was known in the early 70’s that every context-sensitive language can be generated by rules only of the following types AB → AC, AB → BA, A → BC, A → B and A → a (where A,B,C are nonterminals and a is a terminal symbol).
    [Show full text]
  • Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector JOURNAL OF COMPUTER AND SYSTEM SCIENCES 30, 249-273 (1985) Pattern Selector Grammars and Several Parsing Algorithms in the Context-free Style J. GONCZAROWSKI AND E. SHAMIR* Institute of Mathematics and Computer Science, The Hebrew University of Jerusalem, Jerusalem 91904, Israel Received March 30, 1982; accepted March 5, 1985 Pattern selector grammars are defined in general. We concentrate on the study of special grammars, the pattern selectors of which contain precisely k “one% (0*( 10*)k) or k adjacent “one? (O*lkO*). This means that precisely k symbols (resp. k adjacent symbols) in each sen- tential form are rewritten. The main results concern parsing algorithms and the complexity of the membership problem. We first obtain a polynomial bound on the shortest derivation and hence an NP time bound for parsing. In the case k = 2, we generalize the well-known context- free dynamic programming type algorithms, which run in polynomial time. It is shown that the generated languages, for k = 2, are log-space reducible to the context-free languages. The membership problem is thus solvable in log2 space. 0 1985 Academic Press, Inc. 1. INTRODUCTION The parsing and membership testing algorithms for context-free (CF) grammars occupy a peculiar border position in the complexity hierarchy. The dynamic programming algorithm runs in 0(n3) steps [21], but more relined methods reduce the problem to matrix multiplication with O(n*+‘) run-time, where a < 1 ([20]. Earley’s algorithm runs in time O(n*) for grammars with bounded ambiguity [4].
    [Show full text]
  • Comparisons of Parikh's Condition
    J. Lopez, G. Ramos, and R. Morales, \Comparaci´onde la Condici´onde Parikh con algunas Condiciones de los Lenguajes de Contexto Libre", II Jornadas de Inform´atica y Autom´atica, pp. 305-314, 1996. NICS Lab. Publications: https://www.nics.uma.es/publications COMPARISONS OF PARIKH’S CONDITION TO OTHER CONDITIONS FOR CONTEXT-FREE LANGUAGES G. Ramos-Jiménez, J. López-Muñoz and R. Morales-Bueno E.T.S. de Ingeniería Informática - Universidad de Málaga Dpto. Lenguajes y Ciencias de la Computación P.O.B. 4114, 29080 - Málaga (SPAIN) e-mail: [email protected] Abstract: In this paper we first compare Parikh’s condition to various pumping conditions - Bar-Hillel’s pumping lemma, Ogden’s condition and Bader-Moura’s condition; secondly, to interchange condition; and finally, to Sokolowski’s and Grant’s conditions. In order to carry out these comparisons we present some properties of Parikh’s languages. The main result is the orthogonality of the previously mentioned conditions and Parikh’s condition. Keywords: Context-Free Languages, Parikh’s Condition, Pumping Lemmas, Interchange Condition, Sokolowski’s and Grant’s Condition. 1. INTRODUCTION The context-free grammars and the family of languages they describe, context free languages, were initially defined to formalize the grammatical properties of natural languages. Afterwards, their considerable practical importance was noticed, specially for defining programming languages, formalizing the notion of parsing, simplifying the translation of programming languages and in other string-processing applications. It’s very useful to discover the internal structure of a formal language class during its study. The determination of structural properties allows us to increase our knowledge about this language class.
    [Show full text]
  • CDM [1Ex]Context-Sensitive Grammars
    CDM Context-Sensitive Grammars Klaus Sutner Carnegie Mellon Universality 70-cont-sens 2017/12/15 23:17 1 Context-Sensitive Grammars Linear Bounded Automata LBA and Counting Where Are We? 3 Context-free languages based on grammars with productions A ! α are very important since they describe many aspects of programming languages and admit very efficient parsers. CFLs have a natural machine model (PDA) that is useful e.g. to evaluate arithmetic expressions. Properties of CFLs are mostly undecidable, Emptiness and Finiteness being notable exceptions. Postfix Calculators 4 Hewlett-Packard figured out 40 years ago the reverse Polish notation is by far the best way to perform lengthy arithmetic calculations. Very easy to implement with a stack. The old warhorse dc also uses RPN. 10 20 30 + * n 500 10 20 30 f 30 20 10 ^ n 1073741824000000000000000000000000000000 Languages versus Machines 5 Why the hedging about \aspects of programming languages"? Because some properties of programming language lie beyond the power of CFLs. Here is a classical example: variables must be declared before they can be used. begin int x; ... x = 17; ... end Obviously, we would want the compiler to address this kind of situation. Languages versus Machines 6 To deal with problems like this one we need to strengthen our grammars. The key is to remove the constraint of being \context-free." This leads to another important grammar based class of languages: context-sensitive languages. As it turns out, CSL are plenty strong enough to describe programming languages|but in the real world it does not matter, it is better to think of programming language as being context-free, plus a few extra constraints.
    [Show full text]
  • Extended Finite Automata Over Groups
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 108 (2001) 287–300 Extended ÿnite automata over groups Victor Mitranaa;∗;1, Ralf Stiebeb aFaculty of Mathematics, University of Bucharest, Str. Academiei 14, 70109, Bucharest, Romania bFaculty of Computer Science, University of Magdeburg, P.O. Box 4120, D-39016, Magdeburg, Germany Received 18 November 1998; revised 4 October 1999; accepted 31 January 2000 Abstract Some results from Dassow and Mitrana (Internat. J. Comput. Algebra (2000)), Griebach (Theoret. Comput. Sci. 7 (1978) 311) and Ibarra et al. (Theoret. Comput. Sci. 2 (1976) 271) are generalized for ÿnite automata over arbitrary groups. The closure properties of these automata are poorer and the accepting power is smaller when abelian groups are considered. We prove that the addition of any abelian group to a ÿnite automaton is less powerful than the addition of the multiplicative group of rational numbers. Thus, each language accepted by a ÿnite au- tomaton over an abelian group is actually a unordered vector language. Characterizations of the context-free and recursively enumerable languages classes are set up in the case of non-abelian groups. We investigate also deterministic ÿnite automata over groups, especially over abelian groups. ? 2001 Elsevier Science B.V. All rights reserved. Keywords: Finite automata over groups; Closure properties; Accepting capacity; Interchange lemma; Free groups 1. Introduction One of the oldest and most investigated device in the automata theory is the ÿnite automaton. Many fundamental properties have been established and many problems are still open.
    [Show full text]