Some properties of iterated languages

DOI10.1007/S10849-016-9239-6MaRDI QIDQ2011823zbMATH OpenOpenAlexFDO

Authors Sh. 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

decidabilityiterationgeneralized quantifierssemantic automataFrege boundary

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4047163
• Picture iteration and picture ambiguity
• On the itarated shuffle of some regular languages
• scientific article; zbMATH DE number 1870548
• scientific article; zbMATH DE number 3970128

Cites work

• scientific article; zbMATH DE number 6003856 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3368555 (Why is no real title available?)
• A new stable hybrid three-dimensional generalized finite difference time domain algorithm for analyzing complex structures
• Beyond the frege boundary
• Computational Semantics for Monadic Quantifiers
• Essays in logical semantics
• First-order definable languages
• Further beyond the Frege boundary
• Generalized quantifiers and natural language
• On a generalization of quantifiers
• Polyadic quantifiers
• State complexity of combined operations with two basic operations
• The equivalence problem for deterministic pushdown automata is decidable
• The state complexities of some basic operations on regular languages
• \(L(A)=L(B)\)? A simplified decidability proof.
• \(L(A)=L(B)\)? decidability results from complete formal systems

Cited in

(7)

• scientific article; zbMATH DE number 4047163 (Why is no real title available?)
• scientific article; zbMATH DE number 947583 (Why is no real title available?)
• An Iteration Theorem for Simple Precedence Languages
• Iterated TGR Languages: Membership Problem and Effective Closure Properties
• Some properties of precedence languages
• scientific article; zbMATH DE number 641692 (Why is no real title available?)
• Cyclic languages and strongly cyclic languages

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

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