Efficient POSIX submatch extraction on nondeterministic finite automata

2020 ◽  
Vol 51 (2) ◽  
pp. 159-192
Author(s):  
Angelo Borsotti ◽  
Ulya Trofimovich
Keyword(s):  
Finite Automata ◽  
Nondeterministic Finite Automata

Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet

2007 ◽  
pp. 254-265 ◽  
Author(s):  
Jozef Jirásek ◽  
Galina Jirásková ◽  
Alexander Szabari
Keyword(s):  
Finite Automata ◽  
Nondeterministic Finite Automata

State Complexity of Union and Intersection for Two-way Nondeterministic Finite Automata

2011 ◽  
Vol 110 (1-4) ◽  
pp. 231-239 ◽  
Author(s):  
Michal Kunc ◽  
Alexander Okhotin
Keyword(s):  
Finite Automata ◽  
State Complexity ◽  
Nondeterministic Finite Automata

On the stabilization of nondeterministic finite automata via static output feedback

2020 ◽  
Vol 365 ◽  
pp. 124687 ◽  
Author(s):  
Zhipeng Zhang ◽  
Chengyi Xia ◽  
Zengqiang Chen
Keyword(s):  
Output Feedback ◽  
Finite Automata ◽  
Static Output Feedback ◽  
Nondeterministic Finite Automata ◽  
Static Output

Some algorithms for equivalent transformation of nondeterministic finite automata

2009 ◽  
Vol 53 (4) ◽  
pp. 54-57
Author(s):  
B. F. Mel’nikov ◽  
M. R. Saifullina
Keyword(s):  
Finite Automata ◽  
Equivalent Transformation ◽  
Nondeterministic Finite Automata

MAGIC NUMBERS FOR SYMMETRIC DIFFERENCE NFAS

2005 ◽  
Vol 16 (05) ◽  
pp. 1027-1038 ◽  
Author(s):  
LYNETTE VAN ZIJL
Keyword(s):  
Finite Automaton ◽  
Finite Automata ◽  
Symmetric Difference ◽  
Magic Numbers ◽  
Deterministic Finite Automaton ◽  
Nondeterministic Finite Automata ◽  
Binary Case ◽  
Nondeterministic Finite Automaton

Iwama et al. showed that there exists an n-state binary nondeterministic finite automaton such that its equivalent minimal deterministic finite automaton has exactly 2n - α states, for all n ≥ 7 and 5 ≤ α ≤ 2n-2, subject to certain coprimality conditions. We investigate the same question for both unary and binary symmetric difference nondeterministic finite automata. In the binary case, we show that for any n ≥ 4, there is an n-state symmetric difference nondeterministic finite automaton for which the equivalent minimal deterministic finite automaton has 2n - 1 + 2k - 1 - 1 states, for 2 < k ≤ n - 1. In the unary case, we consider a large practical subclass of unary symmetric difference nondeterministic finite automata: for all n ≥ 2, we argue that there are many values of α such that there is no n-state unary symmetric difference nondeterministic finite automaton with an equivalent minimal deterministic finite automaton with 2n - α states, where 0 < α < 2n - 1. For each n ≥ 2, we quantify such values of α precisely.

Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems

2010 ◽  
Vol 104 (3) ◽  
pp. 267-283 ◽  
Author(s):  
Boris Melnikov
Keyword(s):  
Finite Automata ◽  
Nondeterministic Finite Automata
Sign in / Sign up

Export Citation Format

Share Document