An XML Format Proposal for the Description of Weighted Automata, Transducers and Regular Expressions

被引:0
|
作者
Demaille, Akim
Duret-Lutz, Alexandre
Lesaint, Florian
Lombardy, Sylvain
Sakarovitch, Jacques
Terrones, Florent
机构
来源
FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING | 2009年 / 191卷
关键词
XML format; finite automata; weighted automata; transducers; regular expressions; LIBRARY;
D O I
10.3233/978-1-58603-975-2-199
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present an XML format that allows to describe a large class of finite weighted automata and transducers. Our design choices stem from our policy of making the implementation as simple as possible. This format has been tested for the communication between the modules of our automata manipulation platform vaucanson, but this document is less an experiment report than a position paper intended to open the discussion among the community of automata software writers.
引用
收藏
页码:199 / 206
页数:8
相关论文
共 50 条
  • [31] Construction of fuzzy automata from fuzzy regular expressions
    Stamenkovic, Aleksandar
    Ciric, Miroslav
    FUZZY SETS AND SYSTEMS, 2012, 199 : 1 - 27
  • [32] Twinning Automata and Regular Expressions for String Static Analysis
    Negrini, Luca
    Arceri, Vincenzo
    Ferrara, Pietro
    Cortesi, Agostino
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, VMCAI 2021, 2021, 12597 : 267 - 290
  • [33] AMORE - A SYSTEM FOR COMPUTING AUTOMATA, MONOIDS, AND REGULAR EXPRESSIONS
    KELL, V
    MAIER, A
    POTTHOFF, A
    THOMAS, W
    WERMUTH, U
    LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 537 - 538
  • [34] Efficient transformations from regular expressions to finite automata
    Seibert, S
    DEVELOPMENTS IN LANGUAGE THEORY, 2003, 2450 : 28 - 42
  • [35] Series-Parallel Automata and Short Regular Expressions
    Moreira, Nelma
    Reis, Rogerio
    FUNDAMENTA INFORMATICAE, 2009, 91 (3-4) : 611 - 629
  • [36] COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
    Lohrey, Markus
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2010, 21 (05) : 817 - 841
  • [37] Parallel Algorithms for Constructing Fellow Automata of Regular Expressions
    Sun Yuqiang
    Yang Ruimin
    Gu Yuwan
    You Jing
    FIRST INTERNATIONAL WORKSHOP ON DATABASE TECHNOLOGY AND APPLICATIONS, PROCEEDINGS, 2009, : 57 - +
  • [38] AVERAGE SIZE OF AUTOMATA CONSTRUCTIONS FROM REGULAR EXPRESSIONS
    Pighizzini, Giovanni
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2015, European Association for Theoretical Computer Science (116): : 167 - 191
  • [39] ON THE EQUIVALENCE AND CONTAINMENT PROBLEMS FOR UNAMBIGUOUS REGULAR EXPRESSIONS, REGULAR GRAMMARS AND FINITE AUTOMATA
    STEARNS, RE
    HUNT, HB
    SIAM JOURNAL ON COMPUTING, 1985, 14 (03) : 598 - 611
  • [40] Beyond ω-regular languages: ωT-regular expressions and their automata and logic counterparts
    Barozzini, David
    de Frutos-Escrig, David
    Della Monica, Dario
    Montanari, Angelo
    Sala, Pietro
    THEORETICAL COMPUTER SCIENCE, 2020, 813 : 270 - 304