Search
Abstract
We present a method to store additional information in a minimal automaton so that it is possible to compute a corresponding tree node number for a state. The number can then be used to retrieve additional information. The method works for minimal (and any other) deterministic acyclic finite state automata (DFAs). We also show how to compute the inverse mapping.
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- publikacja w wydawnictwie zbiorowym recenzowanym (także w materiałach konferencyjnych)
- Title of issue:
- Proceeding of the 12th International Conference on Finite-State Methods in Natural Language Processing, Duesseldorf, 2015 strony 1 - 4
- Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Daciuk J.: Preserving Trees in Automata// Proceeding of the 12th International Conference on Finite-State Methods in Natural Language Processing, Duesseldorf, 2015/ ed. Thomas Hanneforth, Christian Wurm Duesseldorf: Universitaet Duesseldorf, 2015, s.1-4
- Verified by:
- Gdańsk University of Technology
seen 61 times