Filters








233,990 Hits in 3.8 sec

Testing the Equivalence of Regular Languages

Marco Almeida, Nelma Moreira, Rogério Reis
2009 Electronic Proceedings in Theoretical Computer Science  
Hopcroft and Karp proposed an almost linear algorithm for testing the equivalence of two deterministic finite automata that avoids minimisation.  ...  The minimal deterministic finite automaton is generally used to determine regular languages equality.  ...  Introduction The uniqueness of the minimal deterministic finite automaton for each regular language is in general used for determining regular languages equality.  ... 
doi:10.4204/eptcs.3.4 fatcat:623jramvnjgg5kvmudz5hhc5zm

SoftRegex: Generating Regex from Natural Language Descriptions using Softened Regex Equivalence

Jun-U Park, Sang-Ki Ko, Marco Cognetta, Yo-Sub Han
2019 Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)  
We continue the study of generating semantically correct regular expressions from natural language descriptions (NL).  ...  Our EQ Reg model essentially softens the equivalence of two regular expressions when used as a reward function.  ...  We say that two regular expressions are equivalent if they both define the same language.  ... 
doi:10.18653/v1/d19-1677 dblp:conf/emnlp/ParkKCH19 fatcat:zzyrdbzeqnas5cdaskg37z65su

Interactive manipulation of regular objects with FAdo

Nelma Moreira, Rogério Reis
2005 ACM SIGCSE Bulletin  
In this paper we focus in the description of interactive tools for teaching and assisting research on regular languages, and in particular finite automata and regular expressions.  ...  FAdo 1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages.  ...  ACKNOWLEDGEMENTS We thank the referees for their suggestions that helped to improve this paper. REFERENCES  ... 
doi:10.1145/1151954.1067537 fatcat:3fbkibxf4ba7zpeb42nhfu36ee

Interactive manipulation of regular objects with FAdo

Nelma Moreira, Rogério Reis
2005 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education - ITiCSE '05  
In this paper we focus in the description of interactive tools for teaching and assisting research on regular languages, and in particular finite automata and regular expressions.  ...  FAdo 1 is an ongoing project which aims the development of an interactive environment for symbolic manipulation of formal languages.  ...  ACKNOWLEDGEMENTS We thank the referees for their suggestions that helped to improve this paper. REFERENCES  ... 
doi:10.1145/1067445.1067537 dblp:conf/iticse/MoreiraR05 fatcat:66lgrhqopfaenlbtfiiz7b6ode

Page 3433 of Mathematical Reviews Vol. , Issue 89F [page]

1989 Mathematical Reviews  
The class of even linear languages properly contains the class of regular sets and is properly contained in the class of linear languages.  ...  It is proved that in order to capture observational equivalence exactly, all these forms of test- ing are needed, and thus that observational equivalence is at the top of the lattice of equivalences obtained  ... 

Page 3494 of Mathematical Reviews Vol. , Issue 94f [page]

1994 Mathematical Reviews  
test sets for regular and context-free languages.  ...  Each language is known to have a finite test set. This paper shows that it is possible to construct test sets of linear size efficiently for regular languages.  ... 

A Modified Completeness Theorem of KAT and Decidability of Term Reducibility [chapter]

Takeo Uramoto
2014 Lecture Notes in Computer Science  
In model-theoretic words, G Σ,B is a free Kleene algebra with tests generated over Σ and B (where B is the extended alphabet of KAT representing tests) in the same way that the algebra R Σ of regular languages  ...  the regular expression p as a regular language.  ... 
doi:10.1007/978-3-319-06251-8_6 fatcat:ktntbbvhy5dnlohbxo2s42jkfu

The equivalence of finite valued transducers (on HDT0L languages) is decidable

Karel Culik, Juhani Karhumäki
1986 Theoretical Computer Science  
Testing the equivalence of mappings which are realized by finite transducers on a regular language is a special case of the equivalence problem for finite transducers since a restriction of a finite transduction  ...  The decidability of testing the equivalence of mappings of certain types on languages from a family ~ has been considered by many authors.  ...  is decidable if and only if the problem of testing the equivalence of two finite substitutions on regular languages is decidable, cf  ... 
doi:10.1016/0304-3975(86)90134-9 fatcat:oo5w5wvy55chzl57d4537wromq

On the decidability of k-Block determinism [article]

Pascal Caron, Ludovic Mignot, Clément Miklarz
2017 arXiv   pre-print
They give a procedure performed on the minimal DFA, the BW-test, to decide whether a language is one-unambiguous.  ...  We also give a procedure which enumerates, for a given language, the finite set of compact deterministic k-block automata.  ...  The set of regular languages is exactly the set of languages that can be denoted by a regular expression. A regular expression is trim if it is ∅ or does not contain ∅.  ... 
arXiv:1705.10625v1 fatcat:jzowalo5nferpoitcmnylaizpm

Page 3199 of Mathematical Reviews Vol. , Issue 88f [page]

1988 Mathematical Reviews  
An equivalent form (which is the original one) states that any formal language has a test set, i.e., a finite subset with the property that if two morphisms into a free monoid agree on the test set then  ...  Moreover, some new decidability results are established, such as the decidability of the equivalence of inverses of finite substitutions on regular lan- guages. Juhani Karhumaki (Turku)  ... 

Deciding Kleene algebra terms equivalence in Coq

Nelma Moreira, David Pereira, Simão Melo de Sousa
2015 Journal of Logical and Algebraic Methods in Programming  
The algorithm decides equivalence of two given regular expressions through an iterated process of testing the equivalence of their partial derivatives and does not require the construction of the corresponding  ...  The algorithm decides equivalence of two given regular expressions through an iterated process of testing the equivalence of their partial derivatives and does not require the construction of the corresponding  ...  The authors also wish to acknowledge the anonymous reviewers for the detailed comments that helped to improve considerably this manuscript.  ... 
doi:10.1016/j.jlamp.2014.12.004 fatcat:5mshu6hn6bcrho67ye7hk2ax5m

SemRegex: A Semantics-Based Approach for Generating Regular Expressions from Natural Language Specifications

Zexuan Zhong, Jiaqi Guo, Wei Yang, Jian Peng, Tao Xie, Jian-Guang Lou, Ting Liu, Dongmei Zhang
2018 Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing  
The semantic correctness is measured using the DFA-equivalence oracle, random test cases, and distinguishing test cases.  ...  SemRegex provides solutions for a subtask of the program-synthesis problem: generating regular expressions from natural language.  ...  Acknowledgments The work from the authors at the University of Illinois at Urbana-Champaign was supported in part by National Science Foundation under grants no.  ... 
doi:10.18653/v1/d18-1189 dblp:conf/emnlp/ZhongGYPXLLZ18 fatcat:vansoeidmnbvbpl6do5ibmygne

Page 431 of Mathematical Reviews Vol. , Issue 87a [page]

1987 Mathematical Reviews  
We do not know any property of words matched by the words of regular languages, which is enough to ensure regularity.  ...  (NL-LEID-C) On the equivalence of compositions of morphisms and inverse morphisms on regular languages. (French summary) RAIRO Inform. Théor. 19 (1985), no. 3, 203-211.  ... 

Page 3876 of Mathematical Reviews Vol. , Issue 83i [page]

1983 Mathematical Reviews  
Moreover, he gives the result that the equivalence problem for LR-regular grammars is decidable if and only if the equivalence problem for LR(O) grammars is decidable.  ...  Different techniques to improve the implementation of the circularity test are also discussed.” Rozenberg, G. [Rozenberg, Grzegorz] 831:68118 On subwords of formal languages.  ... 

Infinitude of Primes Using Formal Languages

Aalok Thakkar
2018 The American mathematical monthly  
In this note, we discuss a certain class of formal languages, called regular languages, and put forward some elementary results.  ...  The properties of these languages are then employed to prove that there are infinitely many prime numbers.  ...  In 1956, Kleene proved the equivalence of the set of languages represented by regular expressions and the set of languages recognized by a DFA. We use this equivalence to define regular languages.  ... 
doi:10.1080/00029890.2018.1496761 fatcat:bql2ofwkcrajlomumcggvxrai4
« Previous Showing results 1 — 15 out of 233,990 results