Language processing by QDVFA of order ``s

zbMATH Open1331.68135MaRDI QIDQ5262845FDOQ5262845

Authors:

Publication date: 16 July 2015

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

zbMATH Keywords

formal languagesregular grammarquasi-deterministic virtual finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (8)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)