Modal functions for concise definition of state machines and products

DOI10.1016/0020-0190(91)90011-6zbMath0749.68055OpenAlexW1976488570MaRDI QIDQ1183435

Victor Yodaiken

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0020-0190(91)90011-6

zbMATH Keywords

finite automatarecursive functions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recursive number theory. A development of recursive arithmetic in a logic-free equation calculus
• The varieties of arboreal experience
• Computation on binary tree-networks
• Application of model theoretic games to discrete linear orders and finite automata
• Hierarchies of Effective Descriptive Set Theory

This page was built for publication: Modal functions for concise definition of state machines and products