Quasi-deterministic virtual finite automaton (QDVFA) of order s
From MaRDI portal
Publication:2878043
zbMATH Open1331.68133MaRDI QIDQ2878043FDOQ2878043
Publication date: 28 August 2014
Published in: Journal of Algebra and Discrete Structures (Search for Journal in Brave)
Recommendations
- Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)
- Equivalence between quasi-deterministic virtual finite automaton (QDVFA) of order \(s\) and regular grammar
- Quasi-deterministic finite automaton (QDFA)
- Semi-deterministic virtual finite automaton (SDVFA) of order \((s,t)\)
- [[:Publication:6112761|Title not available (Why is that?)]]
- [[:Publication:5502387|Title not available (Why is that?)]]
- Approximate determinization of quantitative automata
- Language processing by QDVFA of order ``\(s\)
- A notion of virtual deterministic finite automaton (VDFA) in language processing
- [[:Publication:5858835|Title not available (Why is that?)]]
Cited In (1)
This page was built for publication: Quasi-deterministic virtual finite automaton (QDVFA) of order \(s\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2878043)