On finite representations of infinite-state behaviours

DOI10.1016/S0020-0190(99)00029-0zbMath1002.68093OpenAlexW2048783134MaRDI QIDQ1606922

Antonín Kučera

Publication date: 25 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(99)00029-0

zbMATH Keywords

regularityfinite-state representability

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (2)

A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ A general approach to comparing infinite-state systems with their finite-state specifications

This page was built for publication: On finite representations of infinite-state behaviours