Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet
J Jirásek, G Jirásková, A Szabari - International Conference on …, 2007 - Springer
We show that for all integers n and α such that n\leqslantα\leqslant2^n, there exists a
minimal nondeterministic finite automaton of n states with a four-letter input alphabet whose …
minimal nondeterministic finite automaton of n states with a four-letter input alphabet whose …
Reduced Languages as ω-Generators
S Julia, TV Duc - Developments in Language Theory: 11th International …, 2007 - Springer
We consider the following decision problem:“Is a rational ω-language generated by a
code?” Since 1994, the codes admit a in terms of infinite words. We derive from this result …
code?” Since 1994, the codes admit a in terms of infinite words. We derive from this result …