Add to ORKGThis paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state automata and finite-state transducers. Manipulations include determinization (both for finite-state accepters and finite-state transducers), minimization, composition, complementation, intersection, Kleene closure, etc. Furthermore, various visualization tools are available to browse finite-state automata. The toolbox is implemented in SICStus Prolog.</p
Finite-state devices such as finite-state automata and finite-state transducers have been known sinc...
This paper presents a new technique for efficiently calculating and remove indistinguishable states ...
The finite automata are mathematical models for finite state systems. More general finite automaton ...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
Finite state automata are widely used in the field of computer science such as formal verification, ...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
Finite-state methods are finding ever increasing use among linguists as a way of modeling phonology ...
Euclidean Automata (EA) are finite state computational devices that take continuous parameter vector...
In formal analysis we often encounter finite automata with a~large amount of states over large alpha...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
Abstract. We extend finite state registered automata (FSRA) to account for medium-distance dependenc...
This paper describes ASSyUCE, an exploratory environment for Finite State Machines. The environment ...
The goal of this thesis is to create an application that converts text form of a finite state machin...
Finite automata and finite transducers are used in a wide range of applications in software engineer...
Finite-state devices such as finite-state automata and finite-state transducers have been known sinc...
This paper presents a new technique for efficiently calculating and remove indistinguishable states ...
The finite automata are mathematical models for finite state systems. More general finite automaton ...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
This paper describes the FSA Utilities toolbox: a collection of utilities to manipulate finite-state...
Finite state automata are widely used in the field of computer science such as formal verification, ...
Finite State Automata (FSA) and their variants are natural tools adapted to the description of vario...
Finite-state methods are finding ever increasing use among linguists as a way of modeling phonology ...
Euclidean Automata (EA) are finite state computational devices that take continuous parameter vector...
In formal analysis we often encounter finite automata with a~large amount of states over large alpha...
In this diploma work the concept of formal language is presented, introducing the ideas related to ...
Abstract. We extend finite state registered automata (FSRA) to account for medium-distance dependenc...
This paper describes ASSyUCE, an exploratory environment for Finite State Machines. The environment ...
The goal of this thesis is to create an application that converts text form of a finite state machin...
Finite automata and finite transducers are used in a wide range of applications in software engineer...
Finite-state devices such as finite-state automata and finite-state transducers have been known sinc...
This paper presents a new technique for efficiently calculating and remove indistinguishable states ...
The finite automata are mathematical models for finite state systems. More general finite automaton ...