Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata

DOI10.1007/978-3-642-31653-1_19zbMath1370.68179OpenAlexW63776376MaRDI QIDQ3167496

Nans Lefebvre, Christos A. Kapoutsis

Publication date: 2 November 2012

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31653-1_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (2)

A Logical Characterization of Small 2NFAs ⋮ A Logical Characterization of Small 2NFAs

This page was built for publication: Analogs of Fagin’s Theorem for Small Nondeterministic Finite Automata