Minimal consistent DFA revisited (Q306711): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 12:49, 12 July 2024

scientific article

Language	Label	Description	Also known as
English	Minimal consistent DFA revisited	scientific article

Statements

scholarly article

0 references

Minimal consistent DFA revisited (English)

0 references

Manuel Vázquez de Parga

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

1 September 2016

0 references

zbMATH Keywords

minimal consistent DFA

0 references

uniformly-complete sample

0 references

DFA identification

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2016.07.023

0 references

0 references

Complexity of automaton identification from given data

0 references

On the complexity of minimum inference of regular sets

0 references

Minimal cover-automata for finite languages

0 references

On Separation by Locally Testable and Locally Threshold Testable Languages

0 references

Separating Regular Languages with First-Order Logic

0 references

Learning Minimal Separating DFA’s for Compositional Verification

0 references

On state reduction of incompletely specified finite state machines

0 references

Computing Minimal Separating DFAs and Regular Invariants Using SAT and SMT Solvers

0 references

0 references

Language identification in the limit

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.tcs.2016.07.023

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:306711

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q306711&oldid=36270317"