Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Nicolae Sântean"'
Publikováno v:
Theoretical Computer Science. 330:23-34
Quite often, trivial problems stated for deterministic finite automata (DFA) are surprisingly difficult for the non-deterministic case (NFA). In any non-minimal DFA for a given regular language, we can find two equivalent states which can be “merge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::826a88aa7ed2bacddcbcc311431cf753
https://doi.org/10.1016/j.tcs.2004.09.008
https://doi.org/10.1016/j.tcs.2004.09.008
Publikováno v:
Theoretical Computer Science. 267(1-2):3-16
A cover-automaton A of a finite language L⊆Σ ∗ is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L . A minimal deterministic finite cover automaton (DFCA) of a finite
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5d8a7b8e1dd35fa911ce8744bc66af7
Publikováno v:
Implementation and Application of Automata ISBN: 9783540424918
CIAA
CIAA
Cover automata were introduced in [1] as an efficient representation of finite languages. In [1], an algorithm was given to transform a DFA that accepts a finite language to a minimal deterministic finite cover automaton (DFCA) with the time complexi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::795fdc95858942570fa06576c7fb41cd
https://doi.org/10.1007/3-540-44674-5_20
https://doi.org/10.1007/3-540-44674-5_20
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540666523
Workshop on Implementing Automata
Workshop on Implementing Automata
A cover-automaton A of a finite language L ⊆ Σ* is a finite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller siz
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33c96c831474381847db89563a8f6744
https://doi.org/10.1007/3-540-48057-9_4
https://doi.org/10.1007/3-540-48057-9_4
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.