REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES

DOI10.1142/S0129054107005133zbMath1202.68221OpenAlexW2030143386MaRDI QIDQ3065617

Helmut Jürgensen, Janusz A. 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

zbMATH Keywords

equivalencetracerewritingmodulespecificationautomatoncanonical

Mathematics Subject Classification ID

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

Related Items (2)

Applying string-rewriting to sequence-based specification ⋮ An axiom system for sequence-based specification

Cites Work

• Representation of a class of nondeterministic semiautomata by canonical words.
• A Formal Method for the Abstract Specification of Software
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Unnamed Item

This page was built for publication: REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES, PART II: SPECIFICATION OF SOFTWARE MODULES