Representation of semiautomata by canonical words and equivalences. II: Specification of software modules

DOI10.1142/S0129054107005133zbMATH Open1202.68221OpenAlexW2030143386MaRDI QIDQ3065617FDOQ3065617

Authors: Helmut Jürgensen, Janusz Brzozowski 

Publication date: 6 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054107005133

Recommendations

• Representation of a class of nondeterministic semiautomata by canonical words.
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Automata- and logic-based systems design
• Automata theory and model checking
• Trace rewriting systems

zbMATH Keywords

equivalenceautomatonspecificationtracerewritingmodulecanonical

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Representation of a class of nondeterministic semiautomata by canonical words.
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• A Formal Method for the Abstract Specification of Software

Cited In (4)

• Representation of a class of nondeterministic semiautomata by canonical words.
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• An axiom system for sequence-based specification
• Applying string-rewriting to sequence-based specification

This page was built for publication: Representation of semiautomata by canonical words and equivalences. II: Specification of software modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065617)