Quasi-deterministic finite automaton (QDFA)

zbMATH Open1205.68204MaRDI QIDQ4932041FDOQ4932041

Authors:

Publication date: 1 October 2010

Recommendations

• A notion of virtual deterministic finite automaton (VDFA) in language processing
• Language processing by QDVFA of order ``\(s\)
• \(\alpha\)-grammar and quasi-deterministic pushdown automata (QDPDA) of order ``\(n\)
• Characterizations of quantum automata
• scientific article; zbMATH DE number 2150274

zbMATH Keywords

nondeterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• An application of virtual deterministic finite automaton (VDFA) in natural language processing (NLP)
• Quasi-dependent variables in hybrid automata
• QRT FIFO automata, breadth-first grammars and their relations
• Quantitative monitor automata
• A notion of virtual deterministic finite automaton (VDFA) in language processing
• Language processing by QDVFA of order ``\(s\)
• \(\alpha\)-grammar and quasi-deterministic pushdown automata (QDPDA) of order ``\(n\)
• Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)
• Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

This page was built for publication: Quasi-deterministic finite automaton (QDFA)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4932041)