2k citations
- Centro de Astrofísica da Universidade do PortoPT19 papers
- University of CambridgeGB11 papers
- Centre National de la Recherche ScientifiqueFR10 papers
- Laboratoire de Physique ThéoriqueFR7 papers
- Petersburg Nuclear Physics InstituteRU7 papers
- University of MinhoPT7 papers
- CEA Paris-SaclayFR5 papers
- Instituto de Ciencia de Materiales de MadridES5 papers
- Boston UniversityUS4 papers
- Universidade Federal da ParaíbaBR4 papers
- University of CoimbraPT4 papers
- Aarhus UniversityDK3 papers
Showing 2009 · cs.FLShow all
3 papers · 2 filters
cs.FL2009
Exact generation of acyclic deterministic finite automata
Marco Almeida, Nelma Moreira, Rogério Reis
We give a canonical representation for trim acyclic deterministic finite automata (Adfa) with n states over an alphabet of k symbols. Using this normal form, we present a backtrack…
cs.FL2009★ 7 cited
Testing the Equivalence of Regular Languages
Marco Almeida, Nelma Moreira, Rogério Reis
The minimal deterministic finite automaton is generally used to determine regular languages equality. Antimirov and Mosses proposed a rewrite system for deciding regular expression…
cs.FL2009
On the Representation of Finite Automata
Rogério Reis, Nelma Moreira, Marco Almeida
We give an unique string representation, up to isomorphism, for initially connected deterministic finite automata (ICDFAs) with n states over an alphabet of k symbols. We show how…