A medvedev characterization of sets recognized by generalized finite automata

DOI10.1007/BF01706094zbMath0264.94038OpenAlexW2067193369MaRDI QIDQ5682255

O. L. Costich

Publication date: 1972

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01706094

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

On the equivalence of recursive and nonrecursive Datalog programs ⋮ Decidable containment of recursive queries ⋮ Classes of formal grammars

Cites Work

• Generalized finite automata theory with an application to a decision problem of second-order logic

This page was built for publication: A medvedev characterization of sets recognized by generalized finite automata