Language processing by QDVFA of order ``s

MaRDI QIDQ5262845zbMATH OpenFDO

Authors

Publication date 16 July 2015

zbMATH Keywords

formal languagesregular grammarquasi-deterministic virtual finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 6542558
• Quasi-deterministic finite automaton (QDFA)
• A notion of virtual deterministic finite automaton (VDFA) in language processing
• Equivalence of SDVFA of order \((s,t)\) with DFA, VDFA, NFA and \(\epsilon \)-NFA.
• scientific article; zbMATH DE number 6542560

Cited in

(8)

• scientific article; zbMATH DE number 5933095 (Why is no real title available?)
• scientific article; zbMATH DE number 6542558 (Why is no real title available?)
• scientific article; zbMATH DE number 6542560 (Why is no real title available?)
• Equivalence of SDVFA of order \((s,t)\) with DFA, VDFA, NFA and \(\epsilon \)-NFA.
• A notion of virtual deterministic finite automaton (VDFA) in language processing
• Quasi-deterministic finite automaton (QDFA)
• Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)
• Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)

This page was built for publication: Language processing by QDVFA of order ``\(s\)

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