Old Web
English
Sign In
Acemap
>
Paper
>
A Non-deterministic Tokeniser for Finite-State Parsing
A Non-deterministic Tokeniser for Finite-State Parsing
1996
Jean-Pierre Chanod
Keywords:
Deterministic automaton
Discrete mathematics
Probabilistic automaton
Deterministic finite automaton
Pushdown automaton
Powerset construction
Büchi automaton
Two-way deterministic finite automaton
Nondeterministic finite automaton
Computer science
Correction
Cite
Save
Machine Reading By IdeaReader
9
References
14
Citations
NaN
KQI
[]