dweiss commented on issue #13706:
URL: https://github.com/apache/lucene/issues/13706#issuecomment-2325203893
I like the brevity of using sameLanguage! :)
I keep trying to find a counterexample to the assertion that a
deterministic, total automaton must accept full language in each state
reachable from root (there may be more than one transition but they must cover
the full minAlphabet..maxAlphabet range, always ending in an accepting state
somewhere.
If so, it should be possible to implement isTotal as a full traversal of the
automaton in O(num states)? So something like this would also return true:
```
Automaton c =
Operations.repeat(
Operations.union(
Automata.makeCharRange(Character.MIN_CODE_POINT, 100),
Automata.makeCharRange(101, Character.MAX_CODE_POINT)));
System.out.println(c.toDot());
```
--
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For queries about this service, please contact Infrastructure at:
us...@infra.apache.org
---------------------------------------------------------------------
To unsubscribe, e-mail: issues-unsubscr...@lucene.apache.org
For additional commands, e-mail: issues-h...@lucene.apache.org
