Publications
Article · May 1, 2000
A redefinition of Embedded Push-Down Automata ∗
Miguel Á. Alonso, Éric Villemonte de la Clergerie, Jesús Vilares
Abstract
A new definition of Embedded Push-Down Automata is provided. We prove this new definition preserves the equivalence with tree adjoining languages and we provide a tabulation framework to execute any automaton in polynomial time with respect to the length of the input string. 1.
semigroups and automata theorySyntax, Semantics, Linguistic VariationAlgorithms and Data Compressionautomaton equivalencetabulationformal language theory
More by Miguel Alonso
- Public Sentiment Analysis and Topic Modeling Regarding COVID-19’s Three Waves of Total Lockdown: A Case Study on Movement Control Order in MalaysiaKSII Transactions on Internet and Information Systems · 2022 · Citations: 11
- Construction and Evaluation of Sentiment Datasets for Low-Resource Languages: The Case of UzbekLecture notes in computer science · 2022 · Citations: 42
- Sentiment Analysis for Fake News DetectionElectronics · 2021 · Citations: 270
- On the Use of Parsing for Named Entity RecognitionApplied Sciences · 2021 · Citations: 24
