Comments (2)
Dear @wytseoortwijn,
I think, this is more of a discussion between partial and total automata. For prefix-closed languages (your automaton accepts the prefix-closed language {epsilon}), the minimal, total automaton representation will always have a sink state that collects all rejected words. Technically, this representation can be further minimized by removing the sink state and relying on the semantics of undefined transitions (which usually reject words).
Your use-case is especially mean, because you have a partial automaton with two equivalent sink states s1
and s2
. Unfortunately, AutomataLib has several places where the main algorithm is implemented for generic universal automata only which do not support special semantics such as "undefined transition" = "rejection". For generic automata, states/successors are often characterized structurally, e.g., via their state properties and transition properties of outgoing transitions, and differ from undefined successors. So this is not really an issue with the PaigeTarjan implementation but with the way the automaton structure is interpreted.
We are aware of this issue but haven't found a solution yet that doesn't require re-writing a lot of stuff.
For now, if you run into any issues with this, I would suggest you first decide which canonical representation you want (total vs. partial) and then either complete the automata beforehand (see, e.g. MutableDFAs
) or remove any dead-ends afterwards (see, e.g., ShrinkableAutomaton#removeState
).
from automatalib.
Related Issues (20)
- Bug in the strongly connected component algorithm HOT 2
- Java Building ERROR HOT 4
- CompactMealyTransition does not extend MealyTransition HOT 5
- Error testing serilaization-dot HOT 10
- Substract current automaton size to Wp-method's maxDepth HOT 2
- Replace JSR305 annotations
- Write a parser for LTSmin formulae
- Incorrect characterizing set for Mealy machine HOT 3
- TAF writer does not enquote outputs of mealy machines
- DOTParsers.mealy() not parsing all transitions HOT 13
- Minimizer.minimize overload without start states is broken HOT 2
- CompactMoore HOT 9
- Deviation in the BBC functionality between (at least) LearnLib 0.14.0 and 0.16.0 HOT 2
- Add support for Java 17 (LTS) to CI pipeline
- AUTParser only adds states with outgoing transitions
- How to minimize a chained mealy automata HOT 10
- M3C does not run on M1 MacBooks HOT 1
- Fail on javadoc warnings and improve documentation
- M3CParser fails when ID is a formula token
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from automatalib.