An intersection problem for finite automata

DOI10.1016/0166-218X(88)90070-4zbMath0668.68066OpenAlexW1979050793MaRDI QIDQ1118410

Michael E. Saks, Richard Statman

Publication date: 1988

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(88)90070-4

zbMATH Keywords

combinatorslogical relationsintersection conditioninitial finite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Combinatory logic and lambda calculus (03B40)

Related Items (1)

A characterization of lambda definability in categorical models of implicit polymorphism

Cites Work

• The lambda calculus, its syntax and semantics
• Logical relations and the typed λ-calculus
• Completeness, invariance and λ-definability
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An intersection problem for finite automata