A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
From MaRDI portal
Publication:6166837
DOI10.1007/978-3-031-23612-9_10zbMath1528.68190OpenAlexW4313445215MaRDI QIDQ6166837
D. Gnanaraj Thomas, Abhisek Midya
Publication date: 3 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-23612-9_10
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning regular omega languages
- Active learning for extended finite state machines
- FM 2009: Formal methods. Second world congress, Eindhoven, The Netherlands, November 2--6, 2009. Proceedings
- Learning regular sets from queries and counterexamples
- Inference of even linear grammars and its application to picture description languages
- Grammatical inference for even linear languages based on control sets
- Learning regular languages from counterexamples
- Learning deterministic even linear languages from positive examples
- On syntactic congruences for \(\omega\)-languages
- Polynomial time learner for inferring subclasses of internal contextual grammars with local maximum selectors
- Simple picture processing based on finite automata and regular grammars
- When won't membership queries help?
- Simulating parallel internal column contextual array grammars using two-dimensional parallel restarting automata with multiple windows
- Two-dimensional pattern matching against basic picture languages
- Inference of finite automata using homing sequences
- A hierarchy of language families learnable by regular language learning
- Learning Deterministic Finite Automata from Smallest Counterexamples
- Polynomial Time Algorithm for Inferring Subclasses of Parallel Internal Column Contextual Array Languages
- A Common Framework to Recognize Two-dimensional Languages*
- On a family of linear grammars
- Control sets on grammars
- Language identification in the limit
This page was built for publication: A Myhill-Nerode theorem for finite state matrix automata and finite matrix languages
