Some properties of iterated languages

DOI10.1007/s10849-016-9239-6zbMath1396.03083OpenAlexW2333983561MaRDI QIDQ2011823

Shane Steinert-Threlkeld

Publication date: 7 August 2017

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-016-9239-6

zbMATH Keywords

iterationdecidabilitygeneralized quantifierssemantic automataFrege boundary

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Logic with extra quantifiers and operators (03C80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• State complexity of combined operations with two basic operations
• Essays in logical semantics
• The state complexities of some basic operations on regular languages
• \(L(A)=L(B)\)? decidability results from complete formal systems
• \(L(A)=L(B)\)? A simplified decidability proof.
• On a generalization of quantifiers
• Generalized quantifiers and natural language
• Beyond the frege boundary
• Computational Semantics for Monadic Quantifiers
• The equivalence problem for deterministic pushdown automata is decidable
• Polyadic quantifiers
• A new stable hybrid three-dimensional generalized finite difference time domain algorithm for analyzing complex structures

This page was built for publication: Some properties of iterated languages