Types from Frames as Finite Automata

DOI10.1007/978-3-662-53042-9_2MaRDI QIDQ2835042zbMATH OpenOpenAlexFDO

Authors Tim Fernando

Publication date 1 December 2016

Published in Formal Grammar (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53042-9_2

zbMATH Keywords

derivativefinite automatonframeinstitutiontrace

Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• Typestates to automata and back: a tool
• TYPENESS FOR ω-REGULAR AUTOMATA
• Automated Technology for Verification and Analysis
• On proper languages and transformations of lexicalized types of automata
• Higher types, finite domains and resource-bounded Turing machines
• Automorphisms of types and their applications
• Finite automata over structures (extended abstract)
• Automath and Pure Type Systems
• Simply typed fixpoint calculus and collapsible pushdown automata
• scientific article; zbMATH DE number 1195268

Cites work

• Algebraic laws for nondeterminism and concurrency
• Derivatives of Regular Expressions
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 757637 (Why is no real title available?)
• scientific article; zbMATH DE number 3366846 (Why is no real title available?)
• Institutions: abstract model theory for specification and programming
• Some fundamental algebraic tools for the semantics of computation. III: Indexed categories

Cited in

(5)

• Atoms in semantic frames
• Steedman's temporality proposal and finite automata
• Frame of an automaton
• Why These Automata Types?
• Finite automata in the mathematical theory of programming

This page was built for publication: Types from Frames as Finite Automata

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