Compositions of Bottom-Up Tree Series Transformations
|
|
- Nickolas Sherman
- 6 years ago
- Views:
Transcription
1 Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D Dresden, Germany maletti@tcs.inf.tu-dresden.de May 17, Motivation 2. Semirings, Tree Series, and Tree Series Substitution 3. Bottom-Up Tree Series Transducers 4. Composition Results a Financially supported by the German Research Foundation (DFG, GK 334) 1 May 17, 2005
2 Motivation Babel Fish Translation German Herzlich willkommen meine sehr geehrten Damen und Herren. Ich möchte mich vorab bei den Organisatoren für die vortrefflich geleistete Arbeit bedanken. English Cordially welcomely my very much honoured ladies and gentlemen. I would like to thank you first the supervisors for the splendid carried out work. Herzlich willkommen meine sehr geehrten Damen und Herren. Ich möchte mich vorab bei den Organisatoren, die diese Veranstaltung erst ermöglicht haben, für die vortrefflich geleistete Arbeit bedanken. Cordially welcomely my very much honoured ladies and gentlemen. I would like me first the supervisors, who made this meeting possible only, for whom splendid carried out work thank you. Motivation 2 May 17, 2005
3 Motivation Humans Conversation level?? Context, History Sentence level SENT NP ADJ NP VP (Tree) SENT NP ADJ NP VP (Tree) Grammar Word level Herzlich (String) Babel Fish Cordially (String) Motivation 3 May 17, 2005
4 Motivation Automatic translation is widely used (even Microsoft uses it to translate English documentation into German) Dictionaries are very powerful word-to-word translators; leave few words untranslated Outcome is nevertheless usually unhappy and ungrammatical Post-processing necessary Major problem: Ambiguity of natural language Common approach: Soft output (results equipped with a probability) Human choses the correct translation among the more likely ones Motivation 4 May 17, 2005
5 Motivation Humans Conversation level?? Context, History Sentence level SENT NP VP ADJ NP SENT NP VP ADV VP SENT NP VP ADJ NP SENT NP VP ADV VP Grammar Word level Herzlich... Babel Fish 0.9 Cordially Heartily... Motivation 5 May 17, 2005
6 Motivation Tree series transducers are a straightforward generalization of (i) tree transducers, which are applied in syntax-directed semantics, functional programming, and XML querying, (ii) weighted automata, which are applied in (tree) pattern matching, image compression and speech-to-text processing. Motivation 6 May 17, 2005
7 Generalization Hierarchy tree series transducer τ : T Σ A T weighted tree automaton L A T Σ weighted transducer τ : Σ A tree transducer τ : T Σ B T weighted automaton L A Σ tree automaton L B T Σ generalized sequential machine τ : Σ B string automaton L B Σ Motivation 7 May 17, 2005
8 Trees Σ ranked alphabet, Σ k Σ symbols of rank k, X = { x i i N + } T Σ (X) set of Σ-trees indexed by X, T Σ = T Σ ( ), t T Σ (X) is linear (resp., nondeleting) in Y X, if every y Y occurs at most (resp., at least) once in t, t[t 1,..., t k ] denotes the tree substitution of t i for x i in t Examples: Σ = {σ (2), γ (1), α (0), β (0) } and Y = {x 1, x 2 } σ σ γ γ σ α β x 1 σ ( σ(α, β), γ(x 1 ) ) x 1 x 2 γ ( σ(x 1, x 2 ) ) Semirings, Tree Series, and Tree Series Substitution 8 May 17, 2005
9 Semirings A semiring is an algebraic structure A = (A,, ) (A, ) is a commutative monoid with neutral element 0, (A, ) is a monoid with neutral element 1, 0 is absorbing wrt., and distributes over (from left and right). Examples: semiring of non-negative integers N = (N { }, +, ) Boolean semiring B = ({0, 1},, ) tropical semiring T = (N { }, min, +) any ring, field, etc. Semirings, Tree Series, and Tree Series Substitution 9 May 17, 2005
10 Properties of Semirings We say that A is commutative, if is commutative, idempotent, if a a = a, complete, if there is an operation I : AI A such that 1. i {m,n} a i = a m a n, 2. i I a i = ) j J ( i I j a i, if I = j J I j is a (generalized) partition of I, and 3. ( i I a ) ( i j J b ) j = i I,j J (a i b j ). Semiring Commutative Idempotent Complete N YES no YES B YES YES YES T YES YES YES Semirings, Tree Series, and Tree Series Substitution 10 May 17, 2005
11 Tree Series A = (A,, ) semiring, Σ ranked alphabet Mappings ϕ : T Σ (X) A are also called tree series the set of all tree series is A T Σ (X), the coefficient of t T Σ (X) in ϕ, i.e., ϕ(t), is denoted by (ϕ, t), the sum is defined pointwise (ϕ 1 ϕ 2, t) = (ϕ 1, t) (ϕ 2, t), the support of ϕ is supp(ϕ) = { t T Σ (X) (ϕ, t) 0 }, ϕ is linear (resp., nondeleting in Y X), if supp(ϕ) is a set of trees, which are linear (resp., nondeleting in Y), the series ϕ with supp(ϕ) = is denoted by 0. Example: ϕ = 1 α + 1 β + 3 σ(α, α) σ(β, β) + 5 σ(α, σ(α, α)) +... Semirings, Tree Series, and Tree Series Substitution 11 May 17, 2005
12 Tree Series Substitution A = (A,, ) complete semiring, ϕ, ψ 1,..., ψ k A T Σ (X) Pure substitution of (ψ 1,..., ψ k ) into ϕ: ϕ (ψ 1,..., ψ k ) = (ϕ, t) (ψ 1, t 1 ) (ψ k, t k ) t[t 1,..., t k ] t supp(ϕ), ( i [k]): t i supp(ψ i ) Example: 5 σ(x 1, x 1 ) (2 α 3 β) = 10 σ(α, α) 15 σ(β, β) σ σ σ 5 (2 α 3 β) = 10 x 1 x 1 α α 15 β β Semirings, Tree Series, and Tree Series Substitution 12 May 17, 2005
13 Tree Series Transducers Definition: A (bottom-up) tree series transducer (tst) is a system M = (Q, Σ,, A, F, µ) Q is a non-empty set of states, Σ and are input and output ranked alphabets, A = (A,, ) is a complete semiring, F A T (X 1 ) Q is a vector of linear and nondeleting tree series, also called final output, tree representation µ = ( µ k ) k N with µ k : Σ k A T (X k ) Q Qk. If Q is finite and µ k (σ) q, q is polynomial, then M is called finite. Tree Series Transducers 13 May 17, 2005
14 Semantics of Tree Series Transducers Mapping r : pos(t) Q is a run of M on the input tree t T Σ Run(t) set of all runs on t Evaluation mapping: eval r : pos(t) A T defined for every k N, lab t (p) Σ k by eval r (p) = µ k (lab t (p)) r(p),r(p 1)...r(p k) ( eval r (p 1),..., eval r (p k) ) Tree-series transformation induced by M is M : A T Σ A T defined M (ϕ) = ( ) eval r (ε) t T Σ r Run(t) Tree Series Transducers 14 May 17, 2005
15 Semantics Example M = (Q, Σ,, N, F, µ) with Q = {, }, Σ = {σ (2), α (0) } and = {γ (1), α (0) }, F = 0 and F = 1 x 1, and tree representation µ 0 (α) = 1 α µ 0 (α) = 1 α µ 2 (σ), = 1 α µ 2 (σ), = 1 x 1 µ 2 (σ), = 1 x 2 Tree Series Transducers 15 May 17, 2005
16 Semantics Example (cont.) Input tree t σ σ σ α α σ σ α α α α Run r on t M (1 t) = 2 γ(α) 4 γ 3 (α) Tree Series Transducers 16 May 17, 2005
17 Extension (Q, Σ,, A, F, µ) tree series transducer, q Q k, q Q, ϕ A T Σ (X k ) Definition: We define hµ q : T Σ (X k ) A T (X k ) Q hµ(x q 1 x i, if q = q i i ) q = 0, otherwise hµ(σ(t q 1,..., t k )) q = µ k (σ) q,p1...p k (hµ(t q 1 ) p1,..., hµ(t q k ) pk ) p 1,...,p k Q We define hµ q : A T Σ (X k ) A T (X k ) Q by hµ(ϕ) q q = (ϕ, t) hµ(t) q q t T Σ (X k ) Composition results 17 May 17, 2005
18 Composition Construction M 1 = (Q 1, Σ,, A, F 1, µ 1 ) and M 2 = (Q 2,, Γ, A, F 2, µ 2 ) tree series transducer Definition: The product of M 1 and M 2, denoted by M 1 M 2, is the tree series transducer M = (Q 1 Q 2, Σ, Γ, A, F, µ) F pq = i Q 2 (F 2 ) i h q µ 2 ( (F1 ) p ) i µ k (σ) pq,(p1 q 1,...,p k q k ) = h q 1...q k µ 2 ( (µ1 ) k (σ) p,p1...p k )q. Composition results 18 May 17, 2005
19 Composition On subtree: t a = M1 u b = M2 v Deletion: a a = M1 b = M2 t t u u v Composition results 19 May 17, 2005
20 Composition (cont.) On subtree: t a b = M1 M 2 v Deletion: t t a a b b = M1 M 2 v v Composition results 20 May 17, 2005
21 Main Theorem A commutative and complete semiring Main Theorem l-bot ts-ts (A) BOT ts-ts (A) = BOT ts-ts (A). BOT ts-ts (A) db-bot ts-ts (A) = BOT ts-ts (A), BOT ts-ts (A) d-bot ts-ts (A) = BOT ts-ts (A), provided that A is multiplicatively idempotent, Composition results 21 May 17, 2005
22 References [Borchardt 04] B. Borchardt: Code Selection by Tree Series Transducers. CIAA 04, Kingston, Canada, to appear [Engelfriet et al 02] J. Engelfriet, Z. Fülöp, and H. Vogler: Bottom-up and Topdown Tree Series Transformations. Journal of Automata, Languages, and Combinatorics 7:11 70, 2002 [Fülöp et al 03] Z. Fülöp and H. Vogler: Tree Series Transformations that Respect Copying. Theory of Computing Systems 36: , 2003 [Kuich 99] W. Kuich: Tree Transducers and Formal Tree Series. Acta Cybernetica 14: , 1999 Composition results 22 May 17, 2005
Compositions of Bottom-Up Tree Series Transformations
Compositions of Bottom-Up Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de May 27, 2005 1. Motivation
More informationCompositions of Tree Series Transformations
Compositions of Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2.
More informationHierarchies of Tree Series TransducersRevisited 1
Hierarchies of Tree Series TransducersRevisited 1 Andreas Maletti 2 Technische Universität Dresden Fakultät Informatik June 27, 2006 1 Financially supported by the Friends and Benefactors of TU Dresden
More informationThe Power of Tree Series Transducers
The Power of Tree Series Transducers Andreas Maletti 1 Technische Universität Dresden Fakultät Informatik June 15, 2006 1 Research funded by German Research Foundation (DFG GK 334) Andreas Maletti (TU
More informationHasse Diagrams for Classes of Deterministic Bottom-Up Tree-to-Tree-Series Transformations
Hasse Diagrams for Classes of Deterministic Bottom-Up Tree-to-Tree-Series Transformations Andreas Maletti 1 Technische Universität Dresden Fakultät Informatik D 01062 Dresden Germany Abstract The relationship
More informationRELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA
International Journal of Foundations of Computer Science Vol. 16, No. 4 (2005) 723 741 c World Scientific Publishing Company RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA ANDREAS MALETTI
More informationPure and O-Substitution
International Journal of Foundations of Computer Science c World Scientific Publishing Company Pure and O-Substitution Andreas Maletti Department of Computer Science, Technische Universität Dresden 01062
More informationStatistical Machine Translation of Natural Languages
1/26 Statistical Machine Translation of Natural Languages Heiko Vogler Technische Universität Dresden Germany Graduiertenkolleg Quantitative Logics and Automata Dresden, November, 2012 1/26 Weighted Tree
More informationMinimization of Weighted Automata
Minimization of Weighted Automata Andreas Maletti Universitat Rovira i Virgili Tarragona, Spain Wrocław May 19, 2010 Minimization of Weighted Automata Andreas Maletti 1 In Collaboration with ZOLTÁN ÉSIK,
More informationIncomparability Results for Classes of Polynomial Tree Series Transformations
Journal of Automata, Languages and Combinatorics 10 (2005) 4, 535{568 c Otto-von-Guericke-Universitat Magdeburg Incomparability Results for Classes of Polynomial Tree Series Transformations Andreas Maletti
More informationApplications of Tree Automata Theory Lecture VI: Back to Machine Translation
Applications of Tree Automata Theory Lecture VI: Back to Machine Translation Andreas Maletti Institute of Computer Science Universität Leipzig, Germany on leave from: Institute for Natural Language Processing
More informationMANFRED DROSTE AND WERNER KUICH
Logical Methods in Computer Science Vol. 14(1:21)2018, pp. 1 14 https://lmcs.episciences.org/ Submitted Jan. 31, 2017 Published Mar. 06, 2018 WEIGHTED ω-restricted ONE-COUNTER AUTOMATA Universität Leipzig,
More informationPreservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers
Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers Nina eemann and Daniel Quernheim and Fabienne Braune and Andreas Maletti University of tuttgart, Institute for Natural
More informationApplications of Tree Automata Theory Lecture V: Theory of Tree Transducers
Applications of Tree Automata Theory Lecture V: Theory of Tree Transducers Andreas Maletti Institute of Computer Science Universität Leipzig, Germany on leave from: Institute for Natural Language Processing
More informationLecture 7: Introduction to syntax-based MT
Lecture 7: Introduction to syntax-based MT Andreas Maletti Statistical Machine Translation Stuttgart December 16, 2011 SMT VII A. Maletti 1 Lecture 7 Goals Overview Tree substitution grammars (tree automata)
More informationOctober 23, concept of bottom-up tree series transducer and top-down tree series transducer, respectively,
Bottom-up and Top-down Tree Series Transformations oltan Fulop Department of Computer Science University of Szeged Arpad ter., H-670 Szeged, Hungary E-mail: fulop@inf.u-szeged.hu Heiko Vogler Department
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationA Weak Bisimulation for Weighted Automata
Weak Bisimulation for Weighted utomata Peter Kemper College of William and Mary Weighted utomata and Semirings here focus on commutative & idempotent semirings Weak Bisimulation Composition operators Congruence
More informationStatistical Machine Translation of Natural Languages
1/37 Statistical Machine Translation of Natural Languages Rule Extraction and Training Probabilities Matthias Büchse, Toni Dietze, Johannes Osterholzer, Torsten Stüber, Heiko Vogler Technische Universität
More informationPath Queries under Distortions: Answering and Containment
Path Queries under Distortions: Answering and Containment Gosta Grahne Concordia University Alex Thomo Suffolk University Foundations of Information and Knowledge Systems (FoIKS 04) Postulate 1 The world
More informationCompositions of Top-down Tree Transducers with ε-rules
Compositions of Top-down Tree Transducers with ε-rules Andreas Maletti 1, and Heiko Vogler 2 1 Universitat Rovira i Virgili, Departament de Filologies Romàniques Avinguda de Catalunya 35, 43002 Tarragona,
More informationKleene Algebra and Arden s Theorem. Anshul Kumar Inzemamul Haque
Kleene Algebra and Arden s Theorem Anshul Kumar Inzemamul Haque Motivation Regular Expression is a Kleene Algebra. We can use the properties and theorems of Kleene Algebra to simplify regular expressions
More informationSYLLABUS. Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 3 : REGULAR EXPRESSIONS AND LANGUAGES
Contents i SYLLABUS UNIT - I CHAPTER - 1 : AUT UTOMA OMATA Introduction to Finite Automata, Central Concepts of Automata Theory. CHAPTER - 2 : FINITE AUT UTOMA OMATA An Informal Picture of Finite Automata,
More informationWeighted Monadic Datalog Tree Transducers
Weighted Monadic Datalog Tree Transducers Daniel Geisler, Torsten Stüber Faculty of Computer Science, Technische Universität Dresden D-01062 Dresden, Germany {geisler,stueber}@tcs.inf.tu-dresden.de December
More informationComposition Closure of ε-free Linear Extended Top-down Tree Transducers
Composition Closure of ε-free Linear Extended Top-down Tree Transducers Zoltán Fülöp 1, and Andreas Maletti 2, 1 Department of Foundations of Computer Science, University of Szeged Árpád tér 2, H-6720
More informationPeter Wood. Department of Computer Science and Information Systems Birkbeck, University of London Automata and Formal Languages
and and Department of Computer Science and Information Systems Birkbeck, University of London ptw@dcs.bbk.ac.uk Outline and Doing and analysing problems/languages computability/solvability/decidability
More informationAdvanced Automata Theory 10 Transducers and Rational Relations
Advanced Automata Theory 10 Transducers and Rational Relations Frank Stephan Department of Computer Science Department of Mathematics National University of Singapore fstephan@comp.nus.edu.sg Advanced
More informationTheoretical Foundations of the UML
Theoretical Foundations of the UML Lecture 17+18: A Logic for MSCs Joost-Pieter Katoen Lehrstuhl für Informatik 2 Software Modeling and Verification Group moves.rwth-aachen.de/teaching/ws-1718/fuml/ 5.
More informationRandom Generation of Nondeterministic Tree Automata
Random Generation of Nondeterministic Tree Automata Thomas Hanneforth 1 and Andreas Maletti 2 and Daniel Quernheim 2 1 Department of Linguistics University of Potsdam, Germany 2 Institute for Natural Language
More informationA Little Logic. Propositional Logic. Satisfiability Problems. Solving Sudokus. First Order Logic. Logic Programming
A Little Logic International Center for Computational Logic Technische Universität Dresden Germany Propositional Logic Satisfiability Problems Solving Sudokus First Order Logic Logic Programming A Little
More informationBisimulation Minimisation for Weighted Tree Automata
Bisimulation Minimisation for Weighted Tree Automata Johanna Högberg 1, Andreas Maletti 2, and Jonathan May 3 1 Department of Computing Science, Umeå University S 90187 Umeå, Sweden johanna@cs.umu.se 2
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationHarvard CS 121 and CSCI E-207 Lecture 9: Regular Languages Wrap-Up, Context-Free Grammars
Harvard CS 121 and CSCI E-207 Lecture 9: Regular Languages Wrap-Up, Context-Free Grammars Salil Vadhan October 2, 2012 Reading: Sipser, 2.1 (except Chomsky Normal Form). Algorithmic questions about regular
More informationSolving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory
Solving weakly linear inequalities for matrices over max-plus semiring and applications to automata theory Nada Damljanović University of Kragujevac, Faculty of Technical Sciences in Čačak, Serbia nada.damljanovic@ftn.kg.ac.rs
More informationFrom Monadic Second-Order Definable String Transformations to Transducers
From Monadic Second-Order Definable String Transformations to Transducers Rajeev Alur 1 Antoine Durand-Gasselin 2 Ashutosh Trivedi 3 1 University of Pennsylvania 2 LIAFA, Université Paris Diderot 3 Indian
More informationWeighted Tree-Walking Automata
Acta Cybernetica 19 (2009) 275 293. Weighted Tree-Walking Automata Zoltán Fülöp and Loránd Muzamel Abstract We define weighted tree-walking automata. We show that the class of tree series recognizable
More informationMusic as a Formal Language
Music as a Formal Language Finite-State Automata and Pd Bryan Jurish moocow@ling.uni-potsdam.de Universität Potsdam, Institut für Linguistik, Potsdam, Germany pd convention 2004 / Jurish / Music as a formal
More informationLecture 9: Decoding. Andreas Maletti. Stuttgart January 20, Statistical Machine Translation. SMT VIII A. Maletti 1
Lecture 9: Decoding Andreas Maletti Statistical Machine Translation Stuttgart January 20, 2012 SMT VIII A. Maletti 1 Lecture 9 Last time Synchronous grammars (tree transducers) Rule extraction Weight training
More informationHow to train your multi bottom-up tree transducer
How to train your multi bottom-up tree transducer Andreas Maletti Universität tuttgart Institute for Natural Language Processing tuttgart, Germany andreas.maletti@ims.uni-stuttgart.de Portland, OR June
More informationM. Droste and P. Gastin. Weighted automata and weighted logics
M. Droste and P. Gastin Weighted automata and weighted logics Research Report LSV-05-13 July 2005 Weighted automata and weighted logics Manfred Droste 1 and Paul Gastin 2 1 Institut für Informatik, Universität
More informationDecision Problems of Tree Transducers with Origin
Decision Problems of Tree Transducers with Origin Emmanuel Filiot a, Sebastian Maneth b, Pierre-Alain Reynier 1, Jean-Marc Talbot 1 a Université Libre de Bruxelles & FNRS b University of Edinburgh c Aix-Marseille
More informationComputability and Complexity
Computability and Complexity Sequences and Automata CAS 705 Ryszard Janicki Department of Computing and Software McMaster University Hamilton, Ontario, Canada janicki@mcmaster.ca Ryszard Janicki Computability
More informationGeneric ǫ-removal and Input ǫ-normalization Algorithms for Weighted Transducers
International Journal of Foundations of Computer Science c World Scientific Publishing Company Generic ǫ-removal and Input ǫ-normalization Algorithms for Weighted Transducers Mehryar Mohri mohri@research.att.com
More informationFinite-State Transducers
Finite-State Transducers - Seminar on Natural Language Processing - Michael Pradel July 6, 2007 Finite-state transducers play an important role in natural language processing. They provide a model for
More informationWeighted automata and weighted logics
Weighted automata and weighted logics Manfred Droste 1 and Paul Gastin 2 1 Institut für Informatik, Universität Leipzig Augustusplatz 10-11, D-04109 Leipzig, Germany, droste@informatik.uni-leipzig.de 2
More informationIntroduction to Finite Automaton
Lecture 1 Introduction to Finite Automaton IIP-TL@NTU Lim Zhi Hao 2015 Lecture 1 Introduction to Finite Automata (FA) Intuition of FA Informally, it is a collection of a finite set of states and state
More informationP Finite Automata and Regular Languages over Countably Infinite Alphabets
P Finite Automata and Regular Languages over Countably Infinite Alphabets Jürgen Dassow 1 and György Vaszil 2 1 Otto-von-Guericke-Universität Magdeburg Fakultät für Informatik PSF 4120, D-39016 Magdeburg,
More informationOn Fixed Point Equations over Commutative Semirings
On Fixed Point Equations over Commutative Semirings Javier Esparza, Stefan Kiefer, and Michael Luttenberger Universität Stuttgart Institute for Formal Methods in Computer Science Stuttgart, Germany {esparza,kiefersn,luttenml}@informatik.uni-stuttgart.de
More informationFinite-state Machines: Theory and Applications
Finite-state Machines: Theory and Applications Unweighted Finite-state Automata Thomas Hanneforth Institut für Linguistik Universität Potsdam December 10, 2008 Thomas Hanneforth (Universität Potsdam) Finite-state
More informationWeighted Specifications over Nested Words
Weighted Specifications over Nested Words Benedikt Bollig 1, Paul Gastin 1, and Benjamin Monmege 1 LSV, ENS Cachan, CNRS & Inria, France firstname.lastname@lsv.ens-cachan.fr Abstract. This paper studies
More information1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u,
1. Draw a parse tree for the following derivation: S C A C C A b b b b A b b b b B b b b b a A a a b b b b a b a a b b 2. Show on your parse tree u, v, x, y, z as per the pumping theorem. 3. Prove that
More informationReasoning about Time and Reliability
Reasoning about Time and Reliability Probabilistic CTL model checking Daniel Bruns Institut für theoretische Informatik Universität Karlsruhe 13. Juli 2007 Seminar Theorie und Anwendung von Model Checking
More informationCylindrical Algebraic Decomposition in Coq
Cylindrical Algebraic Decomposition in Coq MAP 2010 - Logroño 13-16 November 2010 Assia Mahboubi INRIA Microsoft Research Joint Centre (France) INRIA Saclay Île-de-France École Polytechnique, Palaiseau
More informationLogical Characterization of Weighted Pebble Walking Automata
Logical Characterization of Weighted Pebble Walking Automata Benjamin Monmege Université libre de Bruxelles, Belgium Benedikt Bollig and Paul Gastin (LSV, ENS Cachan, France) Marc Zeitoun (LaBRI, Bordeaux
More informationSolving fixed-point equations over semirings
Solving fixed-point equations over semirings Javier Esparza Technische Universität München Joint work with Michael Luttenberger and Maximilian Schlund Fixed-point equations We study systems of equations
More informationHarvard CS 121 and CSCI E-207 Lecture 10: Ambiguity, Pushdown Automata
Harvard CS 121 and CSCI E-207 Lecture 10: Ambiguity, Pushdown Automata Salil Vadhan October 4, 2012 Reading: Sipser, 2.2. Another example of a CFG (with proof) L = {x {a, b} : x has the same # of a s and
More informationWeighted tree automata and weighted logics
Theoretical Computer Science 366 (2006) 228 247 www.elsevier.com/locate/tcs Weighted tree automata and weighted logics Manfred Droste a,, Heiko Vogler b a Institute of Computer Science, Leipzig University,
More informationUNIT II REGULAR LANGUAGES
1 UNIT II REGULAR LANGUAGES Introduction: A regular expression is a way of describing a regular language. The various operations are closure, union and concatenation. We can also find the equivalent regular
More informationDatabase Theory VU , SS Complexity of Query Evaluation. Reinhard Pichler
Database Theory Database Theory VU 181.140, SS 2018 5. Complexity of Query Evaluation Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 17 April, 2018 Pichler
More informationEFFICIENT ALGORITHMS FOR TESTING THE TWINS PROPERTY
Journal of Automata, Languages and Combinatorics u (v) w, x y c Otto-von-Guericke-Universität Magdeburg EFFICIENT ALGORITHMS FOR TESTING THE TWINS PROPERTY Cyril Allauzen AT&T Labs Research 180 Park Avenue
More informationA Logical Characterization for Weighted Event-Recording Automata
A Logical Characterization for Weighted Event-Recording Automata June 23, 2009 Karin Quaas Institut für Informatik, Universität Leipzig 04009 Leipzig, Germany quaas@informatik.uni-leipzig.de Abstract.
More informationMax-plus automata and Tropical identities
Max-plus automata and Tropical identities Laure Daviaud University of Warwick Oxford, 01-02-2018 A natural and fundamental question: u v A A [[A](u) = [[A](v)? 2/18 A natural and fundamental question:
More informationFinite Automata Theory and Formal Languages TMV026/TMV027/DIT321 Responsible: Ana Bove
Finite Automata Theory and Formal Languages TMV026/TMV027/DIT321 Responsible: Ana Bove Tuesday 28 of May 2013 Total: 60 points TMV027/DIT321 registration VT13 TMV026/DIT321 registration before VT13 Exam
More informationTuring Machines and Time Complexity
Turing Machines and Time Complexity Turing Machines Turing Machines (Infinitely long) Tape of 1 s and 0 s Turing Machines (Infinitely long) Tape of 1 s and 0 s Able to read and write the tape, and move
More informationEinführung in die Computerlinguistik
Einführung in die Computerlinguistik Context-Free Grammars (CFG) Laura Kallmeyer Heinrich-Heine-Universität Düsseldorf Summer 2016 1 / 22 CFG (1) Example: Grammar G telescope : Productions: S NP VP NP
More informationMATH 433 Applied Algebra Lecture 22: Semigroups. Rings.
MATH 433 Applied Algebra Lecture 22: Semigroups. Rings. Groups Definition. A group is a set G, together with a binary operation, that satisfies the following axioms: (G1: closure) for all elements g and
More informationProofs, Strings, and Finite Automata. CS154 Chris Pollett Feb 5, 2007.
Proofs, Strings, and Finite Automata CS154 Chris Pollett Feb 5, 2007. Outline Proofs and Proof Strategies Strings Finding proofs Example: For every graph G, the sum of the degrees of all the nodes in G
More informationComputational Models - Lecture 4
Computational Models - Lecture 4 Regular languages: The Myhill-Nerode Theorem Context-free Grammars Chomsky Normal Form Pumping Lemma for context free languages Non context-free languages: Examples Push
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationWeighted Logics for Nested Words and Algebraic Formal Power Series
Weighted Logics for Nested Words and Algebraic Formal Power Series Christian Mathissen Institut für Informatik, Universität Leipzig D-04009 Leipzig, Germany mathissen@informatik.uni-leipzig.de Abstract.
More informationKleene modules and linear languages
The Journal of Logic and Algebraic Programming 66 (2006) 185 194 THE JOURNAL OF LOGIC AND ALGEBRAIC PROGRAMMING wwwelseviercom/locate/jlap Kleene modules and linear languages Hans Leiß Centrum für Informations-
More informationCall-by-value non-determinism in a linear logic type discipline
Call-by-value non-determinism in a linear logic type discipline Alejandro Díaz-Caro? Giulio Manzonetto Université Paris-Ouest & INRIA LIPN, Université Paris 13 Michele Pagani LIPN, Université Paris 13
More informationAxioms of Kleene Algebra
Introduction to Kleene Algebra Lecture 2 CS786 Spring 2004 January 28, 2004 Axioms of Kleene Algebra In this lecture we give the formal definition of a Kleene algebra and derive some basic consequences.
More informationWeighted Finite-State Transducer Algorithms An Overview
Weighted Finite-State Transducer Algorithms An Overview Mehryar Mohri AT&T Labs Research Shannon Laboratory 80 Park Avenue, Florham Park, NJ 0793, USA mohri@research.att.com May 4, 004 Abstract Weighted
More informationMeasuring Defects in Finite Automata
Doctoral Thesis Katja Meckel 1 st Reviewer (Supervisor): Prof. Dr. Martin Kutrib 2 nd Reviewer: Prof. Dr. Markus Holzer Fachbereich 07 - Mathematik und Informatik, Physik, Geographie Institut für Informatik
More information3130CIT Theory of Computation
GRIFFITH UNIVERSITY School of Computing and Information Technology 3130CIT Theory of Computation Final Examination, Semester 2, 2006 Details Total marks: 120 (40% of the total marks for this subject) Perusal:
More informationDecision Problems of Tree Transducers with Origin
Decision Problems of Tree Transducers with Origin Emmanuel Filiot 1, Sebastian Maneth 2, Pierre-Alain Reynier 3, and Jean-Marc Talbot 3 1 Université Libre de Bruxelles 2 University of Edinburgh 3 Aix-Marseille
More informationAutomata Theory and Formal Grammars: Lecture 1
Automata Theory and Formal Grammars: Lecture 1 Sets, Languages, Logic Automata Theory and Formal Grammars: Lecture 1 p.1/72 Sets, Languages, Logic Today Course Overview Administrivia Sets Theory (Review?)
More informationA Disambiguation Algorithm for Weighted Automata
A Disambiguation Algorithm for Weighted Automata Mehryar Mohri a,b and Michael D. Riley b a Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, NY 10012. b Google Research, 76 Ninth
More informationPebble weighted automata and transitive closure logics
Pebble weighted automata and transitive closure logics Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun To cite this version: Benedikt Bollig, Paul Gastin, Benjamin Monmege, Marc Zeitoun. Pebble
More informationAcceptance of!-languages by Communicating Deterministic Turing Machines
Acceptance of!-languages by Communicating Deterministic Turing Machines Rudolf Freund Institut für Computersprachen, Technische Universität Wien, Karlsplatz 13 A-1040 Wien, Austria Ludwig Staiger y Institut
More informationUnranked Tree Automata with Sibling Equalities and Disequalities
Unranked Tree Automata with Sibling Equalities and Disequalities Wong Karianto Christof Löding Lehrstuhl für Informatik 7, RWTH Aachen, Germany 34th International Colloquium, ICALP 2007 Xu Gao (NFS) Unranked
More informationTheory Bridge Exam Example Questions
Theory Bridge Exam Example Questions Annotated version with some (sometimes rather sketchy) answers and notes. This is a collection of sample theory bridge exam questions. This is just to get some idea
More informationHIERARCHIES OF WEAKLY MONOTONE RESTARTING AUTOMATA
HIERARCHIES OF WEAKLY MONOTONE RESTARTING AUTOMATA František Mráz 1 Department of Computer Science, Charles University Malostranské nám 25, 118 00 Praha 1, Czech Republic e-mail: mraz@ksvimsmffcunicz and
More informationProvenance Semirings. Todd Green Grigoris Karvounarakis Val Tannen. presented by Clemens Ley
Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place of origin Provenance Semirings Todd Green Grigoris Karvounarakis Val Tannen presented by Clemens Ley place
More informationAn Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California. 2. Background: Semirings and Kleene algebras
An Overview of Residuated Kleene Algebras and Lattices Peter Jipsen Chapman University, California 1. Residuated Lattices with iteration 2. Background: Semirings and Kleene algebras 3. A Gentzen system
More informationAC68 FINITE AUTOMATA & FORMULA LANGUAGES DEC 2013
Q.2 a. Prove by mathematical induction n 4 4n 2 is divisible by 3 for n 0. Basic step: For n = 0, n 3 n = 0 which is divisible by 3. Induction hypothesis: Let p(n) = n 3 n is divisible by 3. Induction
More informationThe Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees
The Complexity of Computing the Behaviour of Lattice Automata on Infinite Trees Karsten Lehmann a, Rafael Peñaloza b a Optimisation Research Group, NICTA Artificial Intelligence Group, Australian National
More informationIntroduction to Computers & Programming
16.070 Introduction to Computers & Programming Theory of computation: What is a computer? FSM, Automata Prof. Kristina Lundqvist Dept. of Aero/Astro, MIT Models of Computation What is a computer? If you
More informationFuzzy Tree Transducers
Advances in Fuzzy Mathematics. ISSN 0973-533X Volume 11, Number 2 (2016), pp. 99-112 Research India Publications http://www.ripublication.com Fuzzy Tree Transducers S. R. Chaudhari and M. N. Joshi Department
More informationBisimulation Minimisation of Weighted Tree Automata
Bisimulation Minimisation of Weighted Tree Automata Johanna Högberg Department of Computing Science, Umeå University S 90187 Umeå, Sweden Andreas Maletti Faculty of Computer Science, Technische Universität
More informationCS6901: review of Theory of Computation and Algorithms
CS6901: review of Theory of Computation and Algorithms Any mechanically (automatically) discretely computation of problem solving contains at least three components: - problem description - computational
More informationKleene Algebras and Algebraic Path Problems
Kleene Algebras and Algebraic Path Problems Davis Foote May 8, 015 1 Regular Languages 1.1 Deterministic Finite Automata A deterministic finite automaton (DFA) is a model of computation that can simulate
More informationCOMP/MATH 300 Topics for Spring 2017 June 5, Review and Regular Languages
COMP/MATH 300 Topics for Spring 2017 June 5, 2017 Review and Regular Languages Exam I I. Introductory and review information from Chapter 0 II. Problems and Languages A. Computable problems can be expressed
More informationKey words. tree transducer, natural language processing, hierarchy, composition closure
THE POWER OF EXTENDED TOP-DOWN TREE TRANSDUCERS ANDREAS MALETTI, JONATHAN GRAEHL, MARK HOPKINS, AND KEVIN KNIGHT Abstract. Extended top-down tree transducers (transducteurs généralisés descendants [Arnold,
More informationThe Power of Weighted Regularity-Preserving Multi Bottom-up Tree Transducers
International Journal of Foundations of Computer cience c World cientific Publishing Company The Power of Weighted Regularity-Preserving Multi Bottom-up Tree Transducers ANDREA MALETTI Universität Leipzig,
More informationCS:4330 Theory of Computation Spring Regular Languages. Finite Automata and Regular Expressions. Haniel Barbosa
CS:4330 Theory of Computation Spring 2018 Regular Languages Finite Automata and Regular Expressions Haniel Barbosa Readings for this lecture Chapter 1 of [Sipser 1996], 3rd edition. Sections 1.1 and 1.3.
More informationUsing Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries Jose Oncina Dept. Lenguajes y Sistemas Informáticos - Universidad de Alicante oncina@dlsi.ua.es September
More informationFoundations of Informatics: a Bridging Course
Foundations of Informatics: a Bridging Course Week 3: Formal Languages and Semantics Thomas Noll Lehrstuhl für Informatik 2 RWTH Aachen University noll@cs.rwth-aachen.de http://www.b-it-center.de/wob/en/view/class211_id948.html
More information