Deterministic Parikh automata on infinite words.
Mario GroblerSebastian SiebertzPublished in: CoRR (2024)
Keyphrases
- turing machine
- finite state automaton
- regular languages
- deterministic finite automata
- n gram
- word sense disambiguation
- probabilistic automata
- word segmentation
- finite state automata
- related words
- multiword
- word recognition
- regular expressions
- neural network
- database
- finite state machines
- word pairs
- black box
- text documents
- cellular automata
- english words
- keywords
- data sets