From languages to behaviors and back

DOI10.1007/978-3-031-15629-8_11zbMath1524.68170MaRDI QIDQ6163885

Markus Frohme, Bernhard Steffen

Publication date: 26 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

behaviorcontext-free languagesinstrumentationactive automata learningprocedural systems

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites Work

• Unnamed Item
• Learning register automata: from languages to program structures
• Improving active Mealy machine learning for protocol conformance testing
• Learning regular sets from queries and counterexamples
• Learning Register Automata with Fresh Value Generation
• Automata Learning with Automated Alphabet Abstraction Refinement
• Visibly pushdown languages
• Learning I/O Automata
• Automata Learning through Counterexample Guided Abstraction Refinement
• Automata, Languages and Programming
• Minimization, Learning, and Conformance Testing of Boolean Programs
• Computer Aided Verification
• Never-stop context-free learning

This page was built for publication: From languages to behaviors and back