#############################################################################
## This program is free software: you can redistribute it and/or modify
## it under the terms of the GNU General Public License as published by
## the Free Software Foundation, either version 2 of the License, or
## (at your option) any later version.
##
## This program is distributed in the hope that it will be useful,
## but WITHOUT ANY WARRANTY; without even the implied warranty of
## MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
## GNU General Public License for more details.
##
#W automata.gd Ruth Hoffmann
##
##
#Y Copyright (C) 2004-2015 School of Computer Science,
#Y University of St. Andrews, North Haugh,
#Y St. Andrews, Fife KY16 9SS, Scotland
##
################################################################################
##
#F NDIntersectionAutomaton(aut1,aut2)
##
## A faster automata intersection algorithm, which does not turn the automata
## deterministic.
##
DeclareGlobalFunction( "NDIntersectionAutomaton" );
################################################################################
##
#F NDUnionAutomata(aut1,aut2)
##
## A faster automata union algorithm, which does not turn the automata
## deterministic.
##
DeclareGlobalFunction( "NDUnionAutomata" );
################################################################################
##
#F NDProductOfLanguages(aut1,aut2)
##
## A faster automata concatenation algorithm, which does not turn the automata
## deterministic.
##
DeclareGlobalFunction( "NDProductOfLanguages" );
#############################################################################
##
#F PCMinimalizedAut(A)
##
## Minimalisation algorithm, with no assertions.
##
##
DeclareGlobalFunction( "PCMinimalizedAut" );
DeclareAttribute("PCMinimalAutomaton", IsAutomatonObj);
#############################################################################
##
#F PCReducedNFA(aut)
##
## Again we got rid of the Assertion
##
DeclareGlobalFunction( "PCReducedNFA" );
¤ Dauer der Verarbeitung: 0.13 Sekunden
(vorverarbeitet am 2026-10-12)
¤
*© Formatika GbR, Deutschland
